The Setting
In the Fortuin-Kasteleyn random cluster model with cluster weight , the percolation interfaces form macroscopic loops, and the geometry of the underlying map, rescaled by its graph distance, converges in distribution under the Gromov-Hausdorff-Prokhorov topology to the Brownian continuum random tree.
Combinatorial Maps
For an integer , a planar map with edges is described by oriented half-edges called darts. The set of darts of size is (1)✦ indexed as in (1).
The permutation orbit space of a permutation of is the quotient of by the cycle equivalence relation (2)✦ where two darts are equivalent in (2) when they lie in the same cycle of .
Given a permutation of and a dart , the orbit is the equivalence class (3)✦ defined in (3).
With permutations and of and a subset of orbits , the spanning graph is the simple graph with vertex set whose edges connect distinct orbits linked by darts whose -orbit belongs to , (4)✦ as formulated in (4).
A pair of permutations of satisfies the planar map conditions if is a fixed-point-free involution, the spanning graph of all orbits is connected, and the Euler characteristic corresponds to the sphere: (5)✦ prescribed in (5).
A labelled planar map of size is a pair of permutations of satisfying the planar map conditions (5), (6)✦ stated in (6).
Two labelled planar maps and of size are isomorphic, written , if there is a permutation of fixing the root dart that conjugates their permutations: (7)✦ written as in (7).
A rooted planar map of size is an equivalence class of labelled planar maps under rooted map isomorphism, (8)✦ given in (8).
The dart reversal involution of a rooted map is the dart involution of a representative labelled map , (9)✦ in (9).
The vertex rotation permutation of a rooted map is the rotation permutation of a representative labelled map , (10)✦ in (10).
The vertices of a rooted map form the orbit space of its vertex rotation permutation, (11)✦ in (11).
The edge set of a rooted map is the orbit space of its dart reversal involution , (12)✦ in (12).
For a rooted map and an edge subset , the spanning graph is the simple graph on vertex set induced by the edges in , (13)✦ as defined in (13).
The Fortuin-kasteleyn Measure
The cluster count of an edge subset in a rooted map is the number of connected components of the spanning graph , (14)✦ in (14).
Given a Potts parameter , a rooted map , and an edge subset , the Fortuin-Kasteleyn weight is the positive real number (15)✦ defined in (15).
The Fortuin-Kasteleyn partition function for Potts parameter and map size is the sum of weights over all rooted maps of size and all edge subsets, (16)✦ given in (16).
Metric Measure Spaces and Test Functions
A metric measure space is a quadruple consisting of a set , a distance function , a -algebra on , and a measure on , (17)✦ as in (17).
A metric measure space is valid if is a compact metric space, is its Borel -algebra, and is a Borel probability measure, (18)✦ in (18).
For a rooted map , the normalized degree measure on is the probability measure that assigns to each vertex a mass proportional to its degree, (19)✦ in (19), so that .
Given a scale factor and a rooted map , the rescaled map metric measure space is the metric measure space with vertices , graph distance scaled by , discrete -algebra, and normalized degree measure, (20)✦ in (20), where denotes the shortest-path metric in .
For two metric measure spaces and , a pseudometric on the disjoint union amalgamates and if it restricts to on and to on , (21)✦ as formulated in (21).
The ambient cost between two metric measure spaces and with respect to an amalgamation pseudometric on is the maximum of the Hausdorff distance between the canonical embeddings and and the Levy-Prokhorov distance between the pushforward measures, (22)✦ in (22).
The Gromov-Hausdorff-Prokhorov distance between two metric measure spaces is the infimum of the ambient cost over all isometric amalgamations, (23)✦ as defined in (23).
A functional on metric measure spaces is a Gromov-Hausdorff-Prokhorov test function if it is bounded and continuous with respect to the Gromov-Hausdorff-Prokhorov distance on valid spaces, (24)✦ in (24).
The Brownian Continuum Random Tree
For a continuous function , the excursion pseudometric on the unit interval is (25)✦ in (25).
The excursion tree associated with is the quotient metric space of by the pseudometric , (26)✦ in (26).
The canonical projection of the excursion tree sends each time parameter to its equivalence class under , (27)✦ as in (27).
For a continuous function , the continuum random tree metric measure space is the space with underlying set , metric , Borel -algebra, and the pushforward measure of the Lebesgue measure on , (28)✦ in (28).
For a three-dimensional standard Brownian motion on a probability space , the standard normalized Brownian excursion is the norm of the three-dimensional Bessel bridge, (29)✦ given in (29).
The Definition
Definition 1. Let be the Potts parameter, a scale factor, an edge parameter, and a test functional on metric measure spaces. The finite Fortuin-Kasteleyn expectation of is (30)✦ as in (30), and for a probability space carrying a three-dimensional standard Brownian motion , the Brownian continuum random tree expectation of is (31)✦ as in (31).
In the paper, the result reads: for and , a rooted planar map with edge subset of size is sampled with probability proportional to , where is the number of connected components of and is the number of Fortuin-Kasteleyn interface loops, graph distance uses all edges, normalized degree measure is , and the standard normalized Brownian excursion defines the continuum random tree via .
What Is Checked
The definitions are stated over rooted planar maps with edges represented by orientation-preserving rotation systems on darts, Fortuin-Kasteleyn edge weights with parameter , valid compact metric measure spaces equipped with their normalized degree measures, and the continuum random tree of a standard Brownian excursion formed from a three-dimensional Bessel bridge.