Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 15 Oct 2020 in math.PR | (2010.07880v3)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.