arXiv Analytics

Sign in

arXiv:0912.4204 [cond-mat.stat-mech]AbstractReferencesReviewsResources

How clustering affects the bond percolation threshold in complex networks

James P. Gleeson, Sergey Melnik, Adam Hackett

Published 2009-12-21, updated 2010-04-16Version 2

The question of how clustering (non-zero density of triangles) in networks affects their bond percolation threshold has important applications in a variety of disciplines. Recent advances in modelling highly-clustered networks are employed here to analytically study the bond percolation threshold. In comparison to the threshold in an unclustered network with the same degree distribution and correlation structure, the presence of triangles in these model networks is shown to lead to a larger bond percolation threshold (i.e. clustering \emph{increases} the epidemic threshold or \emph{decreases} resilience of the network to random edge deletion).

Comments: 10 pages, 4 figures. Added new Appendix D, updated figures.
Journal: Phys. Rev. E. 81 066114 (2010)
Related articles: Most relevant | Search more
arXiv:0903.2584 [cond-mat.stat-mech] (Published 2009-03-14, updated 2009-09-26)
Curvature and temperature of complex networks
arXiv:1012.4336 [cond-mat.stat-mech] (Published 2010-12-20)
Heterogeneous-k-core versus Bootstrap Percolation on Complex Networks
arXiv:1003.5583 [cond-mat.stat-mech] (Published 2010-03-29, updated 2010-05-26)
Bootstrap Percolation on Complex Networks