Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs
From MaRDI portal
Publication:363503
DOI10.1007/s11512-012-0178-4zbMath1270.05091arXiv0812.3007MaRDI QIDQ363503
Publication date: 2 September 2013
Published in: Arkiv för Matematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.3007
Related Items
Phase transition in random distance graphs on the torus, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Phase transitions in dynamical random graphs
- The largest component in a subcritical random graph with a power law degree distribution
- Merging percolation onZdand classical random graphs: Phase transition
- The phase transition in the uniformly grown random graph has infinite order
- The phase transition in inhomogeneous random graphs
- The Multiplicative Process