OctoInformBeta

Brownian continuum random tree limits of finite Fortuin-Kasteleyn maps above four

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 MM with vertex set V(M)V(M) and edge set E(M)E(M) and an edge subset A⊆E(M)A \subseteq E(M), let kM(A)k_M(A) be the number of connected components of the spanning graph (V(M),A)(V(M), A), counting isolated vertices. For q>4q > 4 and an integer n≥1n \ge 1, a critical Fortuin-Kasteleyn planar map of size nn is a random pair (Mn,An)(M_n, A_n) sampled among rooted planar maps MM with |E(M)|=n|E(M)| = n and edge subsets A⊆E(M)A \subseteq E(M) with probability proportional to qkM(A)+(|A|−|V(M)|)/2q^{k_M(A) + (|A| - |V(M)|)/2}. Let dnd_n be the graph distance on V(Mn)V(M_n) using every edge of MnM_n. With deg⁡Mn(v)\deg_{M_n}(v) denoting the degree of v∈V(Mn)v \in V(M_n) in MnM_n with each loop counted twice, let μn\mu_n be the normalized degree probability measure on V(Mn)V(M_n) given by μn({v})=deg⁡Mn(v)/(2n)\mu_n(\{v\}) = \deg_{M_n}(v)/(2n). For a standard normalized Brownian excursion ee on [0,1][0, 1], let (𝒯e,de,μe)(\mathcal{T}_e, d_e, \mu_e) denote the Brownian continuum random tree with tree metric ded_e and mass measure μe\mu_e given by the pushforward of Lebesgue probability measure on [0,1][0, 1]. The question is whether, as n→∞n \to \infty through all positive integers, the compact metric probability spaces (V(Mn),dn,μn)(V(M_n), d_n, \mu_n) with graph distances rescaled by a qq-dependent multiple of n−1/2n^{-1/2} converge weakly in the Gromov-Hausdorff-Prokhorov topology to (𝒯e,de,μe)(\mathcal{T}_e, d_e, \mu_e).

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 q=4q = 4, above which the limiting inventory fluctuations are one-dimensional. The finite-volume Brownian continuum random tree prediction for q>4q > 4 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 q>4q > 4, there is a deterministic constant c(q)∈(0,∞)c(q) \in (0, \infty) such that (V(Mn),c(q)n−1/2dn,μn)(V(M_n), c(q) n^{-1/2} d_n, \mu_n) converges weakly as n→∞n \to \infty through all positive integers to (𝒯e,de,μe)(\mathcal{T}_e, d_e, \mu_e) 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 q>4q > 4 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 q=4q=4, and Metric-measure limits of subcritical FK and spanning-tree planar maps.

The Lean library: FKMaps

FKMaps is a Lean library: 33 items, in six groups. Each has a page written by OctoInform, listed below.

§1. Introduction 2 items
  1. §1.1 (setting): the finite model and Brownian excursion tree Finite Fortuin-Kasteleyn maps and the Brownian excursion tree. §1
  2. Theorem 1.1 [Brownian continuum random tree limits of finite Fortuin-Kasteleyn maps above four] Fortuin-Kasteleyn planar maps converge to the Brownian continuum random tree. §1
§2. Words and strict drift 6 items
  1. §2.1 (setting): parameters and reduction of words Parameters and stack reduction of inventory words. §2
  2. Lemma 2.1 [Reduction above an older supply] Reduction of inventory words above an older burger supply. §2
  3. Proposition 2.2 [Finite word identity] Empty-reducing word probabilities match rooted map partition functions. §2
  4. Corollary 2.3 [Catalan upper bound] Endpoint summability for Fortuin-Kasteleyn maps with q>4q > 4. §2
  5. §2.3 (setting): the first backward survivor Reduced state and stopped defect at the first backward survivor. §2
  6. Proposition 2.4 [Strict drift] Strict backward drift of inventory streams for p∈(1/2,1)p \in (1/2, 1). §2
§3. Ladder cuts and a coefficient lower bound 8 items
  1. §3 (setting): ladder pieces and seam intervals Ladder piece laws and seam reduction probability factorization. §3
  2. Proposition 3.1 [Coefficient lower bound] Abel lower bound for Fortuin-Kasteleyn maps with q>4q > 4. §3
  3. Lemma 3.2 [Stationary averaging] Strong law for stationary product shifts and sublinear boundary gaps. §3
  4. Definition 3.3 [L-cut and R-cut] Left and right cuts for sequences of inventory words. §3
  5. Lemma 3.4 [Positive probability of cuts] Positive probability and density of inventory piece cuts. §3
  6. Lemma 3.5 [Bottom supply and terminal demand] Complete inventory matching under the supply condition. §3
  7. Lemma 3.6 [Output frequencies] Output order masses and uniform inventory count limits on cuts. §3
  8. Proposition 3.7 [Uniform success at a seam] Uniform reduction probabilities and deterministic matching at inventory seams. §3
§4. The critical block tree 5 items
  1. §4.1 (setting): corners, blocks and generating functions Corner substitution decomposes nonempty stack-emptying typed words. §4
  2. Lemma 4.1 [Rooted corner substitution] Corner substitution and generating series for inventory words. §4
  3. Lemma 4.2 [Quadratic inverse criterion] A quadratic inverse criterion for critical block weights. §4
  4. §4.3 (setting): the marked branching law Critical even offspring laws and conditional core mark distributions. §4
  5. Proposition 4.3 [Exact finite representation] Exact marked tree representation of finite Fortuin-Kasteleyn maps. §4
§5. Conditioned trees and uniform path sums 7 items
  1. §5 (setting): exploration walks and excursions Exploration walks and spine laws for conditioned Galton-Watson trees. §5
  2. Proposition 5.1 [Joint coding limit] Joint Brownian excursion limits for critical even tree codes. §5
  3. Corollary 5.2 [Offspring and walk bounds] Offspring and height bounds for critical even tree codes. §5
  4. Lemma 5.3 [Cost of conditioning] Asymptotics along odd lengths for critical even tree codes. §5
  5. Lemma 5.4 [Bounded path sums] Uniform convergence in probability for bounded marked spine sums. §5
  6. Theorem 5.5 [Uniform marked path sums] Degree-bounded spine sums concentrate in critical even conditioned trees. §5
  7. Lemma 5.6 [Common ancestors and walk minima] Common route bounds and distance comparison on core trees. §5
§6. From the block tree to the map 5 items
  1. §6 (setting): the metric marks and constants Positive metric constants and distances on core trees. §6
  2. Lemma 6.1 [Distances between poles] Real graph distances between node poles and nonroot surjectivity. §6
  3. Lemma 6.2 [Corner mass] Rotation-intertwining bijections equate nonroot pole and dart Dirac sums. §6
  4. Lemma 6.3 [Metric and mass comparison] Gromov-Hausdorff-Prokhorov bounds from codings and continuous functions. §6
  5. §6.4 (proof of Theorem 1.1): assembly Brownian continuum random tree limit of Fortuin-Kasteleyn maps above four. §6

No item matches.