Asymptotic normality of degree counts in a general preferential attachment model

Abstract

We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to their degree. It is well known that the proportion of nodes with a given degree at step $n$ converges to a constant as $n\to \infty$. The goal of this paper is to investigate the asymptotic distribution of the fluctuations around this limiting value. We prove a central limit theorem for the joint distribution of all degree counts. In particular, we give an explicit expression for the asymptotic covariance. This expression is rather complex, so we compute it numerically for various parameter choices. We also use numerical simulations to argue that the convergence is quite fast. The proof relies on the careful construction of an appropriate martingale.

The original version of this paper contained an error, which is fixed in this second version of the manuscript. The authors would like to thank Rui M. Castro, Sander Douwes and Remco van der Hofstad for pointing this error out. 28 pages, 4 figures. All comments are welcome

References in corpus (4)

• Emergence of scaling in random networks
• Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
• Directed Hybrid Random Networks Mixing Preferential Attachment with Uniform Attachment Mechanisms
• A Directed Preferential Attachment Model with Poisson Measurement