Abstract
We study statistical properties of the highest degree, or most popular, nodes in growing networks. We show that the number of lead changes increases logarithmically with network size , independent of the details of the growth mechanism. The probability that the first node retains the lead approaches a finite constant for popularity-driven growth, and decays as , with , for growth with no popularity bias.
- Received 17 July 2002
DOI:https://doi.org/10.1103/PhysRevLett.89.258703
©2002 American Physical Society