Basic properties of the infinite critical-FK random map
arXiv:1502.01013 · doi:10.4171/AIHPD/40
Abstract
We investigate the critical Fortuin-Kasteleyn (cFK) random map model. For each and integer , this model chooses a planar map of edges with a probability proportional to the partition function of critical -Potts model on that map. Sheffield introduced the hamburger-cheeseburger bijection which maps the cFK random maps to a family of random words, and remarked that one can construct infinite cFK random maps using this bijection. We make this idea precise by a detailed proof of the local convergence. When , this provides an alternative construction of the UIPQ. In addition, we show that the limit is almost surely one-ended and recurrent for the simple random walk for any , and mutually singular in distribution for different values of .
14 pages, 6 figures. v2: Fixed the proof of main theorem, removed old lemma 5, added results on mutually singular measures and ergodicity. Submitted to Annales de l'Institut Henri Poincaré D
References in corpus (4)
- Local limit of labeled trees and expected volume growth in a random quadrangulation
- Scaling limits for the critical Fortuin-Kastelyn model on a random planar map III: finite volume case
- Scaling limits for the critical Fortuin-Kasteleyn model on a random planar map I: cone times
- Scaling limits for the critical Fortuin-Kastelyn model on a random planar map II: local estimates and empty reduced word exponent
Cited by in corpus (7)
- The fractal dimension of Liouville quantum gravity: universality, monotonicity, and bounds
- Mating of trees for random planar maps and Liouville quantum gravity: a survey
- Active spanning trees with bending energy on planar maps and SLE-decorated Liouville quantum gravity for
- The perimeter cascade in critical Boltzmann quadrangulations decorated by an loop model
- Local convergence of large random triangulations coupled with an Ising model
- Planar maps and random partitions
- Sandpiles and unicycles on random planar maps