SearcharxivSearch

arXiv · 1805.12057

The Aldous chain on cladograms in the diffusion limit

Abstract

In [Ald00], Aldous investigates a symmetric Markov chain on cladograms and gives bounds on its mixing and relaxation times. The latter bound was sharpened in [Sch02]. In the present paper we encode cladograms as binary, algebraic measure trees and show that this Markov chain on cladograms with fixed number of leaves converges in distribution as the number of leaves goes to infinity. We give a rigorous construction of the limit, whose existence was conjectured by Aldous and which we therefore refer to as Aldous diffusion, as a solution of a well-posed martingale problem. We show that the Aldous diffusion is a Feller process with continuous paths, and the algebraic measure Brownian CRT is its unique invariant distribution. Furthermore, we consider the vector of the masses of the three subtrees connected to a sampled branch point. In the Brownian CRT, its annealed law is known to be the Dirichlet distribution. Here, we give an explicit expression for the infinitesimal evolution of its quenched law under the Aldous diffusion.

Explore related subjects

Keep this discovery

BibTeXRIS

Wolfgang Löhr, Leonid Mytnik, Anita Winter. 2018-05-30. The Aldous chain on cladograms in the diffusion limit. https://doi.org/10.1214/20-aop1431

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