Do random initial degrees suppress concentration in preferential attachment graphs?
Probability
2025-01-30 v3 Combinatorics
Abstract
We consider the open problem concerning the possible lack of concentration of the degree distribution in preferential attachment graphs with random initial degree, when its distribution is characterized by extremely heavy tails of power-law type. We show that the addition of such a large number of edges causes a significant upset of the degree distribution, leading to its non-concentration. Furthermore, we show that the smallest value of the exponent for which the degree distribution exhibits concentration is 2.
Keywords
Cite
@article{arxiv.2402.04927,
title = {Do random initial degrees suppress concentration in preferential attachment graphs?},
author = {T. Makai and F. Polito and L. Sacerdote},
journal= {arXiv preprint arXiv:2402.04927},
year = {2025}
}