The three-point function of general planar maps
From MaRDI portal
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.
Recommendations
Cites work
- A Bijection for Rooted Maps on Orientable Surfaces
- Confluence of geodesic paths and separating loops in large planar quadrangulations
- Geodesic distance in planar graphs
- Planar maps and continued fractions
- Planar Maps are Well Labeled Trees
- Planar maps as labeled mobiles
- Scaling in quantum gravity
- Tessellations of random maps of arbitrary genus
- The three-point function of planar quadrangulations
- The topological structure of scaling limits of large planar maps
- Trees and spatial topology change in causal dynamical triangulations
Cited in
(12)- Geodesic distance in planar graphs
- Embedding theorems for the traces of grid functions in three dimensions
- Multi-point functions of weighted cubic maps
- The mesoscopic geometry of sparse random maps
- On a conjecture by Chapuy about Voronoï cells in large maps
- On the two-point function of general planar maps and hypermaps
- The three-point function of planar quadrangulations
- Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants
- Large deviation local limit theorems and limits of biconditioned planar maps
- Planar maps and continued fractions
- Random Lévy looptrees and Lévy maps
- The two-point function of bicolored planar maps
This page was built for publication: The three-point function of general planar maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3302043)