Abstract: The generating function for spanning forests on a lattice is related to the q-state Potts model in a certain q -> 0 limit, and extends the analogous notion for spanning trees, or dense self-avoiding branched polymers. Recent works have found a combinatorial perturbative equivalence also with the (quadratic action) O(n) model in the limit n -> -1, the expansion parameter t counting the number of components in the forest. We give a random-matrix formulation of this model on the ensemble of degree-k random planar lattices. For k = 3, a correspondence is found with the Kostov solution of the loop-gas problem, which arise as a reformulation of the (logarithmic action) O(n) model, at n = -2. Then, we show how to perform an expansion around the t = 0 theory. In the thermodynamic limit, at any order in t we have a finite sum of finite-dimensional Cauchy integrals. The leading contribution comes from a peculiar class of terms, for which a resummation can be performed exactly.
Recommendations
- Critical behaviour of spanning forests on random planar graphs
- Spanning forests in regular planar maps
- Spanning forests in regular planar maps
- Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L
- Random matrices and the Potts model on random graphs
Cites work
- scientific article; zbMATH DE number 3219699 (Why is no real title available?)
- Analytical and numerical study of a model of dynamically triangulated random surfaces
- Conformal random geometry
- Conformally Invariant Fractals and Potential Theory
- Equivalence of the Potts model or Whitney polynomial with an ice-type model
- Exact partition functions and correlation functions of multiple Hamiltonian walks on the Manhattan lattice.
- Exact solution of the \(O(n)\) model on a random lattice
- Exactly solvable Potts models, bond- and tree-like percolation on dynamical (random) planar lattice
- Financial Modelling with Jump Processes
- Grassmann integral representation for spanning hyperforests
- Hamiltonian cycles on a random three-coordinate lattice
- Hamiltonian cycles on random Eulerian triangulations
- Hyperforests on the complete hypergraph by Grassmann integral representation
- Liouville quantum gravity and KPZ
- More on the exact solution of the \(O(n)\) model on a random lattice and an investigation of the case \(|n|>2\)
- Phase structure of the \(O(n)\) model on a random lattice for \(n> 2\)
- Planar diagrams
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- Renormalization flow for unrooted forests on a triangular lattice
- The Potts-\(q\) random matrix model: Loop equations, critical exponents, and rational case.
- The planar approximation. II
Cited in
(11)- Spanning forests in regular planar maps
- Matrix integrals \& finite holography
- scientific article; zbMATH DE number 5279431 (Why is no real title available?)
- Renormalization flow for unrooted forests on a triangular lattice
- Dualities between fermionic theories and the Potts model
- Critical behaviour of spanning forests on random planar graphs
- A flow in the forest
- Spanning forests in regular planar maps
- Phase transition in the spanning-hyperforest model on complete hypergraphs
- Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L
- Spanning forests and \(\mathrm{OSP}(N|2M)\)-invariant \(\sigma\)-models
This page was built for publication: Spanning forests on random planar lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833378)
