The Setting
In the planar map model decorated by Fortuin-Kasteleyn (FK) percolation with parameter , large finite maps decompose along a critical Galton-Watson tree conditioned to have vertices, where each vertex carries a core block contributing to graph distances. Moving from the root to a vertex traverses an ancestral spine whose steps correspond to weak ascending ladder records of the reversed Lukasiewicz exploration walk, recording both the ancestor’s offspring degree and its overshoot.
When each spine step receives a real-valued mark bounded in magnitude by the ancestor’s offspring degree, summing those marks along the spine yields an ancestral path sum. Under only a finite second moment for the offspring distribution, do these marked spine sums stay within of a constant multiple of the vertex height simultaneously across all vertices with probability tending to for every , both for general degree-bounded marks and for the core metric increments of the FK inventory model?
Conditioned Trees and Marked Spine Sums
A critical even offspring distribution is a probability distribution on such that for every odd , , , , and .✦ A block offspring probability weight sequence is a sequence of nonnegative real numbers satisfying ✦, and the doubled block mass sequence of is the sequence on that assigns when is even and when is odd. Whenever satisfies , , , and , its doubled sequence defines a critical even offspring distribution.✦
For a natural number , a degree sequence , and a step , the degree sequence partial walk is (1)✦ A discrete bridge sequence of length is a degree sequence in whose partial walk (1) satisfies , and a Lukasiewicz tree code of length is a discrete bridge sequence of length such that for all . The tree vertex height of a degree sequence of length at step is the number of indices with such that for every satisfying .✦
When , cyclically rotating a degree sequence or discrete bridge sequence of length by an offset produces the sequence ; the good rotation index of a bridge is the unique cyclic shift index turning into a valid tree code, and the canonical tree code of is the bridge obtained by rotating by . The total step of an integer sequence is the integer .✦ Under a critical even offspring distribution , the offspring product measure on governs independent draws from ✦, and conditioning on having total step yields the conditioned offspring bridge law ✦; pushing forward under the tree code map from integer sequences of length to Lukasiewicz tree codes of length gives the conditioned tree code law .✦
Given a measurable mark space and a family of probability measures on , the conditional mark measure on a Lukasiewicz tree code of length is the product measure on , forming the tree code marking kernel from tree codes of length to . Combining the conditioned tree code law with this marking kernel of length defines the marked tree code law on pairs of a tree code of length and a vertex marking .✦
The offspring walk partial sum of a stream at time is the integer , and the running maximum of an integer sequence up to is the integer . The weak record times up to of form the set ✦, and the record type at step for is .✦ Extending a tree code of length by zeros for indices gives a stream , whose reversed prefix of length is the stream taking for and for . The spine records of at step are the weak record times ✦; each record determines the spine record type as the record type of at step , together with the spine record vertex . Given a mark label and a marking , the marked spine sum at step is (2)✦
Under a critical even offspring distribution , the infinite offspring product measure governs streams .✦ A step satisfies the ladder epoch condition for if , or if for every and .✦ The first weak ladder epoch is the first time step at which the exploration walk attains a weak ascending ladder record, with weak ladder overshoot and spine ladder pair . Pushing forward under yields the offspring spine ladder distribution on .✦ For a cutoff and a pair , the spine tail truncation is (3)✦
The Inventory Model and Core Metric Marks
An FK model parameter choice specifies , determining the inventory radius parameter and the flexible order parameter . An inventory order is either a flexible order or a fixed order carrying a type in ✦, and a burger-order alphabet letter is either a burger token carrying a type in or an inventory order.✦ An inventory stack evaluation state pairs a list of pending orders with a freshest-first list of boolean burger types✦; evaluating a word of letters updates this state step by step, and word reduction evaluates the word starting from empty pending orders and an empty burger stack.✦ A word is empty-reducing if its reduction yields the empty state with neither pending orders nor burgers.✦ Under parameter , the letter distribution on the burger-order alphabet assigns probability to each burger token, to the flexible order, and to each fixed order, generating for each index set the independent and identically distributed inventory stream measure on . For , the empty-reducing word probability is the probability , and the total empty word probability is the sum .
A typed burger-order letter is either a burger token or an order token, each carrying a type in .✦ Typed word stack execution evaluates a typed word against a boolean burger stack and returns either the resulting stack or failure on an illegal closure, while the empty-reducing typed word set consists of all typed words of length whose execution from an empty stack finishes with an empty stack.✦ For a typed word and initial stack , the flexible closing count counts the flexible order closures encountered during evaluation; writing for the empty initial stack, the inventory word monomial weight of at parameters is . Along a list of positions, a non-crossing arch matching is formed inductively by skipping unmatched items or nesting a paired arch around non-crossing matchings on the interior and exterior✦, and the arch transposition product maps an arch list to the identity when empty and to when precedes .✦ A two-stack matching certificate for a typed-letter assignment along consists of two non-crossing arch matchings and along whose endpoints together form a permutation of , with every pairing a burger with a order and every pairing a burger with a order✦, and the mate permutation of is the permutation of , where denotes concatenation.
For a permutation of , the chord opening endpoints are the indices with ✦; two openers and satisfy the chord crossing relation if or , forming the edges of the chord intersection graph of on its openers. A connected typed core of length is a typed word of length arising from a letter sequence on admitting a two-stack matching certificate whose mate permutation has a root opener at from which every opener is reachable in the chord intersection graph of . For a connected typed core of length , empty-stack execution determines its canonical two-stack matching , its core entry corner is , and its core vertex rotation permutation is on , where is the cyclic shift permutation of . Given any permutation on a finite set, the permutation-wedge vertices are the cycle equivalence classes of ✦, and the permutation-wedge dart graph of edge permutation and vertex rotation is the simple graph on those cycle vertices whose edges connect distinct cycle classes and whenever some dart belongs to one and belongs to the other.✦ The isolated core map graph of is the permutation-wedge dart graph of and ✦, and the core corner metric increment of at corner is the graph distance (4)✦ where denotes the cycle vertex of under .
An optional core label is either empty or a connected typed core , with arity when empty and when a core . At real parameters , the parametric core label mass assigns to the empty label and times the inventory word monomial weight to a core ✦; evaluating at gives the root core mark mass and defines the root core mark distribution on optional core labels. Conditioning on labels of arity produces the conditional core mark distribution , or the point mass at the empty label when no label has arity , assembling into the conditional core mark family .✦ For each , the core generating polynomial coefficient , the block generating polynomial coefficient , and the actual FK block mass are (5) where denotes the words in satisfying the connected core word condition. Applying the doubled-mass critical even offspring construction to the actual FK block masses (5) produces the critical FK corner offspring distribution .✦ For a spine pair and an optional core label , the core label metric increment is defined from (4) by (6)✦ and the mean core metric increment under parameter is (7)✦ where is the offspring spine ladder distribution of .
The Claim
Theorem 1. Let be a critical even offspring distribution, let be a probability space carrying a real-valued Brownian motion , let be a measurable space equipped with a probability mark kernel into , and let be a label such that is measurable for every and for all and . Write . Then for every , the marked spine sum (2) satisfies (8)✦ Under any critical even offspring distribution alone, the spine tail truncation (3) satisfies (9)✦ Moreover, for any FK parameter and any probability space carrying a real-valued Brownian motion , the core label metric increment (6) and its mean (7) satisfy, for every , (10)✦
In the paper, the result reads: let be a fixed measurable label with ; then , , and , where , , , and stand for , , , and , and denotes the conditioned tree of size .
What Is Checked
Claims (8) and (9) are stated over critical even offspring distributions and their offspring spine ladder distributions , together with the spine tail truncation (3) in (9) and, in (8), marked tree code laws on size , a probability space carrying a real-valued Brownian motion, and a measurable label bounded in absolute value by the offspring degree. Claim (10) is stated over an FK parameter , a probability space carrying a real-valued Brownian motion, the critical FK corner offspring distribution built from the actual FK block masses (5), the conditional core mark distribution , and the core label metric increment (6) with mean (7).
About these constructions, the library establishes that for every FK parameter the actual FK block masses (5) are nonnegative for all ✦ and strictly positive at and . It also establishes that any typed-letter sequence along a list of positions whose typed stack execution from an empty stack terminates in an empty stack admits a two-stack matching certificate✦, and that every stream admits an index satisfying the ladder epoch condition.✦