Degree distributions under general node removal: Power-law or Poisson?
arXiv:2205.03887 · doi:10.1103/PhysRevE.106.064309
Abstract
Perturbations made to networked systems may result in partial structural loss, such as a blackout in a power-grid system. Investigating the resultant disturbance in network properties is quintessential to understand real networks in action. The removal of nodes is a representative disturbance, but previous studies are seemingly contrasting about its effect on arguably the most fundamental network statistic, the degree distribution. The key question is about the functional form of the degree distributions that can be altered during node removal or sampling, which is decisive in the remaining subnetwork's static and dynamical properties. In this work, we clarify the situation by utilizing the relative entropies with respect to the reference distributions in the Poisson and power-law form. Introducing general sequential node removal processes with continuously different levels of hub protection to encompass a series of scenarios including random removal and preferred or protective removal of the hub, we classify the altered degree distributions starting from various power-law forms by comparing two relative entropy values. From the extensive investigation in various scenarios based on direct node-removal simulations and by solving the rate equation of degree distributions, we discover in the parameter space two distinct regimes, one where the degree distribution is closer to the power-law reference distribution and the other closer to the Poisson distribution.
arXiv comment12 pages, 7 figures
References in corpus (32)
- Emergence of scaling in random networks
- Power-law distributions in empirical data
- Error and attack tolerance of complex networks
- The large-scale organization of metabolic networks
- Epidemic processes in complex networks
- Random graphs with arbitrary degree distributions and their applications
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Mean-field theory for scale-free random networks
- Critical phenomena in complex networks
- Epidemic dynamics and endemic states in complex networks
- Breakdown of the Internet under intentional attack
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Influence maximization in complex networks through optimal percolation
- Universal Behavior of Load Distribution in Scale-free Networks
- Scale-free networks are rare
- Social Network Sensors for Early Detection of Contagious Outbreaks
- Statistical properties of sampled networks
- Stability and topology of scale-free networks under attack and defense strategies
- Scale-free Networks Well Done
- Sampling properties of random graphs: the degree distribution
- True scale-free networks hidden by finite size effects
- Evolution of scale-free random graphs: Potts model formulation
- Self-similar Scale-free Networks and Disassortativity
- Intrinsic degree-correlations in static model of scale-free networks
- Sampling properties of directed networks
- Analysis of the convergence of the degree distribution of contracting random networks towards a Poisson distribution using the relative entropy
- Convergence towards an Erd{\H o}s-Rényi graph structure in network contraction processes
- Understanding the temporal pattern of spreading in heterogeneous networks: Theory of the mean infection time
- Critical behaviors of high-degree adaptive and collective-influence percolation
- Giant component in a configuration-model power-law graph with a variable number of links
- -selective percolation: A simple model leading to a rich repertoire of phase transitions