arXiv:0905.0437 [math.PR]AbstractReferencesReviewsResources
Susceptibility in inhomogeneous random graphs
Published 2009-05-04Version 1
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in practice one of its main uses is that it often gives a way of determining the critical point by solving certain linear equations. Here we relate the susceptibility of suitable random graphs to a quantity associated to the corresponding branching process, and study both quantities in various natural examples.
Comments: 51 pages
Journal: Electronic J. Combinatorics 19 (2012), P31 (59 pages)
Keywords: inhomogeneous random graphs, susceptibility, natural examples, phase transitions, random vertex
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1510.08882 [math.PR] (Published 2015-10-29)
The diameter of Inhomogeneous random graphs
arXiv:1210.6259 [math.PR] (Published 2012-10-23)
Connectivity of inhomogeneous random graphs
arXiv:0812.3007 [math.PR] (Published 2008-12-16)
Asymptotics for the size of the largest component scaled to "log n" in inhomogeneous random graphs