SearcharxivSearch

arXiv · 2512.15500

Ancestral diversity in fragmentation trees

Abstract

In a deterministic or random tree, a notion of ancestral diversity can be defined as follows. Sample independently $n$ groups of $k$ leaves and count the number $N_n(k)$ of distinct most recent common ancestors of each of the groups. As $n$ becomes large, the asymptotic behavior of $N_n(k)$ depends of course on the structure of the tree. Motivated by the study of the edge density in the Brownian co-graphon, Chapuy recently considered this problem in the case where $k=2$ and where the tree is the Brownian continuum random tree. We vastly extend this framework by considering general values of $k$ and general fragmentation trees, which include some prominent examples such as stable L\'evy trees and idealized models of phylogenetic trees. Other natural ancestral statistics are also considered. For a given tree model, we identify a phase transition-like phenomenon, with different asymptotic regimes for $N_k(n)$, depending on the position of $k$ relative to a model-dependent critical value.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bénédicte Haas, Grégory Miermont. 2025-12-17. Ancestral diversity in fragmentation trees. https://arxiv.org/abs/2512.15500

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