A Gaussian integral that counts regular graphs
From MaRDI portal
Publication:6619667
DOI10.1063/5.0208715zbMATH Open1548.05292MaRDI QIDQ6619667
Weerawit Horinouchi, Oleg Evnin
Publication date: 16 October 2024
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Random matrices (algebraic aspects) (15B52) Asymptotic enumeration (05A16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact free energies of statistical systems on random networks
- Statistical field theory for neural networks
- The asymptotic number of labeled graphs with given degree sequences
- Quantum field theory in the large \(N\) limit: a review
- Spectra of Euclidean random matrices
- Asymptotic enumeration by degree sequence of graphs of high degree
- Bootstrap percolation on the random regular graph
- The two-star model: exact solution in the sparse regime and condensation transition
- Spectra of sparse random matrices
- Quantum chaos on discrete graphs
- Universality of level correlation function of sparse random matrices
- Elementary Introduction to Quantum Geometry
- The mean and variance of the distribution of shortest path lengths of random regular graphs
- Resistance distance distribution in large sparse random graphs
- Handbook of Enumerative Combinatorics
- Random matrices with row constraints and eigenvalue distributions of graph Laplacians
- Replica approach to the generalized Rosenzweig-Porter model
This page was built for publication: A Gaussian integral that counts regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619667)
