English

Scaling limits for random triangulations on the torus

Discrete Mathematics 2019-05-07 v1 Combinatorics Probability

Abstract

We study the scaling limit of essentially simple triangulations on the torus. We consider, for every n1n\geq 1, a uniformly random triangulation GnG_n over the set of (appropriately rooted) essentially simple triangulations on the torus with nn vertices. We view GnG_n as a metric space by endowing its set of vertices with the graph distance denoted by dGnd_{G_n} and show that the random metric space (V(Gn),n1/4dGn)(V(G_n),n^{-1/4}d_{G_n}) converges in distribution in the Gromov-Hausdorff sense when nn goes to infinity, at least along subsequences, toward a random metric space. One of the crucial steps in the argument is to construct a simple labeling on the map and show its convergence to an explicit scaling limit. We moreover show that this labeling approximates the distance to the root up to a uniform correction of order o(n1/4)o(n^{1/4}).

Keywords

Cite

@article{arxiv.1905.01873,
  title  = {Scaling limits for random triangulations on the torus},
  author = {Vincent Beffara and Cong Bang Huynh and Benjamin Lévêque},
  journal= {arXiv preprint arXiv:1905.01873},
  year   = {2019}
}

Comments

93 pages

R2 v1 2026-06-23T08:57:47.739Z