Stable random trees

Aggregate of the stable-tree layer, for an index 1 < θ ≤ 2:

• scalar stable attraction of offspring laws: lattice local limits, density identification, regular variation of the normalizer, maximal tightness, forest estimates and admissible-size bounds, with the finite-variance instance at index two;
• the spectrally positive θ-stable law and Lévy process (on D T ℝ and on DLoc), the functional limit theorem for walks, fluctuation identities (first passage, Kendall, unique minimum) and the Brownian case X = √2 B;
• the reflected process X − I, its strong Markov property, Itô's excursion theorem, the excursion measure N, the normalized excursion, the Markov property under N, the Γ_a identity and Chaumont's path construction;
• the height process and its excursion height, the Duquesne–Le Gall forest theorem and the limits of trees with at least or exactly n vertices, with the identification at θ = 2;
• the stable bridge, its unique minimum, Chaumont's Vervaat identity and the largest jump of the normalized excursion;
• Marchal selection weights, the Marchal growth chain and its finite law.

CLASSICAL_THEORY_COVERAGE.md names the module of each result (items C15–C36).