Random Sequential Compactness

• Random sequential compactness is the almost-sure compactness of metric trees built via a Poisson stick-breaking procedure, characterized by a cumulative gluing measure condition.
• It establishes a necessary and sufficient criterion by quantifying the controlled growth of the cumulative gluing measure, ensuring finite completion of the tree.
• The analysis connects the compactness criterion to fractal dimensions, yielding insights into metric covering rates and the branching complexity of random trees.

Searching arXiv for the cited papers and closely related work on compactness criteria and precompactness. arxiv_search(query="(Blanc-Renaudie, 2020) Compactness and fractal dimensions of inhomogeneous continuum random trees", max_results=5) Random sequential compactness concerns compactness obtained from a random sequential construction. In the setting of inhomogeneous continuum random trees, it refers to the almost-sure compactness of the completed metric tree produced by a Poisson stick-breaking procedure, with a necessary and sufficient criterion expressed through the cumulative gluing measure $\mu[0,l]$ (Blanc-Renaudie, 2020). In a distinct but related measure-theoretic direction, sequential tightness provides a sufficient condition for weak precompactness of sequences of probability measures and of laws of random curves, relaxing aspects of Prokhorov–Le Cam asymptotic tightness (Abuzaid, 23 May 2025). The two frameworks address different objects—random metric spaces in one case, probability measures on metric spaces in the other—but both make compactness accessible through sequential approximation.

1. Sequential gluing in inhomogeneous continuum random trees

A deterministic stick-breaking construction of an $\mathbb R$-tree begins with two sequences,

$$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$

satisfying

$0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$

and

$0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$

One builds inductively metrics $d_n$ on $[0,y_n]$ by declaring for $0\le x\le y\le y_n$: $d_0(0,0)=0,$ and for $n\ge 1$,

$\mathbb R$0

$\mathbb R$1

and

$\mathbb R$2

These metrics are consistent, so they patch to a metric $\mathbb R$3 on $\mathbb R$4, and the $\mathbb R$5-tree $\mathbb R$6 is the completion of $\mathbb R$7 (Blanc-Renaudie, 2020).

For the $\mathbb R$8-ICRT, the pair $\mathbb R$9 is random. Given a parameter vector

$$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$0

one samples independent $$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$1 random variables $$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$2, defines

$$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$3

lets $$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$4 be the atoms of a Poisson point process on $$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$5 with rate $$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$6, and, given each $$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$7, chooses $$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$8 independently with law

$$y=(y_0,y_1,y_2,\ldots), \qquad z=(z_0,z_1,z_2,\ldots),$$9

The resulting tree is

$0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$0

Writing

$0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$1

the $0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$2-th stick has length $0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$3, is glued at height $0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$4, and carries weight $0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$5.

This construction makes compactness a genuinely sequential question: the tree is assembled incrementally, and compactness depends on whether the successive additions remain controlled in the metric completion.

2. Necessary and sufficient compactness criterion

The central compactness theorem states that the $0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$6-ICRT is almost surely compact if and only if

$0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$7

Equivalently, if $0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$8 denotes the unique solution of

$0=y_0<y_1<y_2<\cdots,\qquad y_i\to\infty,$9

then compactness is equivalent to

$0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$0

(Blanc-Renaudie, 2020).

In this setting, compactness is understood through the partial trees $0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$1 up to height $0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$2. Random compactness means that with probability $0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$3, the completed glued-tree is a compact metric space. This is non-trivial because the gluing rate $0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$4 may grow too slowly or too fast, allowing infinite “bushes” or tall spikes to develop.

The criterion is therefore a quantitative growth condition on the cumulative gluing measure. Informally, the integral condition requires $0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$5 to grow fast enough that late sticks do not produce an uncontrolled amount of new large-scale geometry. The paper identifies this condition as the necessary and sufficient compactness criterion conjectured by Aldous, Miermont and Pitman.

3. Proof strategy and the geometry of failure

The proof has two complementary directions. For sufficiency, one studies the sequence of finite-length approximations $0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$6 and shows that it is Cauchy in Hausdorff distance. Using Lemma 6.2, one proves for large $0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$7 that

$0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$8

so the summability condition

$0=z_0\le z_1\le z_2\le\cdots,\qquad z_i\le y_i.$9

implies $d_n$0, and hence compactness follows (Blanc-Renaudie, 2020).

For necessity, the argument identifies “long” sticks—segments of length at least

