License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.AofA.2022.3
URN: urn:nbn:de:0030-drops-160898
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16089/
Go to the corresponding LIPIcs Volume Portal

Berzunza Ojeda, Gabriel ; Holmgren, Cecilia

Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees

pdf-format:
LIPIcs-AofA-2022-3.pdf (0.8 MB)

Abstract

We study the fragmentation process obtained by deleting randomly chosen edges from a critical Galton-Watson tree ?_n conditioned on having n vertices, whose offspring distribution belongs to the domain of attraction of a stable law of index α ∈ (1,2]. This fragmentation process is analogous to that introduced in the works of Aldous, Evans and Pitman (1998), who considered the case of Cayley trees. Our main result establishes that, after rescaling, the fragmentation process of ?_n converges as n → ∞ to the fragmentation process obtained by cutting-down proportional to the length on the skeleton of an α-stable Lévy tree of index α ∈ (1,2]. We further establish that the latter can be constructed by considering the partitions of the unit interval induced by the normalized α-stable Lévy excursion with a deterministic drift studied by Miermont (2001). In particular, this extends the result of Bertoin (2000) on the fragmentation process of the Brownian CRT.

BibTeX - Entry

@InProceedings{berzunzaojeda_et_al:LIPIcs.AofA.2022.3,
  author =	{Berzunza Ojeda, Gabriel and Holmgren, Cecilia},
  title =	{{Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees}},
  booktitle =	{33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
  pages =	{3:1--3:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-230-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{225},
  editor =	{Ward, Mark Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16089},
  URN =		{urn:nbn:de:0030-drops-160898},
  doi =		{10.4230/LIPIcs.AofA.2022.3},
  annote =	{Keywords: Additive coalescent, fragmentation, Galton-Watson trees, spectrally positive stable L\'{e}vy processes, stable L\'{e}vy tree, Prim’s algorithm}
}

Keywords: Additive coalescent, fragmentation, Galton-Watson trees, spectrally positive stable Lévy processes, stable Lévy tree, Prim’s algorithm
Collection: 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)
Issue Date: 2022
Date of publication: 08.06.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI