Bond percolation on a class of clustered random networks

Abstract

Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be prescribed, and theoretical results match well to numerical simulations on both synthetic and real-world networks.

Description of algorithm for generating clustered networks added. 5 pages, 3 figures

References in corpus (17)

• The structure and function of complex networks
• Random graphs with arbitrary degree distributions and their applications
• The spread of epidemic disease on networks
• Network robustness and fragility: Percolation on random graphs
• Critical phenomena in complex networks
• Large-scale topological and dynamical properties of Internet
• Random graphs with clustering
• Properties of highly clustered networks
• Highly clustered scale-free networks
• Bipartite Graphs as Models of Complex Networks
• Resilience to damage of graphs with degree correlations
• Percolation and Epidemic Thresholds in Clustered Networks
• Clustering in complex networks. I. General formalism
• Tuning clustering in random networks with arbitrary degree distributions
• Zero-temperature Hysteresis in Random-field Ising Model on a Bethe Lattice
• Clustering in complex networks. II. Percolation properties
• Random Networks with Tunable Degree Distribution and Clustering

Cited by in corpus (56)

• Networks beyond pairwise interactions: structure and dynamics
• The Kuramoto model in complex networks
• Random graphs containing arbitrary distributions of subgraphs
• Epidemic spreading on complex networks with community structures
• Binary-state dynamics on complex networks: pair approximation and beyond
• Analysis of complex contagions in random multiplex networks
• Accuracy of Mean-Field Theory for Dynamics on Real-World Networks
• The unreasonable effectiveness of tree-based theory for networks with clustering
• The robustness of interdependent clustered networks
• How clustering affects the bond percolation threshold in complex networks
• Cascades on a class of clustered random networks
• Propagation dynamics on networks featuring complex topologies
• Deciphering the global organization of clustering in real complex networks
• Beyond the locally tree-like approximation for percolation on real networks
• Spectra of networks containing short loops
• Percolation in self-similar networks
• Dynamics on Modular Networks with Heterogeneous Correlations
• Multi-parameter models of innovation diffusion on complex networks
• Clique percolation in random graphs
• Network cloning unfolds the effect of clustering on dynamical processes
• How does bond percolation happen in coloured networks?
• Generalized epidemic process on modular networks
• General and exact approach to percolation on random graphs
• Social Clustering in Epidemic Spread on Coevolving Networks
• Bond percolation on a class of correlated and clustered random graphs
• Analytical results for bond percolation and k-core sizes on clustered networks
• Information Propagation in Clustered Multilayer Networks
• Percolation on random networks with arbitrary k-core structure
• Ising model in clustered scale-free networks
• Cascades on clique-based graphs
• Random graphs with arbitrary clustering and their applications
• Networks with arbitrary edge multiplicities
• Complex Contagions with Timers
• Epidemic control in networks with cliques
• Hierarchical scale-free network is fragile against random failure
• Percolation in random graphs with higher-order clustering
• Modelling indirect interactions during failure spreading in a project activity network
• Critical behavior and correlations on scale-free small-world networks. Application to network design
• Universality classes of generalized epidemic process on random networks
• Spectral estimation of the percolation transition in clustered networks
• Spectra of random networks in the weak clustering regime
• Minimum Long-Loop Feedback Vertex Set and Network Dismantling
• Self-avoiding walks and connective constants in clustered scale-free networks
• Degree correlations in graphs with clique clustering
• Exact solution of bond percolation on small arbitrary graphs
• Effect of clustering on Turing instability in complex networks
• Exact epidemic dynamics for generally clustered, complex networks
• Strongly clustered random graphs via triadic closure: An exactly solvable model
• New methods to generate massive synthetic networks
• Observability transitions in clustered networks
• Exact deterministic representation of Markovian SIR epidemics on networks with and without loops
• Critical phenomena on heterogeneous small-world networks
• Competing contact processes on homogeneous networks with tunable clusterization
• Algorithms for Generating Large-scale Clustered Random Graphs
• A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon
• Consistent Approximation of Epidemic Dynamics on Degree-heterogeneous Clustered Networks