Phase transition in evolving networks that combine preferential attachment and random node deletion
Abstract
Analytical results are presented for the structure of networks that evolve via a preferential-attachment-random-deletion (PARD) model in the regime of overall network growth and in the regime of overall contraction. The phase transition between the two regimes is studied. At each time step a node addition and preferential attachment step takes place with probability , and a random node deletion step takes place with probability . The balance between growth and contraction is captured by the parameter , which in the regime of overall network growth satisfies and in the regime of overall network contraction . Using the master equation and computer simulations we show that for the time-dependent degree distribution converges towards a stationary form which exhibits an exponential tail. This is in contrast with the power-law tail of the stationary degree distribution obtained for . Thus, the PARD model has a phase transition at , which separates between two structurally distinct phases. At the transition, for , the degree distribution exhibits a stretched exponential tail. While the stationary degree distribution in the phase of overall growth represents an asymptotic state, in the phase of overall contraction represents an intermediate asymptotic state of a finite life span, which disappears when the network vanishes.
Cite
@article{arxiv.2412.14549,
title = {Phase transition in evolving networks that combine preferential attachment and random node deletion},
author = {Barak Budnick and Ofer Biham and Eytan Katzav},
journal= {arXiv preprint arXiv:2412.14549},
year = {2025}
}
Comments
32 pages, 6 figures. arXiv admin note: text overlap with arXiv:2209.10027