The size of random fragmentation trees

2006/09/13 by Svante Janson, Janson, S., Ralph Neininger +1 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics (math.CO) #Data Management and Algorithms #FOS: Mathematics #Probability (math.PR) #Stochastic processes and statistical mechanics #Theoretical and Computational Physics

paper · pdf · doi:10.48550/arxiv.math/0609350

openalex publication_date 2006/09/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is asymptotically normal in some cases but not in others, depending on the position of roots of a certain characteristic equation. This parallels the behaviour of discrete analogues with various random trees that have been studied in computer science. We give rigorous proofs of this phase transition, and add further details. The proof uses the contraction method. We extend some previous results for recursive sequences of random variables to families of random variables with a continuous parameter; we believe that this extension has independent interest.

Citations

• Scale invariance and lack of self-averaging in fragmentation

Cited by

• Rates of convergence for extremal spacings in Kakutani's random interval-splitting process
• A Simpler Proof of Kakutani's Conjecture on Random Subdivision and Its Generalizations

Related

• A phase transition for the heights of a fragmentation tree
• A tightness criterion for fragmentations
• A growth-fragmentation-isolation process on random recursive trees and contact tracing
• General Fragmentation Trees
• The genealogy of self-similar fragmentations with negative index as a continuum random tree