Entropy of microcanonical finite-graph ensembles
arXiv:2305.10996 · doi:10.1088/2632-072X/acf01c
Abstract
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the mean-field approximations of the generating function using the Chebyshev-Hermite polynomials provide estimates for the entropy of finite-graph ensembles. Our estimate reproduces the Bender-Canfield formula in the limit of large graphs.
arXiv comment7 pages, 3 figures
References in corpus (12)
- Entropy measures for complex networks: Toward an information theory of complex topologies
- The entropy of network ensembles
- The entropy of randomized network ensembles
- Nonparametric Bayesian inference of the microcanonical stochastic block model
- Efficient and exact sampling of simple graphs with given arbitrary degree sequence
- Entropy of stochastic blockmodel ensembles
- Entropies of complex networks with hierarchically constrained topologies
- Unbiased sampling of network ensembles
- Disentangling homophily, community structure and triadic closure in networks
- Grand canonical ensembles of sparse networks and Bayesian inference
- Entropy of labeled versus unlabeled networks
- Exactly Solvable Random Graph Ensemble with Extensively Many Short Cycles