A rooted planar map is a connected graph embedded in an oriented sphere up to orientation-preserving homeomorphism, with loops and multiple edges allowed, equipped with a distinguished oriented edge. For a rooted planar map with vertex set and edge set and an edge subset , let be the number of connected components of the spanning graph , counting isolated vertices. For and an integer , a critical Fortuin-Kasteleyn planar map of size is a random pair sampled among rooted planar maps with and edge subsets with probability proportional to . Let be the graph distance on using every edge of . With denoting the degree of in with each loop counted twice, let be the normalized degree probability measure on given by . For a standard normalized Brownian excursion on , let denote the Brownian continuum random tree with tree metric and mass measure given by the pushforward of Lebesgue probability measure on . The question is whether, as through all positive integers, the compact metric probability spaces with graph distances rescaled by a -dependent multiple of converge weakly in the Gromov-Hausdorff-Prokhorov topology to .
Fortuin and Kasteleyn introduced the random-cluster representation connecting percolation and Potts-type spin systems through a weight on edge subsets. Sheffield encoded random Fortuin-Kasteleyn planar maps through an inventory model. In that encoding, Sheffield proved an unconditioned walk theorem identifying a transition at , above which the limiting inventory fluctuations are one-dimensional. The finite-volume Brownian continuum random tree prediction for appeared in an appendix to that work by Sheffield. Feng restated that finite-volume prediction as a conjecture. For an infinite Fortuin-Kasteleyn planar map, Feng proved an infinite-volume counterpart in which the map converges to an infinite continuum random tree in the local Gromov-Hausdorff-Prokhorov topology.
The preprint proves that for every fixed real , there is a deterministic constant such that converges weakly as through all positive integers to in the Gromov-Hausdorff-Prokhorov topology on compact metric probability spaces modulo measure-preserving isometry.
The results on these pages are those of the Lean library, each stated as the Lean library states it and linked to the Lean declaration behind it. Lean has checked every result of the Lean library with no unfinished proofs, so the Lean library is the reference. Where the preprint states a result differently, the statement on the page is the Lean library’s, with the preprint’s statement given beside it. The preprint is a guide only, giving the results their order and their names. Under catalog entry 211, the Lean library covers only the Brownian continuum random tree limit of the preprint, not the six other preprints listed under that entry: Random Walks on Critical FK-Ising Maps and Liouville Brownian Motion, Spectral convergence for critical FK-Ising planar maps, A Linear Clock for Random Walk on Tree-Weighted Planar Maps, Canonical conformal limits of subcritical FK planar maps, The critical Liouville quantum sphere and geometric limits of FK maps at , and Metric-measure limits of subcritical FK and spanning-tree planar maps.
FKMaps is a Lean library: 33 items, in six groups. Each has a page written by OctoInform, listed below.
No item matches.