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.
A Preferential Attachment Process Approaching the Rado Graph
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We consider a simple Preferential Attachment graph process, which begins with a finite graph, and in which a new $(t+1)$st vertex is added at each subsequent time step $t$, and connected to each previous vertex $u \leq t$ with probability $\frac{d_u(t)}{t}$ where $d_u(t)$ is the degree of $u$ at time $t$. We analyse the graph obtained as the infinite limit of this process, and show that so long as the initial finite graph is neither edgeless nor complete, with probability 1 the outcome will be a copy of the Rado graph augmented with a finite number of either isolated or universal vertices.
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.