Potential energy of complex networks: a novel perspective

Abstract

We present a novel characterization of complex networks, based on the potential of an associated Schrödinger equation. The potential is designed so that the energy spectrum of the Schrödinger equation coincides with the graph spectrum of the normalized Laplacian. Crucial information is retained in the reconstructed potential, which provides a compact representation of the properties of the network structure. The median potential over several random network realizations is fitted via a Landau-like function, and its length scale is found to diverge as the critical connection probability is approached from above. The ruggedness of the median potential profile is quantified using the Higuchi fractal dimension, which displays a maximum at the critical connection probability. This demonstrates that this technique can be successfully employed in the study of random networks, as an alternative indicator of the percolation phase transition. We apply the proposed approach to the investigation of real-world networks describing infrastructures (US power grid). Curiously, although no notion of phase transition can be given for such networks, the fractality of the median potential displays signatures of criticality. We also show that standard techniques (such as the scaling features of the largest connected component) do not detect any signature or remnant of criticality.

arXiv comment15 pages, 13 figures

References in corpus (13)

• The structure and function of complex networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Random graphs with arbitrary degree distributions and their applications
• Universal Behavior of Load Distribution in Scale-free Networks
• The physics of spreading processes in multilayer networks
• Layer aggregation and reducibility of multilayer interconnected networks
• Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
• Graph spectra and the detectability of community structure in networks
• Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
• Spectral entropies as information-theoretic tools for complex network comparison
• Exactly Solvable Potentials and Quantum Algebras
• Resolving structural variability in network models and the brain
• Riemann zeros, prime numbers and fractal potentials