English

Preferential Attachment When Stable

Probability 2026-01-14 v1 Discrete Mathematics Combinatorics

Abstract

We study an urn process with two urns, initialized with a ball each. Balls are added sequentially, the urn being chosen independently with probability proportional to the αth\alpha^{th} power (α>1)(\alpha >1) of the existing number of balls. We study the (rare) event that the urn compositions are balanced after the addition of 2n22n-2 new balls. We derive precise asymptotics of the probability of this event by embedding the process in continuous time. Quite surprisingly, a fine control on this probability may be leveraged to derive a lower tail Large Deviation Principle (LDP) for L=i=1nSi2i2L = \sum_{i=1}^{n} \frac{S_i^2}{i^2}, where {Sn:n0}\{S_n : n \geq 0\} is a simple symmetric random walk started at zero. We provide an alternate proof of the LDP via coupling to Brownian motion, and subsequent derivation of the LDP for a continuous time analogue of LL. Finally, we turn our attention back to the urn process conditioned to be balanced, and provide a functional limit law describing the trajectory of the urn process.

Keywords

Cite

@article{arxiv.1805.10653,
  title  = {Preferential Attachment When Stable},
  author = {Svante Janson and Subhabrata Sen and Joel Spencer},
  journal= {arXiv preprint arXiv:1805.10653},
  year   = {2026}
}

Comments

44 pages