The three-point function of planar quadrangulations

DOI10.1088/1742-5468/2008/07/P07020MaRDI QIDQ5853631zbMATH OpenFDO

Authors Bouttier, Emmanuel Guitter

Publication date 11 March 2021

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Abstract: We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple universal scaling function, which is the continuous three-point function of pure 2D quantum gravity. We give explicit expressions for this universal three-point function both in the grand-canonical and canonical ensembles. Various limiting regimes are studied when some of the distances become large or small. By considering the case where the marked vertices are aligned, we also obtain the probability law for the number of geodesic points, namely vertices that lie on a geodesic path between two given vertices, and at prescribed distances from these vertices.

Recommendations

• The three-point function of general planar maps
• Statistics of geodesics in large quadrangulations
• Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop
• Geodesic distance in planar graphs
• Distance statistics in quadrangulations with no multiple edges and the geometry of minbus

Cites work

• A Census of Hamiltonian Polygons
• A Census of Planar Maps
• A Census of Planar Triangulations
• A Census of Slicings
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Blocked edges on Eulerian maps and mobiles: application to spanning trees, hard particles and the Ising model
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Combinatorics of bicubic maps with hard particles
• Combinatorics of hard particles on planar graphs
• Enumeration of planar constellations
• Geodesic distance in planar graphs
• On the fractal structure of two-dimensional quantum gravity
• Planar diagrams
• Planar maps as labeled mobiles
• Scaling in quantum gravity
• Statistics of geodesics in large quadrangulations

Cited in

(15)

• Multi-point functions of weighted cubic maps
• On a conjecture by Chapuy about Voronoï cells in large maps
• Comparing two statistical ensembles of quadrangulations: a continued fraction approach
• The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
• Geodesic distance in planar graphs
• The distance-dependent two-point function of triangulations: a new derivation from old results
• The distance-dependent two-point function of quadrangulations: a new derivation by direct recursion
• Confluence of geodesic paths and separating loops in large planar quadrangulations
• Brownian geometry
• Distance statistics in quadrangulations with no multiple edges and the geometry of minbus
• Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop
• Geodesic distance in planar graphs: an integrable approach
• What is a random surface?
• Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants
• The three-point function of general planar maps

This page was built for publication: The three-point function of planar quadrangulations

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