For preferential attachment graphs with out-degree at least 2 and positive fitness, the distance between two uniformly chosen vertices is asymptotically logν n, with ν the explicit growth parameter of the local limit.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Logarithmic typical distances in preferential attachment models
For preferential attachment graphs with out-degree at least 2 and positive fitness, the distance between two uniformly chosen vertices is asymptotically logν n, with ν the explicit growth parameter of the local limit.