Sizes of the largest clusters for supercritical percolation on random recursive trees
Author:
- 17 July 2012
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 44 (1) , 29-44
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- A weakly 1-stable distribution for the number of random records and cuttings in split treesAdvances in Applied Probability, 2011
- Random Records and Cuttings in Binary Search TreesCombinatorics, Probability and Computing, 2010
- A limiting distribution for the number of cuts needed to isolate the root of a random recursive treeRandom Structures & Algorithms, 2008
- A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive treeElectronic Communications in Probability, 2007
- Random cutting and records in deterministic and random treesRandom Structures & Algorithms, 2005
- Random Recursive Trees and the Bolthausen-Sznitman CoalesentElectronic Journal of Probability, 2005
- Percolation1999
- The standard additive coalescentThe Annals of Probability, 1998
- Cutting down recursive treesMathematical Biosciences, 1974
- Cutting down random treesJournal of the Australian Mathematical Society, 1970