Statistics of planar graphs viewed from a vertex: A study via labeled trees

DOI10.1016/j.nuclphysb.2003.09.046zbMath1027.05021arXivcond-mat/0307606OpenAlexW2076019631MaRDI QIDQ1414558

Philippe Di Francesco, Emmanuel Guitter, Jérémie Bouttier

Publication date: 23 November 2003

Published in: Nuclear Physics. B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0307606

zbMATH Keywords

Eulerian triangulationsexact generating functionsrandom planar quadrangulations

Mathematics Subject Classification ID

Trees (05C05)

Related Items (7)

Limit of normalized quadrangulations: the Brownian map ⋮ The two-point function of bicolored planar maps ⋮ On the two-point function of general planar maps and hypermaps ⋮ Random real trees ⋮ 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

Cites Work

• Counting colored random triangulations
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Eigenvalue distribution of large random matrices, from one matrix to several coupled matrices
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Coloring random triangulations
• Geodesic distance in planar graphs
• Random planar lattices and integrated superBrownian excursion
• Planar diagrams
• Random trees between two walls: exact partition function
• A Census of Planar Maps
• Analytical and numerical study of a model of dynamically triangulated random surfaces

This page was built for publication: Statistics of planar graphs viewed from a vertex: A study via labeled trees