Asymptotic behavior and distributional limits of preferential attachment graphs
From MaRDI portal
Publication:2438744
DOI10.1214/12-AOP755zbMath1296.60010arXiv1401.2792MaRDI QIDQ2438744
Noam Berger, Christian Borgs, Jennifer T. Chayes, Amin Saberi
Publication date: 6 March 2014
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2792
05C80: Random graphs (graph-theoretic aspects)
60K99: Special processes
60C05: Combinatorial probability
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Limits of dense graph sequences
- On limits of finite graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Recurrence of distributional limits of finite planar graphs
- The diameter of a scale-free random graph
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Robustness and Vulnerability of Scale-Free Random Graphs
- Left and right convergence of graphs with bounded degree
- Sparse graphs: Metrics and random models
- Random trees and general branching processes
- Asymptotic Enumeration of Spanning Trees
- Probability