Asymptotic behavior and distributional limits of preferential attachment graphs
arXiv:1401.2792 · doi:10.1214/12-AOP755
Abstract
We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree distributions and, more generally, the limiting distribution of subgraphs in balls of any given radius around a random vertex in the preferential attachment graph. We also establish the finite-volume corrections which give the approach to the limit.
arXiv commentPublished in at http://dx.doi.org/10.1214/12-AOP755 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (4)
Cited by in corpus (15)
- Contact processes on random graphs with power law degree distributions have critical value 0
- Spatial preferential attachment networks: Power laws and clustering coefficients
- Coexistence in preferential attachment networks
- Random intersection graphs with communities
- Growth and Containment of a Hierarchical Criminal Network
- Subgraphs in preferential attachment models
- Studies on generalized Yule models
- Weighted distances in scale-free preferential attachment models
- Hamiltonian Dynamics of Preferential Attachment
- Constraints and Entropy in a Model of Network Evolution
- Non-convergence of proportions of types in a preferential attachment graph with three co-existing types
- Distance evolutions in growing preferential attachment graphs
- Controllability, matching ratio and graph convergence
- Generating Preferential Attachment Graphs via a Pólya Urn with Expanding Colors
- Fragility of non-convergence in preferential attachment graphs with three types