Percolation on random recursive trees
From MaRDI portal
Publication:5740270
DOI10.1002/rsa.20603zbMath1341.05226arXiv1407.2508OpenAlexW3102775616MaRDI QIDQ5740270
Publication date: 25 July 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.2508
Related Items (5)
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees ⋮ Cutting Edges at Random in Large Recursive Trees ⋮ The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey ⋮ Weak limits for the largest subpopulations in Yule processes with high mutation probabilities
Cites Work
- The cut-tree of large Galton-Watson trees and the Brownian CRT
- A limit theorem for trees of alleles in branching processes with rare neutral mutations
- Coalescent random forests
- Cutting down recursive trees
- Supercritical percolation on large scale-free random trees
- The vertex-cut-tree of Galton-Watson trees converging to a stable tree
- A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
- Almost Giant Clusters for Percolation on Large Trees with Logarithmic Heights
- Random Trees
- A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
- The Asymptotic Distribution of Maximum Tree Size in a Random Forest
- Unnamed Item
This page was built for publication: Percolation on random recursive trees