Basic properties of the infinite critical-FK random map

From MaRDI portal



Abstract: We investigate the critical Fortuin-Kasteleyn (cFK) random map model. For each qin[0,infty] and integer ngeq1, this model chooses a planar map of n edges with a probability proportional to the partition function of critical q-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 q=1, 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 q, and mutually singular in distribution for different values of q.


The paper studies the critical Fortuin-Kasteleyn (cFK) random map model of size \(n\) (\(=\) of \(n\) edges) and of parameter \(q\). The model is defined by the probability law \(Q_n^{(q)}\) on the set of all subgraph-rooted maps on \(n\) edges. The probability \(Q_n^{(q)}\) is proportional to the partition function of the Potts model. The main result of the paper states that for each \(q\in [0,\infty)\), \(Q_n^{(q)}\rightarrow Q_\infty^{(q)}\) in distribution.











This page was built for publication: Basic properties of the infinite critical-FK random map

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412680)