Susceptibility in inhomogeneous random graphs
Probability
2012-03-27 v1 Combinatorics
Abstract
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.
Cite
@article{arxiv.0905.0437,
title = {Susceptibility in inhomogeneous random graphs},
author = {Svante Janson and Oliver Riordan},
journal= {arXiv preprint arXiv:0905.0437},
year = {2012}
}
Comments
51 pages