Random trees between two walls: Exact partition function
arXiv:cond-mat/0306602 · doi:10.1088/0305-4470/36/50/001
Abstract
We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that adjacent vertices have labels differing by +1 or -1. A non-trivial partition function is obtained whenever the target space is bounded by walls. We concentrate on the two cases where the target space is (i) the half-line bounded by a wall at the origin or (ii) a segment bounded by two walls at a finite distance. The general solution has a soliton-like structure involving elliptic functions. We derive the corresponding continuum scaling limit which takes the remarkable form of the Weierstrass p-function with constrained periods. These results are used to analyze the probability for an evolving population spreading in one dimension to attain the boundary of a given domain with the geometry of the target (i) or (ii). They also translate, via suitable bijections, into generating functions for bounded planar graphs.
25 pages, 7 figures, tex, harvmac, epsf; accepted version; main modifications in Sect. 5-6 and conclusion
References in corpus (3)
Cited by in corpus (11)
- 2D Quantum Gravity, Matrix Models and Graph Combinatorics
- On the equivalence of two fundamental theta identities
- Statistics of planar graphs viewed from a vertex: A study via labeled trees
- Combinatorics of bicubic maps with hard particles
- Q-system Cluster Algebras, Paths and Total Positivity
- Integrability of graph combinatorics via random walks and heaps of dimers
- An invariance principle for conditioned trees
- Conditioned Brownian trees
- Combinatorial families of multilabelled increasing trees and hook-length formulas
- A note on naturally embedded ternary trees
- On embedded trees and lattice paths