SearcharxivSearch

arXiv · 2605.11264

Uniform sampling of multitype continuous-time Bienaym\'e-Galton-Watson trees

Abstract

We study the genealogy of a sample of $k$ individuals taken uniformly without replacement from a continuous-time multitype Bienaym\'e--Galton--Watson process at fixed times. Our results are quite general, requiring only that the process be non-simple and conservative, and that every type has a positive probability to ``eventually lead to'' all other types within the population. The corresponding single-type case has recently been studied by Johnston (2019), Harris, Johnston, and Roberts (2020), and Harris, Johnston, and Pardo (2024). Our approach is based on a $k$-spine decomposition and a suitable change of measure under which the distinguished spines form a uniform sample at time $T$, while the population size is subject to $k$-size biasing and exponential discounting. This construction preserves a branching Markov property and yields an explicit description of the genealogical tree at fixed times. In particular, we characterise spine splitting times, offspring distributions, and type-dependent ancestral structures, revealing rich interactions between types that are absent in the single-type setting. The present results form the basis of a forthcoming series of papers in which limiting genealogical behaviour is analysed under various asymptotic regimes and more general sampling schemes by the authors, see Angtuncio et al. (2026b), (2026c) and (2026d).

Explore related subjects

Keep this discovery

BibTeXRIS

Osvaldo Angtuncio Hernández, Juan Carlos Pardo, Simon C. Harris. 2026-05-11. Uniform sampling of multitype continuous-time Bienaym\'e-Galton-Watson trees. https://arxiv.org/abs/2605.11264

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