$d_n$1

and shows that they accumulate in infinitely many disjoint directions unless the same series is summable. This direction uses a coupling/cutting argument akin to comparison with Lévy-tree criteria. The geometric mechanism is that persistent appearance of long fresh branches obstructs total boundedness, so completion does not yield a compact metric space.

A common source of confusion is to treat compactness here as a purely local branching property. The criterion is instead global and asymptotic: it depends on the growth of $d_n$2 over large scales, not merely on finite-dimensional marginals or on the behavior of any fixed initial segment of the construction.

4. Fractal dimensions in the compact regime

When the $d_n$3-ICRT is compact, the same growth function $d_n$4 determines several fractal dimensions. Almost surely, for the compact tree $d_n$5,

$d_n$6

where $d_n$7 denotes the packing dimension and $d_n$8 the upper box-counting, or Minkowski, dimension (Blanc-Renaudie, 2020).

If in addition

$d_n$9

then the lower Minkowski and Hausdorff dimensions also coincide, and

$[0,y_n]$0

These formulas show that compactness is not merely a topological threshold. Once compactness holds, the same asymptotic control of the gluing measure yields fine geometric information about metric covering rates and small-scale branching complexity. The paper also notes that when the $[0,y_n]$1 are random, these expressions recover known formulas for Lévy trees via $[0,y_n]$2-functions.

5. Role in continuum random tree theory

The compactness theorem confirms the conjecture of Aldous, Miermont and Pitman from 2004, which had been formulated in connection with inhomogeneous continuum random trees and their relation to Lévy trees [math/0401115]. The 2020 work proves the conjectured necessary and sufficient condition by introducing a new stick-breaking construction and comparing the resulting trees with Lévy trees (Blanc-Renaudie, 2020).

Within continuum random tree theory, the significance of the result is twofold. First, it gives a complete criterion for when the Poisson stick-breaking construction produces a compact random metric space rather than an unbounded or non-totally-bounded completion. Second, it links compactness directly to the computation of Hausdorff, packing, and Minkowski dimensions.

The source further states that this criterion yields a tool for proving convergence of discrete random trees, with given degree sequences, to universal continuum limits via the stick-breaking framework. A plausible implication is that compactness is not only a property of the limiting object but also a structural condition that stabilizes approximation schemes used in scaling-limit arguments.

6. Sequential tightness, weak precompactness, and random curves

A different development studies when a sequence $[0,y_n]$3 of probability measures on a metric space $[0,y_n]$4 admits subsequential weak limits. For $[0,y_n]$5 and $[0,y_n]$6, define

$[0,y_n]$7

The sequence is called sequentially tight if for every $[0,y_n]$8 there exists a family of compact sets $[0,y_n]$9 such that

$0\le x\le y\le y_n$0

and

$0\le x\le y\le y_n$1

is complete in the metric $0\le x\le y\le y_n$2. The main theorem is that sequential tightness implies weak precompactness, and any weak limit of a subsequence is itself tight; in fact, sequential tightness is equivalent to the usual Prokhorov–Le Cam asymptotic tightness (Abuzaid, 23 May 2025).

In the case where $0\le x\le y\le y_n$3 is a compact geodesic metric space, the same paper applies this framework to random unparametrized curves and to countable multisets of such curves. It defines annuli

$0\le x\le y\le y_n$4

the number of annulus crossings $0\le x\le y\le y_n$5 of a curve $0\le x\le y\le y_n$6, and the total number

$0\le x\le y\le y_n$7

for a curve-collection $0\le x\le y\le y_n$8. A family $0\le x\le y\le y_n$9 is called regular at $d_0(0,0)=0,$0 if for every $d_0(0,0)=0,$1,

$d_0(0,0)=0,$2

If this holds for every $d_0(0,0)=0,$3, then $d_0(0,0)=0,$4 is regular, and the generalized Aizenman–Burchard theorem states that, when $d_0(0,0)=0,$5 is compact and geodesic, $d_0(0,0)=0,$6 is weakly precompact if and only if it is regular.

This measure-theoretic notion of precompactness is distinct from almost-sure compactness of a single random metric space. The former concerns subsequential weak limits of laws; the latter concerns compactness of the realized object itself. The juxtaposition of the two theories suggests a broader organizing principle: compactness in random settings can often be reduced to scale-by-scale control of sequential approximations, whether those approximations are partial trees in Hausdorff distance or compact approximants in a space of measures or curves.