University of Limerick Institutional Repository

Analytical results for bond percolation and k-core sizes on clustered networks

DSpace Repository

Show simple item record Gleeson, James P. Melnik, Sergey 2010-01-08T11:01:20Z 2010-01-08T11:01:20Z 2009
dc.identifier.citation Gleeson, J.P. and (Melnik, S. 2009) 'Analytical results for bond percolation and k-core sizes on clustered networks' Phys. Rev. E 80, 046121 en_US
dc.description peer-reviewed
dc.description.abstract An analytical approach to calculating bond percolation thresholds, sizes of k-cores, and sizes of giant connected components on structured random networks with nonzero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Popul. Biol. 71, 160 (2007)] model of cliques embedded in treelike random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the bond percolation thresholds for networks of this type is examined and contrasted with some recent results in the literature. For very high levels of clustering the percolation threshold in these generalized Trapman networks is increased above the value it takes in a randomly wired (unclustered) network of the same degree distribution. In assortative scale-free networks, where the variance of the degree distribution is infinite, this clustering effect can lead to a nonzero percolation (epidemic) threshold. en_US
dc.description.sponsorship Science Foundation Ireland: 06/IN.1/I366, MACSI, and 05/RFP/MAT0016 en_US
dc.description.sponsorship SFI
dc.publisher American Physical Society en_US
dc.relation.ispartofseries Physical Review E;80 Art No. 046121
dc.subject network theory en_US
dc.subject percolation en_US
dc.title Analytical results for bond percolation and k-core sizes on clustered networks en_US
dc.type Journal Article en_US
dc.type.supercollection all_ul_research en_US
dc.type.supercollection ul_published_reviewed en_US
dc.type.restriction none en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account