arXiv · cond-mat/0206467
Modern architecture of random graphs: Constructions and correlations
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).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin. 2002-06-24. Modern architecture of random graphs: Constructions and correlations. https://arxiv.org/abs/cond-mat/0206467
Cite the original work for its findings. Save a collection to share your selection of sources.