SearcharxivSearch

arXiv · 2510.23308

The Genealogy of Conditioned Critical Galton--Watson Trees

Abstract

Let $T$ be the random family tree associated with the critical Galton--Watson process $\{Z_{n}\}_{n\geq0}$. Geiger (1999) provided an explicit representation of the law of $T$ conditioned on $\{Z_{n}>0\}$ by inductively constructing the conditioned tree $\tilde{T}_n$ along the line of descent of the left--most particle. Intuitively, $\tilde{T}_n$ is composed of a ``spine'', with a conditioned GW tree attached to each of its ``left'' siblings and an ordinary GW tree attached to each of its ``right'' siblings. The structure of the ``right'' subtree is partially discussed in Geiger (1999), whereas the information about the ``left'' subtree remains largely unexplored. In this paper we investigate the genealogy of the ``left'' and ``right'' subtrees of $\tilde{T}_n$, and some intrinsic properties will be specified, including the branching mechanism, the limiting behavior of the coalescent times, the limiting number of siblings of the spine, and the scaling limit distribution of the particles. We prove that the sequence of coalescent times of the ``right'' subtree converge in distribution to a sequence of ``nested uniform random variables'' by scaling, interestingly, so do the sequence of coalescent times for the ``left'' subtree after a functional transformation. We also establish the asymptotic independence of the two sequences of coalescent times, which in turn implies the asymptotic independence of the ``left'' and ``right'' subtrees. Finally, as an application, we present a probabilistic proof of the conditional limit theorem for the critical GW process established by Spitzer (unpublished) and Lamperti and Ney (1968), that is, for any fixed $0<t<1$, $Z_{[nt]}/n$ converges in distribution to the sum of two independent exponential random variables with different parameters, which exactly come from the ``left'' and ``right'' subtrees respectively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiayan Guo, Wenming Hong. 2025-10-27. The Genealogy of Conditioned Critical Galton--Watson Trees. https://arxiv.org/abs/2510.23308

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR