Random trees between two walls: exact partition function

DOI10.1088/0305-4470/36/50/001MaRDI QIDQ4464332zbMATH OpenOpenAlexFDO

Authors Bouttier, Philippe Di Francesco, 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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

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.

Recommendations

• scientific article; zbMATH DE number 4081578
• Random recursive trees: a boundary theory approach
• Boundary partitions in trees and dimers
• On the bipartition numbers of random trees. II
• Random Trees
• On random trees
• Exact Packing Measure on the Boundary of a Galton–Watson Tree
• Percolation on a product of two trees

Cited in

(7)

• Statistics of planar graphs viewed from a vertex: A study via labeled trees
• Embedded trees and the support of the ISE
• A conditional limit theorem for tree-indexed random walk
• Geodesic distance in planar graphs: an integrable approach
• On the equivalence of two fundamental theta identities
• Integrability of graph combinatorics via random walks and heaps of dimers
• Combinatorial families of multilabelled increasing trees and hook-length formulas

This page was built for publication: Random trees between two walls: exact partition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464332)