A tightness criterion for fragmentations
Abstract
This note presents a simple criterion for the tightness of stochastic fragmentation processes. Our work is motivated by an application to a fragmentation process derived from deleting edges in a conditioned Galton-Watson tree studied by Berzunza-Ojeda and Holmgren (2023). In that paper, while finite-dimensional convergence was established, the claimed functional convergence relied on Lemma 22 of Broutin and Marckert (2016), which is unfortunately incorrect. We show how our results can correct the proof of Berzunza-Ojeda and Holmgren (2023). Furthermore, we show the applicability of our results by establishing tightness for fragmentation processes derived from various random tree models previously studied in the literature, such as Cayley trees, trees with specified degree sequences, and p-trees.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.