The Setting
When decorated by Fortuin-Kasteleyn percolation with cluster weight , large maps undergo geometric degeneration: their typical macroscopic geometry flattens into tree-like structures. For a planar map of size , rescaling the graph distance by a deterministic scaling constant and equipping the map with its normalized degree measure produces a random compact metric measure space. As the map size tends to infinity, this random metric measure space converges in distribution to the Brownian continuum random tree.
A planar map of size is represented as a rotation system on darts, indexed by the set . A labelled planar map on is a pair of permutations of satisfying two geometric conditions: the spanning graph is connected, and Euler’s formula holds for the fixed-point-free involution and vertex rotation .✦ An edge of a labelled planar map on is an orbit of the dart reversal involution , and a vertex of is an orbit of the vertex rotation . A rooted planar map is an equivalence class of labelled maps modulo root-preserving dart relabelling, where an isomorphism is a permutation of fixing dart and conjugating both and .✦
Let denote the set of rooted planar maps of size . Given a map with vertex set , edge set , and graph distance , and an edge subset , the spanning subgraph has connected components. The Fortuin-Kasteleyn weight of the pair at Potts parameter is (1)✦ and the finite partition function is the sum over all configurations, (2)✦ The normalized degree measure on is the probability measure on that assigns mass to each vertex , defined by pushing forward the uniform measure on darts under the projection to vertex orbits.✦
A metric measure presentation consists of a set equipped with a distance function , a Borel -algebra , and a finite Borel measure .✦ A valid metric measure presentation is a metric measure presentation such that is a compact metric space and is a probability measure.✦ Given two valid metric measure presentations and , an isometric amalgamation of and is a pseudometric space on the disjoint union whose restriction to coincides with and whose restriction to coincides with .✦ The ambient cost of an isometric amalgamation of two valid metric measure presentations and is the maximum of the Hausdorff distance between and and the Lévy-Prokhorov distance between the pushforward measures.✦ The Gromov-Hausdorff-Prokhorov distance between and is the infimum of ambient costs over all isometric amalgamations.✦ A Gromov-Hausdorff-Prokhorov test function is a bounded continuous real-valued function on valid metric measure presentations.✦ For any rooted planar map and scaling factor , the rescaled metric measure presentation of is the presentation with vertex set , distance , and measure .✦
The Brownian continuum random tree is coded by a normalized Brownian excursion. Let be three independent standard one-dimensional Brownian motions on a probability space . The normalized Brownian excursion is given by the three-dimensional Bessel bridge, (3)✦ The excursion pseudometric on the unit interval is defined by (4)✦ The Brownian continuum random tree is the quotient metric measure space endowed with the quotient metric and the pushforward measure of the uniform Lebesgue measure on .✦
The inventory bijection relates maps to trees through a burger and order alphabet. For , the parameter transformation sets , , and . The alphabet contains burger letters and order letters, each of two types, together with a flexible order letter. Letters carry probability weights: burger letters have mass , whereas flexible and fixed orders have masses and .✦ The inventory stack evaluation processes words freshest-first, and an order letter consumes the freshest eligible burger. An empty-reducing typed word is a typed word whose stack evaluation empties the stack.✦ A connected core is an empty-reducing typed word whose two-stack matching has a connected chord intersection graph.✦ A core tree is an ordered tree whose nodes are labelled by cores, with node arity equal to the length of the core word.✦ The inventory bijection establishes an equivalence between rooted planar maps of size and marked tree codes drawn under the law , corresponding bijectively to core trees of size .
The block generating function gives rise to a critical even offspring distribution on non-negative integers whose mass at is the block mass . This distribution has mean one, finite variance , and strictly positive masses at zero and two. For the Galton-Watson tree with this offspring distribution conditioned on size , the spine ladder distribution governs the distribution of core marks along its exploration walk. The mean core metric increment is the expected graph distance in a block from its pole to a distinguished corner under the spine distribution.✦ The scaling constant of the continuum limit is defined by (5)✦ and graph distances on maps of size are rescaled by .✦ The law of marked code draw on marked tree code samples of size is the probability measure obtained from the conditioned tree code law of the critical offspring distribution equipped with the conditional core mark distribution at each arity.✦
The Claim
Theorem 1. Let be a real Potts parameter. Let be a Gromov-Hausdorff-Prokhorov test function. Then the scaling constant satisfies (6)✦ Furthermore, the finite Fortuin-Kasteleyn planar maps converge weakly to the Brownian continuum random tree, (7)✦ and under the law of marked tree codes encoding maps , the marked map test observables satisfy (8)✦
In the paper, the result reads: for every fixed real , there is a deterministic constant such that, as through all positive integers, converges in distribution to in the Gromov-Hausdorff-Prokhorov topology on compact metric probability spaces modulo measure-preserving isometry.
What Is Checked
The scaling limit (7) is stated over the Potts parameter , the finite probability space of rooted planar maps with edge subsets weighted by with partition function given in (2), the rescaled metric measure presentations equipped with normalized degree measure , the continuum random tree generated by the three-dimensional Bessel bridge excursion in (3), and the class of bounded continuous test functions with respect to the Gromov-Hausdorff-Prokhorov distance on valid compact metric probability spaces.
Cyclic rotation by the good rotation of a discrete bridge yields a valid Lukasiewicz tree code✦, the sequence of core tree degrees forms a discrete excursion✦, and the planar map conditions are invariant under root-preserving dart relabelling.✦