SearcharxivSearch

arXiv · 2010.07880

Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees

Abstract

Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above fragmentation process converges as $n \rightarrow \infty$ to the fragmentation process of the Brownian CRT obtained by cutting-down the Brownian CRT along its skeleton in a Poisson manner. In this work, we continue the above investigation and study the fragmentation process obtained by deleting randomly chosen edges from a critical Galton-Watson tree $\mathbf{t}_{n}$ conditioned on having $n$ vertices, whose offspring distribution belongs to the domain of attraction of a stable law of index $\alpha \in (1,2]$. Our main results establish that, after rescaling, the fragmentation process of $\mathbf{t}_{n}$ converges as $n \rightarrow \infty$ to the fragmentation process obtained by cutting-down proportional to the length on the skeleton of an $\alpha$-stable L\'evy tree of index $\alpha \in (1,2]$. We further show that the latter can be constructed by considering the partitions of the unit interval induced by the normalized $\alpha$-stable L\'evy excursion with a deterministic drift studied by Miermont (2001). This extends the result of Bertoin (2000) on the fragmentation process of the Brownian CRT.

Explore related subjects

Keep this discovery

BibTeXRIS

Gabriel Berzunza Ojeda, Cecilia Holmgren. 2020-10-15. Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees. https://arxiv.org/abs/2010.07880

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