The Setting
Consider a conditioned Galton-Watson tree of odd size governed by a critical even offspring distribution. At scale , how large can vertex heights and individual offspring counts grow, and how closely do degree sums along ancestral paths to the root track a constant multiple of vertex height?
Offspring Laws and Tree Codes
A critical even offspring distribution is a nonnegative function , inducing an offspring probability law on , such that vanishes on all odd integers, satisfies and , and obeys (1): (1)✦ The offspring distribution variance of is given by (2): (2)✦
Given a critical even offspring distribution and , the independent and identically distributed (i.i.d.) offspring product measure on is the -fold product of the offspring law of .✦ The total step of a finite sequence is .✦ Conditioning on the event for defines the conditioned offspring bridge law on .✦
The degree sequence partial walk of () at step is given by (3): (3) A sequence satisfies the valid tree-code condition when and for all .✦ A Lukasiewicz tree code of length is a sequence satisfying the valid tree-code condition, forming the set .✦ A discrete bridge sequence of length is a sequence satisfying , forming the set .✦ When and , the cyclic rotation is the permutation on , and by restriction on , sending to the sequence given by for .
For , , and , the tree vertex height is the cardinality in (4): (4)✦
For , the tree-code map sends each sequence in to a Lukasiewicz tree code of length , and the conditioned tree-code law on is the pushforward of under . Given a critical even offspring distribution and , the tree-code weight of is , and the tree-code partition function is ✦. The bridge weight of under and is ✦, with bridge partition function ✦. For a critical even offspring distribution , an integer , and an event , the tree-code event mass is the unnormalized mass , and the tree-code event probability is the ratio given by (5): (5)
Spine Sums and Reversed Paths
Given and a horizon , the time-reversed path is defined by (6): (6)✦ The running maximum of up to is .✦ When takes values in a linearly ordered set and , the weak record times up to form the finite set in (7): (7)✦
The offspring walk partial sum of a sequence at time is .✦ At step , the record type of is the pair given by (8): (8)✦ For a mark function , a sequence , and , the record spine sum is the real number given by (9): (9) Extending a finite sequence () by zero beyond yields the sequence with for and for . For , the reversed prefix index is when and when .✦ Composing a sequence with gives the reversed prefix sequence .✦ Evaluated on a Lukasiewicz tree code , a mark , and , the tree-code spine sum is .✦
The Claim
Theorem 1. Let be a critical even offspring distribution with variance .
For every , the maximum offspring count satisfies (10): (10)✦
For every and all , writing for the indicator of a condition and for the time-reversed path of with horizon , the tree-code and bridge averages satisfy (11): (11)✦
Given a probability space equipped with a real Brownian motion and a threshold , there exists such that for all sufficiently large , the height tail satisfies (12): (12)✦
Given a probability space equipped with a real Brownian motion , the first-coordinate mark on , and , the spine-height deviation satisfies (13): (13)✦
In the paper, the result reads: for size , , , , and , where and correspond to and , is the maximum offspring count, is the height-walk slope parameter, and and denote stochastic boundedness and convergence to zero in probability. The library casts the tree-code degree and height bounds in (10) and (12), while addressing the height-walk comparison through the spine-sum limit (13) and the exact bridge identity (11).
What Is Checked
The four claims of the theorem are formulated over a critical even offspring distribution with variance and its induced conditioned laws and on weighted length- tree codes and discrete bridges, together with the walk-height and reversed-path record functionals (and tree-code spine sums), assuming a real Brownian motion on a probability space in (12) and (13). Every discrete bridge sequence of length has a unique good rotation index such that the cyclic bridge rotation satisfies the valid tree-code condition, yielding the canonical tree code of .