Network Reconstruction and Prediction of Epidemic Outbreaks for NIMFA Processes.

Predicting the viral dynamics of an epidemic process requires the knowledge of the underlying contact network. However, the network is not known for most applications and has to be inferred from observing the viral state evolution instead. We propose a polynomial-time network reconstruction algorithm for the discrete-time NIMFA model based on a basis pursuit formulation. Given only few initial viral state observations, the network reconstruction method allows for an accurate prediction of the further viral state evolution of every node provided that the network is sufficiently sparse.

[1]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[2]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[3]  Piet Van Mieghem,et al.  Virus Spread in Networks , 2009, IEEE/ACM Transactions on Networking.

[4]  Tamer Basar,et al.  Analysis, Estimation, and Validation of Discrete-Time Epidemic Processes , 2020, IEEE Transactions on Control Systems Technology.

[5]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[6]  Piet Van Mieghem,et al.  Maximum-Likelihood Network Reconstruction for SIS Processes is NP-Hard , 2018, ArXiv.

[7]  P. V. Mieghem,et al.  Performance Analysis of Complex Networks and Systems , 2014 .

[8]  J. Snow.  On the Mode of Communication of Cholera , 1856, Edinburgh medical journal.

[9]  P. Van Mieghem.  The N-intertwined SIS epidemic network model , 2011 .

[10]  P. Olver.  Nonlinear Systems , 2013 .

[11]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[12]  Dustin G. Mixon,et al.  Certifying the Restricted Isometry Property is Hard , 2012, IEEE Transactions on Information Theory.

[13]  Piet Van Mieghem,et al.  Graph Spectra for Complex Networks , 2010 .

[14]  Piet Van Mieghem,et al.  Epidemic processes in complex networks , 2014, ArXiv.

[15]  Yonina C. Eldar,et al.  Introduction to Compressed Sensing , 2022 .

[16]  Caterina Scoglio,et al.  Identification of Missing Links Using Susceptible-Infected-Susceptible Spreading Traces , 2019, IEEE Transactions on Network Science and Engineering.

[17]  Wen-Xu Wang,et al.  Reconstructing propagation networks with natural diversity and identifying hidden sources , 2014, Nature Communications.

[18]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[19]  J. Stoer,et al.  Introduction to Numerical Analysis , 2002 .

[20]  C. O’Brien.  Statistical Learning with Sparsity: The Lasso and Generalizations , 2016 .

[21]  Bastian Prasse,et al.  Exact Network Reconstruction from Complete SIS Nodal State Infection Information Seems Infeasible , 2019, IEEE Transactions on Network Science and Engineering.

[22]  Per Christian Hansen,et al.  Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank , 1990, SIAM J. Sci. Comput..

[23]  S. Geer,et al.  On the conditions used to prove oracle results for the Lasso , 2009, 0910.0722.

[24]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[25]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[26]  Michael A. Saunders,et al.  LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[27]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .