Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kesten Tree in Random Tree Theory

Updated 24 November 2025
  • Kesten tree is a continuum random tree defined by an infinite spine with independently grafted subtrees via a Poisson point process.
  • It displays self-similarity and infinite height, serving as a local limit for large, conditioned critical Galton–Watson trees.
  • Its construction through scaling limits and Poisson representations highlights its role in connecting stable Lévy trees to discrete random tree models.

The Kesten tree is a continuum random tree characterized by a distinguished infinite spine along which independent subtrees are grafted according to a Poisson point process. This object emerges as the scaling limit when zooming in at the root of a normalized stable Lévy tree and serves as the local limit for large conditioned critical Galton–Watson trees with offspring distributions in the domain of attraction of a stable law of index γ(1,2]\gamma \in (1,2] (Nassif, 2021). The Kesten tree possesses self-similarity, infinite height, and a branching structure governed by the same mechanism as the original stable tree.

1. Stable Lévy Trees and Their Scaling

Let γ(1,2]\gamma \in (1,2]. The γ\gamma-stable Lévy tree, defined under its excursion measure N\mathcal{N}, is a random compact rooted real tree (T,d,μ)(T,d,\mu) with total mass σ=μ(T)\sigma = \mu(T) and height h=supxTd(ρ,x)h = \sup_{x\in T} d(\rho,x). Their distributions satisfy

N[σda]=(γΓ(11/γ))1a11/γda,N[hda]=(γ1)γ/(γ1)aγ/(γ1)da.\mathcal{N}[\sigma \in da] = (\gamma \Gamma(1-1/\gamma))^{-1} a^{-1-1/\gamma}\,da,\quad \mathcal{N}[h \in da] = (γ-1)^{-γ/(γ-1)} a^{-γ/(γ-1)} da.

The tree exhibits self-similarity: for any a>0a>0, Rγ((T,d,μ),a):=(T,ad,aγ/(γ1)μ)R_\gamma((T,d,\mu),a) := (T, a\cdot d, a^{\gamma/(\gamma-1)}\mu). The normalized stable tree is P1:=N[σ=1]\mathbb{P}^1 := \mathcal{N}[\cdot \mid \sigma=1]. If (T,d,μ)P1(T,d,\mu)\sim\mathbb{P}^1, then scaling as

T(a):=Rγ(T,a11/γ)\mathcal{T}^{(a)} := R_\gamma(T, a^{1-1/\gamma})

produces a tree of mass aa and height a11/γha^{1-1/\gamma} h (Nassif, 2021).

2. Construction of the Unnormalized Kesten Tree

Zooming in at the root of a normalized stable tree at speed ε0\varepsilon \rightarrow 0 yields a random marked tree converging in distribution to the unnormalized Kesten tree K\mathcal{K}. For (T,d,μ)P1(T,d,\mu)\sim\mathbb{P}^1, choosing a random μ-leaf UTU \in T and examining the unique branch [ρ,U][\rho,U], the grafted subtrees {Ti,iI}\{T_i, i \in I\} have heights hih_i and masses σi\sigma_i. Define

Nε=hiεH(U)δ(ε1hi,  εγ/(γ1)σi,  Ti).\mathcal{N}_{\varepsilon} = \sum_{h_i \leq \varepsilon H(U)} \delta_{(\varepsilon^{-1} h_i,\; \varepsilon^{-\gamma/(\gamma-1)} \sigma_i,\; T_i)}.

