Modern architecture of random graphs: Constructions and correlations

Simple item page
dc.creatorDorogovtsev, S. N.
dc.creatorMendes, J. F. F.
dc.creatorSamukhin, A. N.
dc.date2002-06-24
dc.date.accessioned2026-07-07T02:45:57Z
dc.date.available2026-07-07T02:45:57Z
dc.description1. 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).
dc.description6 pages, a talk given at XVIII Sitges Conference
dc.identifierhttps://arxiv.org/abs/cond-mat/0206467
dc.identifierhttp://arxiv.org/abs/cond-mat/0206467
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19493
dc.subjectStatistical Mechanics
dc.titleModern architecture of random graphs: Constructions and correlations
dc.typetext

Files

Collections

arXiv