Asymptotic behavior and distributional limits of preferential attachment graphs

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 $k$ around a random vertex in the preferential attachment graph. We also establish the finite-volume corrections which give the approach to the limit.

Published 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 (1)

• Kronecker Graphs: An Approach to Modeling Networks

Cited by in corpus (12)

• Random intersection graphs with communities
• Growth and Containment of a Hierarchical Criminal Network
• Subgraphs in preferential attachment models
• Studies on generalized Yule models
• Hamiltonian Dynamics of Preferential Attachment
• Weighted distances in scale-free preferential attachment models
• Non-convergence of proportions of types in a preferential attachment graph with three co-existing types
• Constraints and Entropy in a Model of Network Evolution
• Controllability, matching ratio and graph convergence
• Distance evolutions in growing preferential attachment graphs
• Generating Preferential Attachment Graphs via a Pólya Urn with Expanding Colors
• Fragility of non-convergence in preferential attachment graphs with three types