Network forensics: random infection vs spreading epidemic

Computer (and human) networks have long had to contend with spreading viruses. Effectively controlling or curbing an outbreak requires understanding the dynamics of the spread. A virus that spreads by taking advantage of physical links or user-acquaintance links on a social network can grow explosively if it spreads beyond a critical radius. On the other hand, random infections (that do not take advantage of network structure) have very different propagation characteristics. If too many machines (or humans) are infected, network structure becomes essentially irrelevant, and the different spreading modes appear identical. When can we distinguish between mechanics of infection? Further, how can this be done efficiently? This paper studies these two questions. We provide sufficient conditions for different graph topologies, for when it is possible to distinguish between a random model of infection and a spreading epidemic model, with probability of misclassification going to zero. We further provide efficient algorithms that are guaranteed to work in different regimes.

[1]  S. Hougardy,et al.  Approximation Algorithms for the Steiner Tree Problem in Graphs , 2001 .

[2]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[3]  P. O’Neill,et al.  Bayesian inference for stochastic multitype epidemics in structured populations via random graphs , 2005 .

[4]  H. Kesten On the Speed of Convergence in First-Passage Percolation , 1993 .

[5]  Russell Lyons,et al.  Random walk in a random environment and rst-passage percolation on trees , 1992 .

[6]  Panos M. Pardalos,et al.  Steiner Tree Problems , 2009, Encyclopedia of Optimization.

[7]  Rick Durrett,et al.  Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics) , 2006 .

[8]  Fan Chung Graham,et al.  The Diameter of Sparse Random Graphs , 2001, Adv. Appl. Math..

[9]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[10]  Gavin J. Gibson,et al.  Statistical inference for stochastic epidemic models , 2002 .

[11]  R. Durrett Random Graph Dynamics: References , 2006 .

[12]  Kevin Borders,et al.  Social networks and context-aware spam , 2008, CSCW.

[13]  Frank Ball,et al.  Poisson approximations for epidemics with two levels of mixing , 2004 .

[14]  Devavrat Shah,et al.  Detecting sources of computer viruses in networks: theory and experiment , 2010, SIGMETRICS '10.

[15]  Yuval Peres,et al.  Tree-indexed random walks on groups and first passage percolation , 1994 .

[16]  Vijaya Ramachandran,et al.  The diameter of sparse random graphs , 2007, Random Struct. Algorithms.

[17]  Devavrat Shah,et al.  Rumors in a Network: Who's the Culprit? , 2009, IEEE Transactions on Information Theory.

[18]  Aditya Gopalan,et al.  Random mobility and the spread of infection , 2011, 2011 Proceedings IEEE INFOCOM.

[19]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  P. O’Neill,et al.  Bayesian inference for epidemics with two levels of mixing , 2005 .

[21]  V. Blondel,et al.  Distance distribution in random graphs and application to network exploration. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.