English

The structure of networks that evolve under a combination of growth, via node addition and random attachment, and contraction, via random node deletion

Statistical Mechanics 2022-10-25 v2 Disordered Systems and Neural Networks

Abstract

We present analytical results for the emerging structure of networks that evolve via a combination of growth (by node addition and random attachment) and contraction (by random node deletion). To this end we consider a network model in which at each time step a node addition and random attachment step takes place with probability PaddP_{add} and a random node deletion step takes place with probability Pdel=1PaddP_{del}=1-P_{add}. The balance between the growth and contraction processes is captured by the parameter η=PaddPdel\eta=P_{add}-P_{del}. The case of pure network growth is described by η=1\eta=1. In case that 0<η<10<\eta<1 the rate of node addition exceeds the rate of node deletion and the overall process is of network growth. In the opposite case, where 1<η<0-1<\eta<0, the overall process is of network contraction, while in the special case of η=0\eta=0 the expected size of the network remains fixed, apart from fluctuations. Using the master equation we obtain a closed form expression for the time dependent degree distribution Pt(k)P_t(k). The degree distribution Pt(k)P_t(k) includes a term that depends on the initial degree distribution P0(k)P_0(k), which decays as time evolves, and an asymptotic distribution Pst(k)P_{st}(k). In the case of pure network growth (η=1\eta=1) the asymptotic distribution Pst(k)P_{st}(k) follows an exponential distribution, while for 1<η<1-1<\eta<1 it consists of a sum of Poisson-like terms and exhibits a Poisson-like tail. In the case of overall network growth (0<η<10 < \eta < 1) the degree distribution Pt(k)P_t(k) eventually converges to Pst(k)P_{st}(k). In the case of overall network contraction (1<η<0-1 < \eta < 0) we identify two different regimes. For 1/3<η<0-1/3 < \eta < 0 the degree distribution Pt(k)P_t(k) quickly converges towards Pst(k)P_{st}(k). In contrast, for 1<η<1/3-1 < \eta < -1/3 the convergence of Pt(k)P_t(k) is initially very slow and it gets closer to Pst(k)P_{st}(k) only shortly before the network vanishes.

Keywords

Cite

@article{arxiv.2209.10027,
  title  = {The structure of networks that evolve under a combination of growth, via node addition and random attachment, and contraction, via random node deletion},
  author = {Barak Budnick and Ofer Biham and Eytan Katzav},
  journal= {arXiv preprint arXiv:2209.10027},
  year   = {2022}
}

Comments

39 pages, 9 figures