Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T14:55:10.244Z Has data issue: false hasContentIssue false

Asymptotic normality of degree counts in a preferential attachment model

Published online by Cambridge University Press:  25 July 2016

Sidney I. Resnick*
Affiliation:
Cornell University
Gennady Samorodnitsky*
Affiliation:
Cornell University
*
School of Operations Research and Information Engineering, Cornell University, Ithaca, NY 14853, USA. Email address: sir1@cornell.edu
School of Operations Research and Information Engineering, Cornell University, Ithaca, NY 14853, USA. Email address: gs18@cornell.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Preferential attachment is a widely adopted paradigm for understanding the dynamics of social networks. Formal statistical inference, for instance GLM techniques, and model-verification methods will require knowing test statistics are asymptotically normal even though node- or count-based network data are nothing like classical data from independently replicated experiments. We therefore study asymptotic normality of degree counts for a sequence of growing simple undirected preferential attachment graphs. The methods of proof rely on identifying martingales and then exploiting the martingale central limit theorems.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2016