The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
From MaRDI portal
Publication:6074697
DOI10.1002/rsa.21046zbMath1522.05413arXiv2003.12018OpenAlexW3199358134MaRDI QIDQ6074697
Gabriel Berzunza, Cecilia Holmgren
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.12018
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Novel characteristics of split trees by use of renewal theory
- The total path length of split trees
- Coalescent random forests
- On the expected height of fringe-blanced trees
- Quad trees: A data structure for retrieval by composite keys
- Supercritical percolation on large scale-free random trees
- A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Almost Giant Clusters for Percolation on Large Trees with Logarithmic Heights
- Sizes of the largest clusters for supercritical percolation on random recursive trees
- The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees
- Random Trees
- Locally balanced binary trees
- Analysis of the space of search trees under the random insertion algorithm
- Universal Limit Laws for Depths in Random Trees
- Cutting down random trees
- File structures using hashing functions
- Percolation on random recursive trees
- Probability: A Graduate Course
- Quicksort
This page was built for publication: The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
