Basic properties of the infinite critical-FK random map
Linxiao Chen

TL;DR
This paper studies the critical FK random map model, establishing its properties, including local convergence to an infinite map, recurrence, and singularity across different parameters, using a bijection with random words.
Contribution
It provides a detailed proof of local convergence of the critical FK random maps to an infinite map and explores their properties across different parameters.
Findings
Limit is almost surely one-ended.
Limit is recurrent for simple random walk.
Distributions are mutually singular for different q values.
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
