Analysis of the convergence of the degree distribution of contracting random networks towards a Poisson distribution using the relative entropy

Abstract

We present analytical results for the structural evolution of random networks undergoing contraction processes via generic node deletion scenarios, namely, random deletion, preferential deletion and propagating deletion. Focusing on configuration model networks, which exhibit a given degree distribution $P_0(k)$ and no correlations, we show using a rigorous argument that upon contraction the degree distributions of these networks converge towards a Poisson distribution. To this end, we use the relative entropy $S_t=S[P_t(k)||\pi (k|⟨K{⟩}_t)]$ of the degree distribution $P_t(k)$ of the contracting network at time $t$ with respect to the corresponding Poisson distribution $\pi (k|⟨K{⟩}_t)$ with the same mean degree $⟨K{⟩}_t$ as a distance measure between $P_t(k)$ and Poisson. The relative entropy is suitable as a distance measure since it satisfies $S_t\ge 0$ for any degree distribution $P_t(k)$, while equality is obtained only for $P_t(k)=\pi (k|⟨K{⟩}_t)$. We derive an equation for the time derivative $d{S}_t/dt$ during network contraction and show that the relative entropy decreases monotonically to zero during the contraction process. We thus conclude that the degree distributions of contracting configuration model networks converge towards a Poisson distribution. Since the contracting networks remain uncorrelated, this means that their structures converge towards an Erd{\H o}s-Rényi (ER) graph structure, substantiating earlier results obtained using direct integration of the master equation and computer simulations [I. Tishby, O. Biham and E. Katzav, {\it Phys. Rev. E} {\bf 100}, 032314 (2019)]. We demonstrate the convergence for configuration model networks with degenerate degree distributions (random regular graphs), exponential degree distributions and power-law degree distributions (scale-free networks).

41 pages, 9 figures. arXiv admin note: substantial text overlap with arXiv:2009.02890

References in corpus (4)

• The entropy of network ensembles
• The entropy of randomized network ensembles
• Cascading collapse of online social networks
• Convergence towards an Erd{\H o}s-Rényi graph structure in network contraction processes

Cited by in corpus (6)

• The structure of networks that evolve under a combination of growth, via node addition and random attachment, and contraction, via random node deletion
• The distribution of shortest path lengths on trees of a given size in subcritical Erdos-Renyi networks
• Phase transition in evolving networks that combine preferential attachment and random node deletion
• Degree distributions under general node removal: Power-law or Poisson?
• Ensemble inequivalence and phase transitions in unlabeled networks
• The effect of preferential node deletion on the structure of networks that evolve via preferential attachment