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,6,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.
Subscribe to Journal
Get full journal access for 1 year
only $3.90 per issue
All prices are NET prices.
VAT will be added later in the checkout.
Rent or Buy article
Get time limited or full article access on ReadCube.
All prices are NET prices.
All data used in the figures were generated using the simulation code available at https://github.com/nimadehmamy/3D-ELI-FUEL. The data that support the findings of this study are available from the corresponding author on reasonable request.
Kasthuri, N. et al. Saturated reconstruction of a volume of neocortex. Cell 162, 648–661 (2015).
Oh, S. W. et al. A mesoscale connectome of the mouse brain. Nature 508, 207–214 (2014).
Wong, S. et al. Monolithic 3D integrated circuits. In 2007 International Symposium onVLSI Technology, Systems and Applications 1–4 (IEEE, 2007).
Friese, C. F. & Allen, M. F. The spread of Va mycorrhizal fungal hyphae in the soil: inoculum types and external hyphal architecture. Mycologia 83, 409–418 (1991).
Barrat, A., Barthelemy, M. & Vespignani, A. Dynamical Processes on Complex Networks (Cambridge Univ. Press, Cambridge, 2008).
Barabási, A.-L. Network Science (Cambridge Univ. Press, Cambridge, 2016).
Albert, R. & Barabási, A.-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002).
Kamada, T. & Kawai, S. An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31, 7–15 (1989).
Fruchterman, T. M. & Reingold, E. M. Graph drawing by force-directed placement. Softw. Pract. Exper. 21, 1129–1164 (1991).
Dubrovin, B., Fomenko, A. & Novikov, S. Modern Geometry—Methods and Applications. Part II: The Geometry and Topology of Manifolds [transl. by R. G. Burns] 371–379 (Springer, New York, 1984).
des Cloizeaux, J. Lagrangian theory for a self-avoiding random chain. Phys. Rev. A 10, 1665–1669 (1974).
Mézard, M. & Parisi, G. Replica field theory for random manifolds. J. Phys. I 1, 809–836 (1991).
Gay, J. & Berne, B. Modification of the overlap potential to mimic a linear site–site potential. J. Chem. Phys. 74, 3316–3319 (1981).
Bouchaud, J.-P., Cugliandolo, L. F., Kurchan, J. & Mezard, M. in Spin Glasses and Random Fields (ed. Young, A. P.) 161–223 (World Scientific, Singapore, 1998).
Kirkpatrick, S., Gelatt, C. D., Jr & Vecchi, M. P. in Spin Glass Theory and Beyond (eds Mézard, M., Parisi, G. & Virasoro, M. A.) 339–348 (World Scientific, Singapore, 1987).
Barabási, A.-L. & Albert, R. Emergence of scaling in random networks. Science 286, 509–512 (1999).
Chaikin, P. M. & Lubensky, T. C. Principles of Condensed Matter Physics Ch. 5.8 (Cambridge Univ. Press, Cambridge, 2000).
Cardy, J. Scaling and Renormalization in Statistical Physics Vol. 5, 67–71 (Cambridge Univ. Press, Cambridge, 1996).
Irgens, F. Continuum Mechanics 60–73 (Springer, Berlin, 2008).
Zeeman, E. C. Unknotting combinatorial balls. Ann. Math. 78, 501–526 (1963).
Ahn, Y.-Y., Ahnert, S. E., Bagrow, J. P. & Barabási, A.-L. Flavor network and the principles of food pairing. Sci. Rep. 1, 196 (2011).
Stepanyants, A., Hof, P. R. & Chklovskii, D. B. Geometry and structural plasticity of synaptic connectivity. Neuron 34, 275–288 (2002).
Rivera-Alba, M. et al. Wiring economy and volume exclusion determine neuronal placement in the Drosophila brain. Curr. Biol. 21, 2000–2005 (2011).
Ventura-Antunes, L., Mota, B. & Herculano-Houzel, S. Different scaling of white matter volume, cortical connectivity, and gyrification across rodent and primate brains. Front. Neuroanat. 7, 3 (2013).
Bullmore, E. & Sporns, O. The economy of brain network organization. Nat. Rev. Neurosci. 13, 336–349 (2012).
Sporns, O., Chialvo, D. R., Kaiser, M. & Hilgetag, C. C. Organization, development and function of complex brain networks. Trends Cogn. Sci. 8, 418–425 (2004).
We thank A. Grishchenko for 3D visualizations and photography, K. Albrecht, M. Martino and H. Sayama for discussions, and Formlabs and Shapeways for 3D printing. We were supported by grants from Templeton (award number 61066), NSF (award number 1735505), NIH (award number P01HL132825) and AHA (award number 151708).
Nature thanks G. Bianconi and the other anonymous reviewer(s) for their contribution to the peer review of this work.
The authors declare no competing interests.
Publisher’s note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This file contains the extended mathematical derivations and supplementary figures. It contains 26 figures, displaying the link crossing problem and our solution to it, followed by description of the phase space, order parameters and finite-size analysis to describe the nature of the transition.
About this article
Cite this article
Dehmamy, N., Milanlouei, S. & Barabási, A. A structural transition in physical networks. Nature 563, 676–680 (2018). https://doi.org/10.1038/s41586-018-0726-6
- Physical Network
- Link Thickness
- Total Link Length
- Force-directed Layout (FDL)
- Linkage Curve
Communications Physics (2020)
SIAM Journal on Applied Mathematics (2020)
Nature Communications (2019)
Empowering impact assessments knowledge and international research collaboration - A bibliometric analysis of Environmental Impact Assessment Review journal
Environmental Impact Assessment Review (2019)