Spanning forests on random planar lattices

DOI10.1007/S10955-009-9733-1zbMATH Open1174.82003arXiv0903.4432OpenAlexW3099222761MaRDI QIDQ833378FDOQ833378

Sergio Caracciolo, Andrea Sportiello

Publication date: 12 August 2009

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0903.4432

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

zbMATH Keywords

spanning treesrandom matricesPotts modelspanning forests\(O(n)\)-invariant \(\sigma\)-model\(O(n)\)-vector modelself-avoiding polymers

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of polymers (82D60)

Cites Work

• Financial Modelling with Jump Processes
• Title not available (Why is that?)
• Planar diagrams
• The planar approximation. II
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• Analytical and numerical study of a model of dynamically triangulated random surfaces
• Liouville quantum gravity and KPZ
• Course 3 Conformal random geometry
• Exact solution of the \(O(n)\) model on a random lattice
• More on the exact solution of the \(O(n)\) model on a random lattice and an investigation of the case \(|n|>2\)
• Grassmann integral representation for spanning hyperforests
• 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.
• Phase structure of the \(O(n)\) model on a random lattice for \(n> 2\)
• Exactly solvable Potts models, bond- and tree-like percolation on dynamical (random) planar lattice
• The Potts-\(q\) random matrix model: Loop equations, critical exponents, and rational case.
• Hamiltonian cycles on a random three-coordinate lattice
• Hamiltonian cycles on random Eulerian triangulations
• Renormalization flow for unrooted forests on a triangular lattice
• Hyperforests on the complete hypergraph by Grassmann integral representation

Cited In (8)

• Spanning forests in regular planar maps
• Matrix integrals \& finite holography
• Title not available (Why is that?)
• Dualities between fermionic theories and the Potts model
• A flow in the forest
• Critical behaviour of spanning forests on random planar graphs
• 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

Uses Software

• OEIS

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)