Dynamic bond percolation in networks

Bond percolation is a network process that traditionally addresses the question when there is a path between two sites or two clusters in a network. This has been used to study the circulation of goods or flows in networked structures as well as network resilience. This paper proposes and analyzes a dynamic bond percolation model where bonds (i.e., edges) open (i.e., form) or close (i.e., terminate) according to random micro interactions. We model the edge dynamics through topology independent and topology-dependent processes - spontaneous formation or termination of edges and the formation of edge {a, b} between two sites a and b that depends on the current number of existing edges at a and b. We show that the resulting network process is Markov and reversible, and we determine analytically its equilibrium distribution, avoiding having to solve a eigenvalue-eigenvector problem that quickly becomes intractable for even moderate sized networks.

[1]  Alessandro Vespignani,et al.  Epidemic dynamics in finite size scale-free networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[3]  José M. F. Moura,et al.  Accounting for topology in spreading contagion in non-complete networks , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[4]  José M. F. Moura,et al.  Threshold behavior of epidemics in regular networks , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  M. Newman,et al.  Epidemics and percolation in small-world networks. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[6]  José M. F. Moura,et al.  Diffusion in Social Networks as SIS Epidemics: Beyond Full Mixing and Complete Graphs , 2014, IEEE Journal of Selected Topics in Signal Processing.

[7]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[8]  J. Hammersley,et al.  Percolation processes , 1957, Mathematical Proceedings of the Cambridge Philosophical Society.

[9]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[10]  José M. F. Moura,et al.  Subgraph density and epidemics over networks , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[11]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[12]  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..

[13]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[14]  Jon M. Kleinberg,et al.  Subgraph frequencies: mapping the empirical and extremal geography of large graph collections , 2013, WWW.