Modern architecture of random graphs: Constructions and correlations
Statistical Mechanics
2007-05-23 v1
Abstract
1. Basic constructions. 2. Equilibrium and nonequilibrium networks. 3. Equilibrium uncorrelated networks. 4. Nonequilibrium nongrowing scale-free nets. 5. Types of correlations. 6. When pair correlations are important. 7. When loops are important. 8. Pair degree-degree correlations in growing networks. 9. How to construct an equilibrium net with given degree-degree correlations. 10. How to construct a growing scale-free net with a given clustering (towards a real-space renormalization group for networks).
Keywords
Cite
@article{arxiv.cond-mat/0206467,
title = {Modern architecture of random graphs: Constructions and correlations},
author = {S. N. Dorogovtsev and J. F. F. Mendes and A. N. Samukhin},
journal= {arXiv preprint arXiv:cond-mat/0206467},
year = {2007}
}
Comments
6 pages, a talk given at XVIII Sitges Conference