IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v52y2006i4p563-574.html
   My bibliography  Save this article

Network robustness to targeted attacks. The interplay of expansibility and degree distribution

Author

Listed:
  • E. Estrada

Abstract

We study the property of certain complex networks of being both sparse and highly connected, which is known as “good expansion” (GE). A network has GE properties if every subset S of nodes (up to 50% of the nodes) has a neighborhood that is larger than some “expansion factor” φ multiplied by the number of nodes in S. Using a graph spectral method we introduce here a new parameter measuring the good expansion character of a network. By means of this parameter we are able to classify 51 real-world complex networks — technological, biological, informational, biological and social — as GENs or non-GENs. Combining GE properties and node degree distribution (DD) we classify these complex networks in four different groups, which have different resilience to intentional attacks against their nodes. The simultaneous existence of GE properties and uniform degree distribution contribute significantly to the robustness in complex networks. These features appear solely in 14% of the 51 real-world networks studied here. At the other extreme we find that ∼40% of all networks are very vulnerable to targeted attacks. They lack GE properties, display skewed DD — exponential or power-law — and their topologies are changed more dramatically by targeted attacks directed at bottlenecks than by the removal of network hubs. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2006

Suggested Citation

  • E. Estrada, 2006. "Network robustness to targeted attacks. The interplay of expansibility and degree distribution," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 52(4), pages 563-574, August.
    • Handle: RePEc:spr:eurphb:v:52:y:2006:i:4:p:563-574
    DOI: 10.1140/epjb/e2006-00330-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2006-00330-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1140/epjb/e2006-00330-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Estrada, Ernesto, 2007. "Graphs (networks) with golden spectral ratio," Chaos, Solitons & Fractals, Elsevier, vol. 33(4), pages 1168-1182.
    2. Antonio Candelieri & Bruno G. Galuzzi & Ilaria Giordani & Francesco Archetti, 2019. "Vulnerability of public transportation networks against directed attacks and cascading failures," Public Transport, Springer, vol. 11(1), pages 27-49, June.
    3. Ma, Xiangyu & Zhou, Huijie & Li, Zhiyi, 2021. "On the resilience of modern power systems: A complex network perspective," Renewable and Sustainable Energy Reviews, Elsevier, vol. 152(C).
    4. Vodák, Rostislav & Bíl, Michal & Sedoník, Jiří, 2015. "Network robustness and random processes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 428(C), pages 368-382.
    5. Heng Ye & Zhiping Li & Guangyue Li & Yiran Liu, 2022. "Topology Analysis of Natural Gas Pipeline Networks Based on Complex Network Theory," Energies, MDPI, vol. 15(11), pages 1-20, May.
    6. Wen, Xiangxi & Tu, Congliang & Wu, Minggong, 2018. "Node importance evaluation in aviation network based on “No Return” node deletion method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 546-559.
    7. Pietro DeLellis & Anna DiMeglio & Franco Garofalo & Francesco Lo Iudice, 2017. "The evolving cobweb of relations among partially rational investors," PLOS ONE, Public Library of Science, vol. 12(2), pages 1-21, February.
    8. LaRocca, Sarah & Guikema, Seth D., 2015. "Characterizing and predicting the robustness of power-law networks," Reliability Engineering and System Safety, Elsevier, vol. 133(C), pages 157-166.
    9. Duan, Boping & Liu, Jing & Zhou, Mingxing & Ma, Liangliang, 2016. "A comparative analysis of network robustness against different link attacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 448(C), pages 144-153.
    10. Sohn, Insoo, 2019. "A robust complex network generation method based on neural networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 593-601.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:52:y:2006:i:4:p:563-574. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.