Thermodynamic characterization of networks using graph polynomials
Cheng Ye, Cesar H. Comin, Thomas K. DM. Peron, Filipi N., Silva, Francisco A. Rodrigues, Luciano da F. Costa, Andrea Torsello, and Edwin R. Hancock

TL;DR
This paper introduces a thermodynamic approach to analyze the evolution of time-varying complex networks using graph polynomials, enabling efficient detection of changes and stages in network dynamics.
Contribution
The paper presents a novel method linking graph polynomials to thermodynamic quantities, allowing efficient analysis of network evolution without spectrum computation.
Findings
Effective detection of abrupt network changes
Characterization of network evolution stages
Application to financial and biological networks
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
