2021
DOI: 10.48550/arxiv.2102.07570
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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 → ∞. 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 20 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?