The fluctuations of the giant cluster for percolation on random split trees

zbMath1492.60266arXiv1902.08109MaRDI QIDQ5093986

Gabriel Hernán Berzunza Ojeda, Cecilia Holmgren, Xing Shi Cai

Publication date: 2 August 2022

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

zbMATH Keywords

fluctuationspercolationrandom treessplit treesgiant cluster

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Data structures (68P05)

Related Items (1)

Tree limits and limits of random trees

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Novel characteristics of split trees by use of renewal theory
• Dynamics of the evolving Bolthausen-Sznitman coalescent
• Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
• The total path length of split trees
• Random recursive trees and the Bolthausen-Sznitman coalescent
• On the average internal path length of m-ary search trees
• Coalescent random forests
• On the expected height of fringe-blanced trees
• Quad trees: A data structure for retrieval by composite keys
• On the analysis of stochastic divide and conquer algorithms
• Supercritical percolation on large scale-free random trees
• Cutting resilient networks -- complete binary trees
• \(k\)-cut on paths and some trees
• On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• Yule processes with rare mutation and their applications to percolation on \(b\)-ary trees
• Size and path length of Patricia tries: Dynamical sources context
• Almost Giant Clusters for Percolation on Large Trees with Logarithmic Heights
• On the normality of giant components
• Sizes of the largest clusters for supercritical percolation on random recursive trees
• A weakly 1-stable distribution for the number of random records and cuttings in split trees
• Random Records and Cuttings in Binary Search Trees
• Asymptotic normality of the size of the giant component in a random hypergraph
• The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees
• Convergence results for compound Poisson distributions and applications to the standard Luria–Delbrück distribution
• Random Trees
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• Locally balanced binary trees
• Analysis of the space of search trees under the random insertion algorithm
• Universal Limit Laws for Depths in Random Trees
• On the internal path length ofd-dimensional quad trees
• Applied Probability and Queues
• Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
• Cutting down random trees
• File structures using hashing functions
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Quicksort

This page was built for publication: The fluctuations of the giant cluster for percolation on random split trees