Spanning forests on random planar lattices

DOI10.1007/s10955-009-9733-1zbMath1174.82003arXiv0903.4432OpenAlexW3099222761MaRDI QIDQ833378

Sergio Caracciolo, Andrea Sportiello

Publication date: 12 August 2009

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (6)

A flow in the forest ⋮ Dualities between fermionic theories and the Potts model ⋮ Critical behaviour of spanning forests on random planar graphs ⋮ Phase transition in the spanning-hyperforest model on complete hypergraphs ⋮ Spanning forests in regular planar maps ⋮ Matrix integrals \& finite holography

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Liouville quantum gravity and KPZ
• Hamiltonian cycles on a random three-coordinate lattice
• Hamiltonian cycles on random Eulerian triangulations
• Planar diagrams
• 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\)
• Exact partition functions and correlation functions of multiple Hamiltonian walks on the Manhattan lattice.
• Renormalization flow for unrooted forests on a triangular lattice
• Phase structure of the \(O(n)\) model on a random lattice for \(n> 2\)
• Hyperforests on the complete hypergraph by Grassmann integral representation
• Course 3 Conformal random geometry
• Equivalence of the Potts model or Whitney polynomial with an ice-type model
• Conformally Invariant Fractals and Potential Theory
• The planar approximation. II
• Financial Modelling with Jump Processes
• Grassmann integral representation for spanning hyperforests
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• 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.
• Analytical and numerical study of a model of dynamically triangulated random surfaces

This page was built for publication: Spanning forests on random planar lattices