IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0161077.html
   My bibliography  Save this article

The Rationality of Four Metrics of Network Robustness: A Viewpoint of Robust Growth of Generalized Meshes

Author

Listed:
  • Xiaofan Yang
  • Yuanrui Zhu
  • Jing Hong
  • Lu-Xing Yang
  • Yingbo Wu
  • Yuan Yan Tang

Abstract

There are quite a number of different metrics of network robustness. This paper addresses the rationality of four metrics of network robustness (the algebraic connectivity, the effective resistance, the average edge betweenness, and the efficiency) by investigating the robust growth of generalized meshes (GMs). First, a heuristic growth algorithm (the Proximity-Growth algorithm) is proposed. The resulting proximity-optimal GMs are intuitively robust and hence are adopted as the benchmark. Then, a generalized mesh (GM) is grown up by stepwise optimizing a given measure of network robustness. The following findings are presented: (1) The algebraic connectivity-optimal GMs deviate quickly from the proximity-optimal GMs, yielding a number of less robust GMs. This hints that the rationality of the algebraic connectivity as a measure of network robustness is still in doubt. (2) The effective resistace-optimal GMs and the average edge betweenness-optimal GMs are in line with the proximity-optimal GMs. This partly justifies the two quantities as metrics of network robustness. (3) The efficiency-optimal GMs deviate gradually from the proximity-optimal GMs, yielding some less robust GMs. This suggests the limited utility of the efficiency as a measure of network robustness.

Suggested Citation

  • Xiaofan Yang & Yuanrui Zhu & Jing Hong & Lu-Xing Yang & Yingbo Wu & Yuan Yan Tang, 2016. "The Rationality of Four Metrics of Network Robustness: A Viewpoint of Robust Growth of Generalized Meshes," PLOS ONE, Public Library of Science, vol. 11(8), pages 1-13, August.
    • Handle: RePEc:plo:pone00:0161077
    DOI: 10.1371/journal.pone.0161077
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0161077
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0161077&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0161077?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
    ---><---

    References listed on IDEAS

    as
    1. Martín-Hernández, J. & Wang, H. & Van Mieghem, P. & D’Agostino, G., 2014. "Algebraic connectivity of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 92-105.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gafarov, F.M., 2016. "Emergence of the small-world architecture in neural networks by activity dependent growth," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 409-418.
    2. Li, Xin & Wu, Haotian & Scoglio, Caterina & Gruenbacher, Don, 2015. "Robust allocation of weighted dependency links in cyber–physical networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 433(C), pages 316-327.
    3. Rueda, Diego F. & Calle, Eusebi, 2017. "Using interdependency matrices to mitigate targeted attacks on interdependent networks: A case study involving a power grid and backbone telecommunications networks," International Journal of Critical Infrastructure Protection, Elsevier, vol. 16(C), pages 3-12.

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0161077. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.