Thermodynamics of network model fitting with spectral entropies
arXiv:1801.06009 · doi:10.1103/PhysRevE.98.022322
Abstract
An information theoretic approach inspired by quantum statistical mechanics was recently proposed as a means to optimize network models and to assess their likelihood against synthetic and real-world networks. Importantly, this method does not rely on specific topological features or network descriptors, but leverages entropy-based measures of network distance. Entertaining the analogy with thermodynamics, we provide a physical interpretation of model hyperparameters and propose analytical procedures for their estimate. These results enable the practical application of this novel and powerful framework to network model inference. We demonstrate this method in synthetic networks endowed with a modular structure, and in real-world brain connectivity networks.
arXiv comment11 pages, 3 figures
References in corpus (22)
- Emergence of scaling in random networks
- Cooperative Game Theory Approaches for Network Partitioning
- Spatial Networks
- Communicability in complex networks
- The statistical mechanics of networks
- Random walks and diffusion on networks
- Nonoptimal Component Placement, but Short Processing Paths, due to Long-Distance Projections in Neural Systems
- The Physics of Communicability in Complex Networks
- Graph spectra and the detectability of community structure in networks
- Generalized Clausius inequality for nonequilibrium quantum processes
- Maximum likelihood: extracting unbiased information from complex networks
- Spectral entropies as information-theoretic tools for complex network comparison
- Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
- 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
- Spectra of random graphs with arbitrary expected degrees
- Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
- Eigenvalue Spectra of Modular Networks
- Unbiased sampling of network ensembles
- Degree Distribution in Quantum Walks on Complex Networks
- The inverse Mermin-Wagner theorem for classical spin models on graphs
- The Kato--Temple inequality and eigenvalue concentration with applications to graph inference
Cited by in corpus (4)
- Characterization and comparison of large directed graphs through the spectra of the magnetic Laplacian
- Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity
- Asymptotic entropy of the Gibbs state of complex networks
- Characterization and space embedding of directed graphs and social networks through magnetic Laplacians