The size of random fragmentation trees

DOI10.1007/s00440-007-0110-1zbMath1158.60044arXivmath/0609350OpenAlexW2592489754MaRDI QIDQ946483

Ralph Neininger, Svante Janson

Publication date: 23 September 2008

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0609350

zbMATH Keywords

Laplace transformasymptotic normalitycontraction methodrenewal equationrandom treesfragmentation process

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Data structures (68P05)

Related Items (11)

Solutions to complex smoothing equations ⋮ Normal limiting distribution of the size of binary interval trees ⋮ Moments of a non‐homogenous bi‐variate fragmentation process using integral equations tools ⋮ Limit theorems for discrete multitype branching processes counted with a characteristic ⋮ Benford's law and continuous dependent random variables ⋮ Analytic and numerical analysis of some statistical features of fragmentation processes ⋮ The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees ⋮ On the number of large triangles in the Brownian triangulation and fragmentation processes ⋮ Dependence and phase changes in random m‐ary search trees ⋮ Self-similar real trees defined as fixed points and their geometric properties ⋮ On a functional contraction method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rounding of continuous random variables and oscillatory asymptotics
• Recursive partition structures
• Splitting intervals. II: Limit laws for lengths
• Random sequential bisection and its associated binary tree
• Some asymptotic theory for the bootstrap
• On the invariance principle for sums of independent identically distributed random variables
• A general limit theorem for recursive algorithms and combinatorial structures
• A characterization of the set of fixed points of the quicksort transformation
• Asymptotic laws for nonconservative self-similar fragmentations
• The contraction method for recursive algorithms
• Counting intervals in the packing process
• Paths in \(m\)-ary interval trees
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Phase changes in randomm-ary search trees and generalized quicksort
• Phase changes in random point quadtrees
• Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces
• Ideal Metrics in the Problem of Approximating Distributions of Sums of Independent Random Variables
• Analysis of the space of search trees under the random insertion algorithm
• Universal Limit Laws for Depths in Random Trees
• m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
• One-sided variations on interval trees
• Stable distributions in stochastic fragmentation
• Phase transition in a random fragmentation problem with applications to computer science
• Transfer theorems and asymptotic distributional results for m‐ary search trees
• Random Fragmentation and Coagulation Processes
• Splitting intervals

This page was built for publication: The size of random fragmentation trees