The phase transition in inhomogeneous random graphs

@article{Bollobs2007ThePT,
title={The phase transition in inhomogeneous random graphs},
author={B{\'e}la Bollob{\'a}s and Svante Janson and Oliver Riordan},
journal={Random Struct. Algorithms},
year={2007},
volume={31},
pages={3-122}
}

The ‘classical’ random graph models, in particular G(n, p), are ‘homogeneous’, in the sense that the degrees (for example) tend to be concentrated around a typical value. Many graphs arising in the real world do not have this property, having, for example, power-law degree distributions. Thus there has been a lot of recent interest in defining and studying ‘inhomogeneous’ random graph models. One of the most studied properties of these new models is their ‘robustness’, or, equivalently, the… CONTINUE READING