SearcharxivSearch

arXiv · 1803.05421

Totally Ordered Measured Trees and Splitting Trees with Infinite Variation II: Prolific Skeleton Decomposition

Abstract

The first part of this paper ( arXiv:1607.02114 ) introduced splitting trees, those chronological trees admitting the self-similarity property where individuals give birth, at constant rate, to iid copies of themselves. It also established the intimate relationship between splitting trees and L\'evy processes. The chronological trees involved were formalized as Totally Ordered Measured (TOM) trees. The aim of this paper is to continue this line of research in two directions: we first decompose locally compact TOM trees in terms of their prolific skeleton (consisting of its infinite lines of descent). When applied to splitting trees, this implies the construction of the supercritical ones (which are locally compact) in terms of the subcritical ones (which are compact) grafted onto a Yule tree (which corresponds to the prolific skeleton). As a second (related) direction, we study the genealogical tree associated to our chronological construction. This is done through the technology of the height process introduced by Duquesne and Le Gall. In particular we prove a Ray-Knight type theorem which extends the one for (sub)critical L\'evy trees to the supercritical case.

Explore related subjects

Keep this discovery

BibTeXRIS

Amaury Lambert, Gerónimo Uribe Bravo. 2018-03-14. Totally Ordered Measured Trees and Splitting Trees with Infinite Variation II: Prolific Skeleton Decomposition. https://doi.org/10.30757/alea.v21-49

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