IDEAS home Printed from https://ideas.repec.org/a/nat/nature/v563y2018i7733d10.1038_s41586-018-0726-6.html
   My bibliography  Save this article

A structural transition in physical networks

Author

Listed:
  • Nima Dehmamy

    (Northeastern University)

  • Soodabeh Milanlouei

    (Northeastern University)

  • Albert-László Barabási

    (Northeastern University
    Brigham and Women’s Hospital, Harvard Medical School
    Central European University)

Abstract

In many physical networks, including neurons in the brain1,2, three-dimensional integrated circuits3 and underground hyphal networks4, the nodes and links are physical objects that cannot intersect or overlap with each other. To take this into account, non-crossing conditions can be imposed to constrain the geometry of networks, which consequently affects how they form, evolve and function. However, these constraints are not included in the theoretical frameworks that are currently used to characterize real networks5–7. Most tools for laying out networks are variants of the force-directed layout algorithm8,9—which assumes dimensionless nodes and links—and are therefore unable to reveal the geometry of densely packed physical networks. Here we develop a modelling framework that accounts for the physical sizes of nodes and links, allowing us to explore how non-crossing conditions affect the geometry of a network. For small link thicknesses, we observe a weakly interacting regime in which link crossings are avoided via local link rearrangements, without altering the overall geometry of the layout compared to the force-directed layout. Once the link thickness exceeds a threshold, a strongly interacting regime emerges in which multiple geometric quantities, such as the total link length and the link curvature, scale with the link thickness. We show that the crossover between the two regimes is driven by the non-crossing condition, which allows us to derive the transition point analytically and show that networks with large numbers of nodes will ultimately exist in the strongly interacting regime. We also find that networks in the weakly interacting regime display a solid-like response to stress, whereas in the strongly interacting regime they behave in a gel-like fashion. Networks in the weakly interacting regime are amenable to 3D printing and so can be used to visualize network geometry, and the strongly interacting regime provides insights into the scaling of the sizes of densely packed mammalian brains.

Suggested Citation

  • Nima Dehmamy & Soodabeh Milanlouei & Albert-László Barabási, 2018. "A structural transition in physical networks," Nature, Nature, vol. 563(7733), pages 676-680, November.
  • Handle: RePEc:nat:nature:v:563:y:2018:i:7733:d:10.1038_s41586-018-0726-6
    DOI: 10.1038/s41586-018-0726-6
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41586-018-0726-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1038/s41586-018-0726-6?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. Diana Ogorelova & Felix Sadyrbaev & Inna Samuilik, 2023. "On Targeted Control over Trajectories of Dynamical Systems Arising in Models of Complex Networks," Mathematics, MDPI, vol. 11(9), pages 1-14, May.
    2. Csaba Both & Nima Dehmamy & Rose Yu & Albert-László Barabási, 2023. "Accelerating network layouts using graph neural networks," Nature Communications, Nature, vol. 14(1), pages 1-9, December.
    3. Gábor Pete & Ádám Timár & Sigurdur Örn Stefánsson & Ivan Bonamassa & Márton Pósfai, 2024. "Physical networks as network-of-networks," Nature Communications, Nature, vol. 15(1), pages 1-8, December.
    4. Lin Zhang & Beibei Sun & Fei Shu & Ying Huang, 2022. "Comparing paper level classifications across different methods and systems: an investigation of Nature publications," Scientometrics, Springer;Akadémiai Kiadó, vol. 127(12), pages 7633-7651, December.
    5. Wu, Ke & Liu, Xueming, 2021. "Community detection in directed acyclic graphs of adversary interactions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    6. Chulwook Park, 2019. "Network and Agent Dynamics with Evolving Protection against Systemic Risk," Papers 1907.11622, arXiv.org.

    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:nat:nature:v:563:y:2018:i:7733:d:10.1038_s41586-018-0726-6. 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.nature.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.