Random trees between two walls: exact partition function
From MaRDI portal
Publication:4464332
DOI10.1088/0305-4470/36/50/001zbMath1051.82010arXivcond-mat/0306602OpenAlexW1981436438MaRDI QIDQ4464332
Philippe Di Francesco, Jérémie Bouttier, Emmanuel Guitter
Publication date: 27 May 2004
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0306602
Enumeration in graph theory (05C30) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items (7)
On the equivalence of two fundamental theta identities ⋮ Statistics of planar graphs viewed from a vertex: A study via labeled trees ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ Embedded trees and the support of the ISE ⋮ A conditional limit theorem for tree-indexed random walk ⋮ Integrability of graph combinatorics via random walks and heaps of dimers ⋮ Geodesic distance in planar graphs: an integrable approach
This page was built for publication: Random trees between two walls: exact partition function