The three-point function of general planar maps
arXiv:1403.3514 · doi:10.1088/1742-5468/2014/09/P09012
Abstract
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are given for maps counted by their number of edges only, or by both their numbers of edges and faces. A few limiting cases and applications are discussed.
arXiv comment33 pages, 12 figures
References in corpus (7)
- The topological structure of scaling limits of large planar maps
- Geodesic Distance in Planar Graphs
- Scaling in quantum gravity
- The three-point function of planar quadrangulations
- Trees and spatial topology change in CDT
- Planar maps and continued fractions
- Confluence of geodesic paths and separating loops in large planar quadrangulations
Cited by in corpus (5)
- Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants
- On a conjecture by Chapuy about Voronoi cells in large maps
- Large deviation Local Limit Theorems and limits of biconditioned Trees and Maps
- The mesoscopic geometry of sparse random maps
- Random Lévy Looptrees and Lévy Maps