Modern architecture of random graphs: Constructions and correlations
classification
❄️ cond-mat.stat-mech
keywords
correlationsnetworksequilibriumconstructconstructionsdegree-degreegivengrowing
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.