Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Tree networks of real-world data: Analysis of efficiency and spatiotemporal scales

Davide Cipollini* and Lambert Schomaker

  • Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence, University of Groningen, Groningen, Netherlands and Cognigron - Groningen Cognitive Systems and Materials Center, University of Groningen, Groningen, Netherlands

  • *Contact author: d.cipollini@rug.nl

Phys. Rev. Research 7, 033009 – Published 1 July, 2025

DOI: https://doi.org/10.1103/ztmk-glc4

Abstract

Hierarchical tree structures are common in many real-world systems, from tree roots and branches to neuronal dendrites and biologically inspired artificial neural networks, as well as in technological networks for organizing and searching complex datasets of high-dimensional patterns. Within the class of hierarchical self-organized systems, we investigate the interplay of structure and function associated with the emergence of complex tree structures in disordered environments. Using an algorithm that creates and searches trees of real-world patterns, our work stands at the intersection of statistical physics, machine learning, and network theory. We resolve the network properties over multiple phase transitions and across a continuity of scales, using the von Neumann entropy, its generalized susceptibility, and the recent definition of thermodynamic-like quantities, such as work, heat, and efficiency. We show that scaleinvariance, i.e., power-law Laplacian spectral density, is a key feature for constructing trees capable of combining fast information flow and sufficiently rich internal representation of information, enabling the system to achieve its functional task efficiently. Moreover, the complexity of the environmental conditions the system has adapted to is encoded in the value of the exponent of the power-law spectral density, which is inherently related to the network spectral dimension and directly influences the traits of those maximally functionally efficient networks. Thereby, we provide a novel metric to estimate the complexity of high-dimensional datasets.

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (90)

  1. A. Ghavasieh and M. De Domenico, Diversity of information pathways drives sparsity in real-world networks, Nat. Phys. 20, 512 (2024).
  2. E. Szathmáry and J. M. Smith, The major evolutionary transitions, Nature (London) 374, 227 (1995).
  3. J. J. Hopfield, Neural networks and physical systems with emergent collective computational abilities., Proc. Natl. Acad. Sci. USA 79, 2554 (1982).
  4. D. H. Ackley, G. E. Hinton, and T. J. Sejnowski, A learning algorithm for Boltzmann machines, Cognit. Sci. 9, 147 (1985).
  5. T. Kachman, J. A. Owen, and J. L. England, Self-organized resonance during search of a diverse chemical space, Phys. Rev. Lett. 119, 038001 (2017).
  6. N. Perunov, R. A. Marsland, and J. L. England, Statistical physics of adaptation, Phys. Rev. X 6, 021036 (2016).
  7. M. De Domenico, Exploring evolution (in life) through information, accessed: 2024-04-16.
  8. C. G. Langton, Computation at the edge of chaos: Phase transitions and emergent computation, Physica D 42, 12 (1990).
  9. N. Bertschinger and T. Natschläger, Real-time computation at the edge of chaos in recurrent neural networks, Neural Comput. 16, 1413 (2004).
  10. I. Mastromatteo and M. Marsili, On the criticality of inferred models, J. Stat. Mech. (2011) P10012.
  11. J. Hidalgo, J. Grilli, S. Suweis, M. A. Muñoz, J. R. Banavar, and A. Maritan, Information-based fitness and the emergence of criticality in living systems, Proc. Natl. Acad. Sci.USA 111, 10095 (2014).
  12. B. C. Daniels, H. Kim, D. Moore, S. Zhou, H. B. Smith, B. Karas, S. A. Kauffman, and S. I. Walker, Criticality distinguishes the ensemble of biological regulatory networks, Phys. Rev. Lett. 121, 138102 (2018).
  13. D. Krotov, J. O. Dubuis, T. Gregor, and W. Bialek, Morphogenesis at criticality, Proc. Natl. Acad. Sci. USA 111, 3683 (2014).
  14. J. M. Beggs and D. Plenz, Neuronal avalanches are diverse and precise activity patterns that are stable for many hours in cortical slice cultures, J. Neurosci. 24, 5216 (2004).
  15. G. M. Shepherd and R. K. Brayton, Logic operations are properties of computer-simulated interactions between excitable dendritic spines, Neuroscience 21, 151 (1987).
  16. P. Poirazi and A. Papoutsi, Illuminating dendritic function with computational models, Nat. Rev. Neurosci. 21, 303 (2020).
  17. S. Hodassman, R. Vardi, Y. Tugendhaft, A. Goldental, and I. Kanter, Efficient dendritic learning as an alternative to synaptic plasticity hypothesis, Sci. Rep. 12, 6571 (2022).
  18. G. Kastellakis, A. J. Silva, and P. Poirazi, Linking memories across time via neuronal and dendritic overlaps in model neurons with active dendrites, Cell Rep. 17, 1491 (2016).
  19. R. Makarov, M. Pagkalos, and P. Poirazi, Dendrites and efficiency: Optimizing performance and resource utilization, Curr. Opin. Neurobiol. 83, 102812 (2023).
  20. S. Chavlis and P. Poirazi, Dendrites endow artificial neural networks with accurate, robust and parameter-efficient learning, Nat. Commun. 16, 943 (2025).
  21. J. Guerguiev, T. P. Lillicrap, and B. A. Richards, Towards deep learning with segregated dendrites, eLife 6, e22901 (2017).
  22. A. Payeur, J. Guerguiev, F. Zenke, B. A. Richards, and R. Naud, Burst-dependent synaptic plasticity can coordinate learning in hierarchical circuits, Nat. Neurosci. 24, 1010 (2021).
  23. J. Sacramento, R. P. Costa, Y. Bengio, and W. Senn, Dendritic cortical microcircuits approximate the backpropagation algorithm, Advances in Neural Information Processing Systems, edited by S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, Vol. 31 (Curran Associates, Inc. Newry, 2018).
  24. X. Li, J. Tang, Q. Zhang, B. Gao, J. J. Yang, S. Song, W. Wu, W. Zhang, P. Yao, N. Deng et al., Power-efficient neural network with artificial dendrites, Nat. Nanotechnol. 15, 776 (2020).
  25. J. S. Lee, S. Lee, and T. W. Noh, Resistive switching phenomena: A review of statistical physics approaches, Appl. Phys. Rev. 2, 031303 (2015).
  26. F. Nielsen, Hierarchical clustering, Introduction to HPC with MPI for Data Science (Springer International Publishing, Cham, Switzerland, 2016), pp. 195–211.
  27. T. Portegys, A search technique for pattern recognition using relative distances, IEEE Trans. Pattern Anal. Mach. Intell. 17, 910 (1995).
  28. M. D, Accélération de l'algorithme des k plus proches voisins par réorganisation arborescente de la base de données, Ph.D. thesis, Ecole Polytechnique, Paris, 1999.
  29. F. Jacob, Evolution and tinkering, Science 196, 1161 (1977).
  30. A. Benatti and L. d. F. Costa, Retrieving hierarchies, arXiv:2204.07530.
  31. H. W. Watson and F. Galton, On the probability of the extinction of families., J. Anthropol. Inst. G.B. Irel. 4, 138 (1875).
  32. T. E. Harris, The Theory of Branching Processes, Grundlehren der mathematischen Wissenschaften (Springer, Berlin, 2012).
  33. M. De Domenico and J. Biamonte, Spectral entropies as information-theoretic tools for complex network comparison, Phys. Rev. X 6, 041062 (2016).
  34. P. Villegas, A. Gabrielli, F. Santucci, G. Caldarelli, and T. Gili, Laplacian paths in complex networks: Information core emerges from entropic transitions, Phys. Rev. Res. 4, 033196 (2022).
  35. P. Villegas, T. Gili, G. Caldarelli, and A. Gabrielli, Laplacian renormalization group for heterogeneous networks, Nat. Phys. 19, 445 (2023).
  36. A. Poggialini, P. Villegas, M. A. Muñoz, and A. Gabrielli, Networks with many structural scales: A renormalization group perspective, Phys. Rev. Lett. 134, 057401 (2025).
  37. M. Kardar, Statistical Physics of Fields (Cambridge University Press, Cambridge, 2007).
  38. S. di Santo, P. Villegas, R. Burioni, and M. A. Muñoz, Landau–Ginzburg theory of cortex dynamics: Scale-free avalanches emerge at the edge of synchronization, Proc. Natl. Acad. Sci. USA 115, E1356 (2018).
  39. S. Alexander and R. Orbach, Density of states on fractals: ≪fractons≫, J. Phys. Lett. 43, 625 (1982).
  40. K. Hattori, T. Hattori, and H. Watanabe, Gaussian field theories on general networks and the spectral dimensions, Prog. Theor. Phys. Suppl. 92, 108 (1987).
  41. R. Burioni and D. Cassi, Universal properties of spectral dimension, Phys. Rev. Lett. 76, 1091 (1996).
  42. R. Burioni, D. Cassi, F. Cecconi, and A. Vulpiani, Topological thermal instability and length of proteins, Proteins: Struct. Funct. Bioinf. 55, 529 (2004).
  43. M. Mézard, Spin glass theory and its new challenge: Structured disorder, Indian J. Phys. 98, 3757 (2024).
  44. C. Mead, How we created neuromorphic engineering, Nat. Electron. 3, 434 (2020).
  45. A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Trans. Inf. Theory 22, 75 (1976).
  46. E. Levina and P. Bickel, Maximum likelihood estimation of intrinsic dimension, in Advances in Neural Information Processing Systems, edited by L. Saul, Y. Weiss, and L. Bottou, Vol. 17 (MIT Press, Cambridge, MA, 2004).
  47. D. J. MacKay and Z. Ghahramani, Comments on “Maximum Likelihood Estimation of Intrinsic Dimension” by E. Levina and P. Bickel — inference.org.uk, http://www.inference.org.uk/mackay/dimension/ [Accessed 10-07-2024].
  48. P. Pope, C. Zhu, A. Abdelkader, M. Goldblum, and T. Goldstein, The intrinsic dimension of images and its impact on learning, International Conference on Learning Representations (ICLR, 2021).
  49. D. Cipollini, Dataset for “Tree networks of real-world data: analysis of efficiency and spatiotemporal scales”, Version V1, Zenodo (2024), https://zenodo.org/records/13883206.
  50. D. Cipollini, GitHub Repository: CipolliniDavide/Laplacian Trees (2024), https://github.com/CipolliniDavide/Laplacian_Trees.
  51. A. Ghavasieh and M. De Domenico, Generalized network density matrices for analysis of multiscale functional diversity, Phys. Rev. E 107, 044304 (2023).
  52. N. Masuda, M. A. Porter, and R. Lambiotte, Random walks and diffusion on networks, Phys. Rep. 716–717, 1 (2017).
  53. W. N. Anderson and T. D. Morley, Eigenvalues of the laplacian of a graph, Linear Multilinear Algebra 18, 141 (1985).
  54. E. Estrada, The Structure of Complex Networks: Theory and Applications (Oxford University Press, Oxford, 2011).
  55. R. P. Feynman, Statistical Mechanics: A Set of Lectures (CRC Press, Boca Raton, FL, 1998).
  56. P. Moretti and M. Zaiser, Network analysis predicts failure of materials and structures, Proc. Natl. Acad. Sci. USA 116, 16666 (2019).
  57. A. Ghavasieh, C. Nicolini, and M. De Domenico, Statistical physics of complex information dynamics, Phys. Rev. E 102, 052304 (2020).
  58. L. P. Kadanoff, Scaling laws for ising models near Tc, Phys. Phys. Fiz. 2, 263 (1966).
  59. K. Wilson, The renormalization group and the ε expansion, Phys. Rep. 12, 75 (1974).
  60. D. Cipollini, A. Swierstra, and L. Schomaker, Modeling a domain wall network in BiFeO3 with stochastic geometry and entropy-based similarity measure, Front. Mater. 11, 1323153 (2024).
  61. C. Hens, U. Harush, S. Haber, R. Cohen, and B. Barzel, Spatiotemporal signal propagation in complex networks, Nat. Phys. 15, 403 (2019).
  62. L. Schomaker, D. Mangalaiu, L. Vuurpijl, and M. Weinfeld, Two Tree-Formation Methods and Fast Pattern Search using Nearest Neighbor and Nearest-Centroid Matching (International Unipen Foundation, 2000) p. 261–270.
  63. P. Grother, Nist special database 19: Handprinted forms and characters database, 1995, Natl. Inst. Stand. Technol. available at https://api.semanticscholar.org/CorpusID:59785963.
  64. L. Deng, The mnist database of handwritten digit images for machine learning research [best of the web], IEEE Signal Process. Mag. 29, 141 (2012).
  65. H. Xiao, K. Rasul, and R. Vollgraf, Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms, arXiv:1708.07747.
  66. A. Krizhevsky, G. Hinton, et al., Learning multiple layers of features from tiny images, available at http://www.cs.utoronto.ca/∼kriz/learning-features-2009-TR.pdf.
  67. See Supplemental Material at http://link.aps.org/supplemental/10.1103/ztmk-glc4 for figures referenced in the main text but omitted for clarity.
  68. C. Destri and L. Donetti, The spectral dimension of random trees, J. Phys. A: Math. Gen. 35, 9499 (2002).
  69. M. E. J. Newman, Modularity and community structure in networks, Proc. Natl. Acad. Sci. USA 103, 8577 (2006).
  70. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, J. Stat. Mech. (2008) P10008.
  71. B. Cramer, D. Stöckel, M. Kreft, M. Wibral, J. Schemmel, K. Meier, and V. Priesemann, Control of criticality and computation in spiking neuromorphic networks with plasticity, Nat. Commun. 11, 2853 (2020).
  72. A. Goudarzi, C. Teuscher, N. Gulbahce, and T. Rohlf, Emergent criticality through adaptive information processing in boolean networks, Phys. Rev. Lett. 108, 128702 (2012).
  73. A. Clauset, C. R. Shalizi, and M. E. J. Newman, Power-law distributions in empirical data, SIAM Rev. 51, 661 (2009).
  74. J. Alstott, E. Bullmore, and D. Plenz, powerlaw: A python package for analysis of heavy-tailed distributions, PLoS One 9, e85777 (2014).
  75. E. Schrodinger and R. Penrose, What is Life? With Mind and Matter and Autobiographical Sketches (Cambridge University Press, Cambridge, 2012).
  76. I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning (MIT Press, Cambridge, MA, 2016).
  77. R. Pryluk, Y. Kfir, H. Gelbard-Sagiv, I. Fried, and R. Paz, A tradeoff in the neural code across regions and species, Cell 176, 597 (2019).
  78. K. Friston, The free-energy principle: A unified brain theory? Nat. Rev. Neurosci. 11, 127 (2010).
  79. A. Ghavasieh and M. De Domenico, Enhancing transport properties in interconnected systems without altering their structure, Phys. Rev. Res. 2, 013155 (2020).
  80. S. Still, D. A. Sivak, A. J. Bell, and G. E. Crooks, Thermodynamics of prediction, Phys. Rev. Lett. 109, 120604 (2012).
  81. Z. F. Mainen and T. J. Sejnowski, Influence of dendritic structure on firing pattern in model neocortical neurons, Nature (London) 382, 363 (1996).
  82. R. A. J. van Elburg and A. van Ooyen, Impact of dendritic size and dendritic topology on burst firing in pyramidal cells, PLoS Comput. Biol. 6, e1000781 (2010).
  83. G. Indiveri, B. Linares-Barranco, R. Legenstein, G. Deligeorgis, and T. Prodromakis, Integration of nanoscale memristor synapses in neuromorphic computing architectures, Nanotechnology 24, 384010 (2013).
  84. D. V. Christensen, R. Dittmann, B. Linares-Barranco, A. Sebastian, M. L. Gallo, A. Redaelli, S. Slesazeck, T. Mikolajick, S. Spiga, S. Menzel et al., 2022 roadmap on neuromorphic computing and engineering, Neuromorph. Comput. Eng. 2, 022501 (2022).
  85. L. E. Suárez, B. A. Richards, G. Lajoie, and B. Misic, Learning function from structure in neuromorphic networks, Nat. Mach. Intell. 3, 771 (2021).
  86. A. Vahl, G. Milano, Z. Kuncic, S. A. Brown, and P. Milani, Brain-inspired computing with self-assembled networks of nano-objects, J. Phys. D 57, 503001 (2024).
  87. D. Cipollini, H. Greatorex, M. Mastella, E. Chicca, and L. Schomaker, Fused-MemBrain: a spiking processor combining CMOS and self-assembled memristive networks, Neuro. Comput. Eng. 5, 024002 (2025).
  88. J. B. Mallinson, S. Shirai, S. K. Acharya, S. K. Bose, E. Galli, and S. A. Brown, Avalanches and criticality in self-organized nanoscale networks, Sci. Adv. 5, eaaw8438 (2019).
  89. X. Guo, C. Schindler, S. Menzel, and R. Waser, Understanding the switching-off mechanism in Ag+ migration based resistively switching model systems, Appl. Phys. Lett. 91, 2793686 (2007).
  90. L. Niemeyer, L. Pietronero, and H. J. Wiesmann, Fractal dimension of dielectric breakdown, Phys. Rev. Lett. 52, 1033 (1984).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation