Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1506.03192

Height and contour processes of Crump-Mode-Jagers forests (I): general distribution and scaling limits in the case of short edges

Emmanuel Schertzer·Florian Simatos
View original source ↗Read source document ↗Export metadata ↓

Abstract

Crump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing individuals to live for an arbitrary duration and give birth at arbitrary times during their life-time. In this paper, we are interested in the height and contour processes encoding a general CMJ tree. We show that the one-dimensional distribution of the height process can be expressed in terms of a random transformation of the ladder height process associated with the underlying Lukasiewicz path. As an application of this result, when edges of the tree are "short" we show that, asymptotically, (1) the height process is obtained by stretching by a constant factor the height process of the associated genealogical Galton-Watson tree, (2) the contour process is obtained from the height process by a constant time change and (3) the CMJ trees converge in the sense of finite-dimensional distributions.

Explore related subjects

math.PR

Keep this discovery

BibTeXRIS

Emmanuel Schertzer, Florian Simatos. 2015-06-10. Height and contour processes of Crump-Mode-Jagers forests (I): general distribution and scaling limits in the case of short edges. https://arxiv.org/abs/1506.03192

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