Weighted percolation on directed networks

Abstract

We present an analysis of the percolation transition for general node removal strategies valid for locally tree-like directed networks. On the basis of heuristic arguments we predict that, if the probability of removing node $i$ is $p_i$, the network disintegrates if $p_i$ is such that the largest eigenvalue of the matrix with entries $A_{ij}(1-p_i)$ is less than 1, where $A$ is the adjacency matrix of the network. The knowledge or applicability of a Markov network model is not required by our theory, thus making it applicable to situations not covered by previous works. We test our predicted percolation criterion against numerical results for different networks and node removal strategies.

4 pages, 2 figures

References in corpus (15)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• Assortative mixing in networks
• Mixing patterns in networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Efficient Immunization Strategies for Computer Networks and Populations
• Stability and topology of scale-free networks under attack and defense strategies
• Resilience to damage of graphs with degree correlations
• Characterizing the dynamical importance of network nodes and links
• Percolation in Directed Scale-Free Networks
• Generalized percolation in random directed networks
• Clustering in complex networks. II. Percolation properties
• Evolving Networks with Multi-species Nodes and Spread in the Number of Initial Links

Cited by in corpus (36)

• Synchronization in complex networks
• Percolation on complex networks: Theory and application
• Predicting criticality and dynamic range in complex networks: effects of topology
• On community structure in complex networks: challenges and opportunities
• The effect of network topology on the stability of discrete state models of genetic control
• Heterogeneous Bond Percolation on Multitype Networks with an Application to Epidemic Dynamics
• Immunization of networks with community structure
• Measuring Node Contribution to Community Structure with Modularity Vitality
• Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects
• The Organization of Strong Links in Complex Networks
• Eigenvector localization in real networks and its implications for epidemic spreading
• Tight lower bound for percolation threshold on a quasi-regular graph
• Importance of individual events in temporal networks
• Network cloning unfolds the effect of clustering on dynamical processes
• Effects of network topology, transmission delays, and refractoriness on the response of coupled excitable systems to a stochastic stimulus
• Influence of Reciprocal links in Social Networks
• Hypergraph assortativity: a dynamical systems perspective
• Optimal synchronization of directed complex networks
• Trend-driven information cascades on random networks
• Efficient immunization strategies to prevent financial contagion
• Stability of Boolean networks: The joint effects of topology and update rules
• Dynamical Instability in Boolean Networks as a Percolation Problem
• Network connectivity during mergers and growth: optimizing the addition of a module
• A network model for field and quenched disorder effects in artificial spin ice
• Site-Percolation Threshold of Carbon Nanotube Fibers: Fast Inspection of Percolation with Markov Stochastic Theory
• Approximating the Largest Eigenvalue of the Modified Adjacency Matrix of Networks with Heterogeneous Node Biases
• Top Eigenpair Statistics for Weighted Sparse Graphs
• Random walks on networks with preferential cumulative damage: Generation of bias and aging
• Social Climber attachment in forming networks produces phase transition in a measure of connectivity
• Fragmenting networks by targeting collective influencers at a mesoscopic level
• Symmetry and localization of quantum walk induced by extra link in cycles
• A network-specific approach to percolation in networks with bidirectional links
• Emergence of strongly connected giant components in continuum disk-spin percolation
• Network Extreme Eigenvalue - from Multimodal to Scale-free Network
• Comparing the reliability of networks by spectral analysis
• Spectral bounds for percolation on directed and undirected graphs