Analytical approach to bond percolation on clustered networks

Sergey Melnik; James P. Gleeson

doi:10.1007/978-3-642-01206-8_13

Analytical approach to bond percolation on clustered networks

Sergey Melnik, James P. Gleeson

Department of Mathematics and Statistics

University of Limerick

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

An analytical approach to calculating bond percolation thresholds and sizes of giant connected components on random networks with non-zero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Pop. Biol. 71, 160 (2007)] model of cliques embedded in tree-like random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the percolation thresholds is examined and contrasted with some recent results in the literature.

Original language	English
Title of host publication	Complex Networks
Subtitle of host publication	Results of the 2009 International Workshop on Complex Networks (CompleNet 2009)
Editors	Santo Fortunato, Giuseppe Mangioni, Ronaldo Menezes, Vincenzo Nicosia
Publisher	Springer Verlag
Pages	147-159
Number of pages	13
ISBN (Print)	9783642012051
DOIs	https://doi.org/10.1007/978-3-642-01206-8_13
Publication status	Published - 2009

Publication series

Name	Studies in Computational Intelligence
Volume	207
ISSN (Print)	1860-949X

Access to Document

10.1007/978-3-642-01206-8_13

Cite this

Melnik, S., & Gleeson, J. P. (2009). Analytical approach to bond percolation on clustered networks. In S. Fortunato, G. Mangioni, R. Menezes, & V. Nicosia (Eds.), Complex Networks: Results of the 2009 International Workshop on Complex Networks (CompleNet 2009) (pp. 147-159). (Studies in Computational Intelligence; Vol. 207). Springer Verlag. https://doi.org/10.1007/978-3-642-01206-8_13

@inproceedings{b450bfbbae524209b6ecd9694db0dfef,

title = "Analytical approach to bond percolation on clustered networks",

abstract = "An analytical approach to calculating bond percolation thresholds and sizes of giant connected components on random networks with non-zero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Pop. Biol. 71, 160 (2007)] model of cliques embedded in tree-like random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the percolation thresholds is examined and contrasted with some recent results in the literature.",

author = "Sergey Melnik and Gleeson, {James P.}",

year = "2009",

doi = "10.1007/978-3-642-01206-8_13",

language = "English",

isbn = "9783642012051",

series = "Studies in Computational Intelligence",

publisher = "Springer Verlag",

pages = "147--159",

editor = "Santo Fortunato and Giuseppe Mangioni and Ronaldo Menezes and Vincenzo Nicosia",

booktitle = "Complex Networks",

}

Melnik, S & Gleeson, JP 2009, Analytical approach to bond percolation on clustered networks. in S Fortunato, G Mangioni, R Menezes & V Nicosia (eds), Complex Networks: Results of the 2009 International Workshop on Complex Networks (CompleNet 2009). Studies in Computational Intelligence, vol. 207, Springer Verlag, pp. 147-159. https://doi.org/10.1007/978-3-642-01206-8_13

Analytical approach to bond percolation on clustered networks. / Melnik, Sergey; Gleeson, James P.
Complex Networks: Results of the 2009 International Workshop on Complex Networks (CompleNet 2009). ed. / Santo Fortunato; Giuseppe Mangioni; Ronaldo Menezes; Vincenzo Nicosia. Springer Verlag, 2009. p. 147-159 (Studies in Computational Intelligence; Vol. 207).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Analytical approach to bond percolation on clustered networks

AU - Melnik, Sergey

AU - Gleeson, James P.

PY - 2009

Y1 - 2009

N2 - An analytical approach to calculating bond percolation thresholds and sizes of giant connected components on random networks with non-zero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Pop. Biol. 71, 160 (2007)] model of cliques embedded in tree-like random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the percolation thresholds is examined and contrasted with some recent results in the literature.

AB - An analytical approach to calculating bond percolation thresholds and sizes of giant connected components on random networks with non-zero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Pop. Biol. 71, 160 (2007)] model of cliques embedded in tree-like random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the percolation thresholds is examined and contrasted with some recent results in the literature.

UR - http://www.scopus.com/inward/record.url?scp=65449168325&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-01206-8_13

DO - 10.1007/978-3-642-01206-8_13

M3 - Conference contribution

AN - SCOPUS:65449168325

SN - 9783642012051

T3 - Studies in Computational Intelligence

SP - 147

EP - 159

BT - Complex Networks

A2 - Fortunato, Santo

A2 - Mangioni, Giuseppe

A2 - Menezes, Ronaldo

A2 - Nicosia, Vincenzo

PB - Springer Verlag

ER -

Analytical approach to bond percolation on clustered networks

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this