Emergence and size of the giant component in clustered random graphs with a given degree distribution

Yakir Berchenko, Yael Artzy-Randrup, Mina Teicher, Lewi Stone

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

Standard techniques for analyzing network models usually break down in the presence of clustering. Here we introduce a new analytic tool, the "free-excess degree" distribution, which extends the generating function framework, making it applicable for clustered networks (C>0). The methodology is general and provides a new expression for the threshold point at which the giant component emerges and shows that it scales as (1-C)-1. In addition, the size of the giant component may be predicted even for more complicated scenarios such as the removal of a fixed fraction of nodes at random.

Original languageEnglish
Article number138701
JournalPhysical Review Letters
Volume102
Issue number13
DOIs
StatePublished - 30 Mar 2009
Externally publishedYes

Fingerprint

Dive into the research topics of 'Emergence and size of the giant component in clustered random graphs with a given degree distribution'. Together they form a unique fingerprint.

Cite this