Inducing Effect on the Percolation Transition in Complex Networks

Abstract

Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the percolating cluster. Here we study this inducing effect on the classical site percolation and K-core percolation, showing that the inducing effect always causes a discontinuous percolation transition. We precisely predict the percolation threshold and core size for uncorrelated random networks with arbitrary degree distributions. For low-dimensional lattices the percolation threshold fluctuates considerably over realizations, yet we can still predict the core size once the percolation occurs. The core sizes of real-world networks can also be well predicted using degree distribution as the only input. Our work therefore provides a theoretical framework for quantitatively understanding discontinuous breakdown phenomena in various complex systems.

Main text and appendices. Title has been changed

References in corpus (13)

• Critical phenomena in complex networks
• Glassy dynamics of kinetically constrained models
• Graph Evolution: Densification and Shrinking Diameters
• Impact of Single Links in Competitive Percolation -- How complex networks grow under competition
• Self-organized adaptation of a simple neural circuit enables complex robot behaviour
• Avoiding a Spanning Cluster in Percolation Models
• Core percolation on complex networks
• Local structure of directed networks
• Ordinary Percolation with Discontinuous Transitions
• Random numbers for large scale distributed Monte Carlo simulations
• On local equilibrium equations for clustering states
• From one solution of a 3-satisfiability formula to a solution cluster: Frozen variables and entropy
• Activity patterns on random scale-free networks: Global dynamics arising from local majority rules

Cited by in corpus (19)

• Percolation on complex networks: Theory and application
• Spatially localized attacks on interdependent networks: the existence of a finite critical attack size
• Generalization of core percolation on complex networks
• Statistical Mechanics of the Minimum Dominating Set Problem
• Contagion on complex networks with persuasion
• Opinion percolation in structured population
• Two Types of Discontinuous Percolation Transitions in Cluster Merging Processes
• Cross-Issue Solidarity and Truth Convergence in Opinion Dynamics
• The characteristics of cycle-nodes-ratio and its application to network classification
• Small-world networks of optical fiber lattices
• Random node reinforcement and $K$-core structure of complex networks
• Hierarchical cycle-tree packing model for $K$-core attack problem
• Generalized $k$-core pruning process on directed networks
• Vulnerability and Resilience of Social Engagement: Equilibrium Theory
• Spatio-temporal propagation of cascading overload failures
• K-core attack, equilibrium K-core, and kinetically constrained spin system
• A combined network and machine learning approaches for product market forecasting
• Induced Percolation on Networked Systems
• Improving the accuracy of the k-shell method by removing redundant links-from a perspective of spreading dynamics