B. Bollobás, S. Janson, O. Riordan
2005.4.29RANDOM STRUCTURES & ALGORITHMS
tlooto Summary
The “classical” random graph models, in particular G(n,p), are “homogeneous,” in the sense that the degrees tend to be concentrated around a typical value.
Abstract
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.
Citation format
BOLLOBÁS, B.; JANSON, S.; RIORDAN, O. The phase transition in inhomogeneous random graphs [preprint]. arXiv, 2005. arXiv:math/0504589.