In a linear preferential attachment graph, the number of common neighbors of two fixed nodes converges to a finite limit for mild preferential attachment, grows logarithmically at a critical parameter, and grows as a power law for strong preferential attachment.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Growth of Common Friends in a Preferential Attachment Model
In a linear preferential attachment graph, the number of common neighbors of two fixed nodes converges to a finite limit for mild preferential attachment, grows logarithmically at a critical parameter, and grows as a power law for strong preferential attachment.