As ε0\varepsilon \to 0 and with rescaling f(ε)=εf(\varepsilon) = \varepsilon, the random marked tree (T,H(U),Nε)(T, H(U), \mathcal{N}_{\varepsilon}) converges in the Gromov–Hausdorff–Prokhorov sense to (K,H,s0δ(s,Ts))(\mathcal{K}, H, \sum_{s\geq 0}\delta_{(s,T'_s)}), where (Ts,s0)(T'_s, s \geq 0) is a Poisson point process. Scaling distances by ε1\varepsilon^{-1} and masses by εγ/(γ1)\varepsilon^{-\gamma/(\gamma-1)}, Rγ(T,ε1)dKR_\gamma(T, \varepsilon^{-1}) \xrightarrow{d} \mathcal{K} as ε0\varepsilon \rightarrow 0 (Nassif, 2021).

3. Poisson Point Process Representation

The Kesten tree K\mathcal{K} is represented as follows:

  • Start with an infinite spine (the half-line [0,)[0,\infty), rooted at $0$).
  • Graft subtrees at times s0s \ge 0 along the spine, determined by a Poisson point process of intensity dsΠ(dT)ds \otimes \Pi(dT), where the measure Π\Pi on rooted compact trees is

Π(dT)={2N(dT)if γ=2, 0rπ(dr)P(r)(dT)if 1<γ<2,\Pi(dT) = \begin{cases} 2\mathcal{N}(dT) & \text{if } \gamma=2,\ \int_0^\infty r\,\pi(dr)\,\mathbb{P}^{(r)}(dT) & \text{if } 1<\gamma<2, \end{cases}

with π(dr)=γ(γ1)Γ(2γ)1r1γdr\pi(dr) = \gamma(\gamma-1)\Gamma(2-\gamma)^{-1} r^{-1-\gamma} dr and P(r)\mathbb{P}^{(r)} the law of the forest started from mass rr.

  • The resulting metric space has spine length measure (Lebesgue on [0,)[0,\infty)) and on each grafted subtree its intrinsic mass–measure (Nassif, 2021).

4. Main Scaling and Convergence Theorems

Let (T,d,μ)P1(T,d,\mu)\sim\mathbb{P}^1 be a normalized stable tree of index γ\gamma and UU a μ\mu-leaf. Define, for ε>0\varepsilon > 0,

T(ε)=Rγ(T,ε1),T^{(\varepsilon)} = R_\gamma(T, \varepsilon^{-1}),

and the point measure

Nε=hiεH(U)δ(ε1hi,εγ/(γ1)σi,Ti).\mathcal{N}_{\varepsilon} = \sum_{h_i \leq \varepsilon H(U)} \delta_{(\varepsilon^{-1}h_i, \varepsilon^{-\gamma/(\gamma-1)}\sigma_i, T_i)}.

As ε0\varepsilon \to 0, for any Lipschitz test function Φ\Phi,

Nε,Φs0Φ(s,μ(Ts),Ts)\langle\mathcal{N}_{\varepsilon}, \Phi\rangle \to \sum_{s \ge 0} \Phi(s, \mu(T'_s), T'_s)

in distribution. Consequently,

(T(ε),μ)ε0dK(T^{(\varepsilon)}, \mu) \xrightarrow[\varepsilon\to 0]{d} \mathcal{K}

in Gromov–Hausdorff–Prokhorov topology. In discrete terms, for normalized γ\gamma-stable trees (Tn,dn,μn)(\mathcal{T}_n, d_n, \mu_n) at mass-level nn and n1/γdnn^{1/\gamma}d_n rescaling,

(Tn,n1/γdn,μn)ndK[2103.13649].(\mathcal{T}_n, n^{1/\gamma}d_n, \mu_n) \xrightarrow[n\to\infty]{d} \mathcal{K} [2103.13649].

5. Properties of the Kesten Tree

  • Branching Mechanism: The local branching follows the same process with ψ(λ)=λγ\psi(\lambda) = \lambda^\gamma as the underlying stable tree.
  • Infinite Spine: There exists a unique geodesic ray from the root with infinite length.
  • Mass-Measure: The total mass is infinite; the measure μ\mu is σ\sigma-finite, with linear density along the spine determined by the Poisson intensity.
  • Height Distribution: The height to infinity along the spine is infinite; grafted finite trees obey the height law of N\mathcal{N}.
  • Self-Similarity: For any a>0a>0, Rγ(K,a)=daKR_\gamma(\mathcal{K}, a) \overset{d}{=} a\mathcal{K}, so K\mathcal{K} is self-similar with index 1 (Nassif, 2021).

6. Additive Functionals and Asymptotic Limits

On a compact real tree (T,d,μ)(T,d,\mu), additive functionals of the form

Zα,β(T)=Tμ(dx)0H(x)σr,xαhr,xβdrZ_{\alpha, \beta}(T) = \int_T \mu(dx) \int_0^{H(x)} \sigma_{r,x}^\alpha h_{r,x}^\beta\,dr

are of interest, where σr,x\sigma_{r,x} is the mass and hr,xh_{r,x} the height of the subtree above level rr containing xx. For the normalized tree as max(α,β)\max(\alpha,\beta)\to\infty:

  • Subcritical regime: If β/α11/γc[0,)\beta/\alpha^{1-1/\gamma} \rightarrow c \in [0,\infty),

α11/γhβZα,β(T)d0eStct/hdt,\alpha^{1-1/\gamma} h^{-\beta} Z_{\alpha, \beta}(T) \xrightarrow{d} \int_0^\infty e^{-S_t - c t/h} dt,

where (St)(S_t) is a stable subordinator with Laplace exponent γλ11/γ\gamma\lambda^{1-1/\gamma} and h=height(T)h=\operatorname{height}(T).

  • Supercritical regime: If β/α11/γ\beta/\alpha^{1-1/\gamma}\rightarrow\infty,

βhβZα,β(T)Ph.\beta h^{-\beta} Z_{\alpha,\beta}(T) \xrightarrow{\mathbb{P}} h.

The limits correspond to integrals along the infinite spine of the Kesten tree with dynamics governed by a subordinator SS (Nassif, 2021).

7. Connections with Critical Galton–Watson Trees

Critical Galton–Watson (GW) trees whose offspring distribution lies in the domain of attraction of a stable law of index γ\gamma and are conditioned to have nn vertices, converge after rescaling edge lengths by n1/γn^{-1/\gamma} to the normalized stable tree. The local limit of such GW trees seen from the root is the discrete Kesten tree. In the continuum, this yields the Kesten tree K\mathcal{K}, which emerges as the scaling limit and natural local-limit object for large conditioned GW trees. The Poisson-grafting decomposition of the Kesten tree mirrors the decomposition of a critical GW tree into subcritical forests grafted along its infinite spine (Nassif, 2021).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Kesten Tree.