IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v397y2021ics0096300320308675.html
   My bibliography  Save this article

Informational cost and networks navigability

Author

Listed:
  • Estrada, Ernesto

Abstract

Understanding how information navigates through nodes of a complex network has become an increasingly pressing problem across scientific disciplines. Several approaches have been proposed on the basis of shortest paths or diffusive navigation. However, no existing approaches have tackled the challenges of efficient communication in networks without full knowledge of their global topology under external noise. Here, we develop a first principles approach and mathematical formalism to determine the informational cost of navigating a network under different levels of external noise. Using this approach we discover the existence of a trade-off between the ways in which networks route information through shortest paths, their entropies and stability, which define three classes of real-world networks. This approach reveals that environmental pressure has shaped the ways in which information is transferred in bacterial metabolic networks and allowed us to determine the levels of noise at which a protein–protein interaction network seems to work in normal conditions in a cell.

Suggested Citation

  • Estrada, Ernesto, 2021. "Informational cost and networks navigability," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    • Handle: RePEc:eee:apmaco:v:397:y:2021:i:c:s0096300320308675
    DOI: 10.1016/j.amc.2020.125914
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320308675
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125914?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.

    References listed on IDEAS

    as
    1. Joaquín Goñi & Andrea Avena-Koenigsberger & Nieves Velez de Mendizabal & Martijn P van den Heuvel & Richard F Betzel & Olaf Sporns, 2013. "Exploring the Morphospace of Communication Efficiency in Complex Networks," PLOS ONE, Public Library of Science, vol. 8(3), pages 1-10, March.
    2. Meisam Akbarzadeh & Ernesto Estrada, 2018. "Communicability geometry captures traffic flows in cities," Nature Human Behaviour, Nature, vol. 2(9), pages 645-652, September.
    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. Silver, Grant & Akbarzadeh, Meisam & Estrada, Ernesto, 2018. "Tuned communicability metrics in networks. The case of alternative routes for urban traffic," Chaos, Solitons & Fractals, Elsevier, vol. 116(C), pages 402-413.
    2. Cyril Veve & Nicolas Chiabaut, 2020. "Estimation of the shared mobility demand based on the daily regularity of the urban mobility and the similarity of individual trips," PLOS ONE, Public Library of Science, vol. 15(9), pages 1-15, September.
    3. Wang, Yinpu & An, Chengchuan & Ou, Jishun & Lu, Zhenbo & Xia, Jingxin, 2022. "A general dynamic sequential learning framework for vehicle trajectory reconstruction using automatic vehicle location or identification data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 608(P1).
    4. Qing Song & Meng Li & Xiaolei Li, 2018. "Accurate and fast path computation on large urban road networks: A general approach," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-13, February.
    5. Ruggero Gramatica & T Di Matteo & Stefano Giorgetti & Massimo Barbiani & Dorian Bevec & Tomaso Aste, 2014. "Graph Theory Enables Drug Repurposing – How a Mathematical Model Can Drive the Discovery of Hidden Mechanisms of Action," PLOS ONE, Public Library of Science, vol. 9(1), pages 1-10, January.

    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:eee:apmaco:v:397:y:2021:i:c:s0096300320308675. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.