Thermodynamic characterization of networks using graph polynomials
arXiv:1512.01418 · doi:10.1103/PhysRevE.92.032810
Abstract
In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the evolution of networks to be constructed in the thermodynamic space spanned by entropy, energy, and temperature. We show how these thermodynamic variables can be computed in terms of simple network characteristics, e.g., the total number of nodes and node degree statistics for nodes connected by edges. We apply the resulting thermodynamic characterization to real-world time-varying networks representing complex systems in the financial and biological domains. The study demonstrates that the method provides an efficient tool for detecting abrupt changes and characterizing different stages in network evolution.
arXiv comment16 pages, 12 figures. Published 25 September 2015
References in corpus (14)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Topology of evolving networks: local events and universality
- Bose-Einstein condensation in complex networks
- Networks of equities in financial markets
- Entropy measures for complex networks: Toward an information theory of complex topologies
- Statistical-mechanical approach to subgraph centrality in complex networks
- The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Centrality measures and thermodynamic formalism for complex networks
- Quantum statistics in complex networks
- Entropy distribution and condensation in random networks with a given degree distribution
- Quantum-Classical Transitions in Complex Networks
- Thermodynamic forces, flows, and Onsager coefficients in complex networks
Cited by in corpus (6)
- Entropic Dynamic Time Warping Kernels for Co-evolving Financial Time Series Analysis
- Graph Kernel Neural Networks
- Characterization and comparison of large directed graphs through the spectra of the magnetic Laplacian
- Can We `Feel' the Temperature of Knowledge? Modelling Scientific Popularity Dynamics via Thermodynamics
- Characterization and space embedding of directed graphs and social networks through magnetic Laplacians
- A Quantum-inspired Similarity Measure for the Analysis of Complete Weighted Graphs