Efficiency of complex networks under failures and attacks: a percolation approach

DOI10.1016/J.PHYSA.2018.08.093MaRDI QIDQ2151784zbMATH OpenOpenAlexFDO

Authors Yaoming Zhou, Jun-Wei Wang

Publication date 5 July 2022

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physa.2018.08.093

zbMATH Keywords

complex networkconnectivityefficiencypercolation theoryrobustness

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Recommendations

• Efficiency of scale-free networks: Error and attack tolerance
• New results on computable efficiency and its stability for complex networks
• Information theory perspective on network robustness
• TRAFFIC CONGESTION ANALYSIS IN COMPLEX NETWORKS BASED ON VARIOUS ROUTING STRATEGIES
• Generalized \(k\)-cores of networks under attack with limited knowledge

Cites work

• Collective dynamics of `small-world' networks
• Efficiency of scale-free networks: Error and attack tolerance
• Emergence of Scaling in Random Networks
• Is the Boston subway a small-world network?

Cited in

(8)

• Efficiency of scale-free networks: Error and attack tolerance
• New results on computable efficiency and its stability for complex networks
• Edge instability: a critical parameter for the propagation and robustness analysis of large networks
• Impact of random failures and attacks on Poisson and power-law random networks
• Information theory perspective on network robustness
• Percolation in spatial networks. Spatial network models beyond nearest neighbours structures
• Principles of Distributed Systems
• Robustness of prefabricated construction supply chain network against underload cascading failure

This page was built for publication: Efficiency of complex networks under failures and attacks: a percolation approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2151784)