Cutting down random trees
From MaRDI portal
Publication:5592944
DOI10.1017/S1446788700006698zbMath0196.27602MaRDI QIDQ5592944
Publication date: 1970
Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)
Related Items
A new combinatorial representation of the additive coalescent, The tree search game for two players, The fluctuations of the giant cluster for percolation on random split trees, Asymptotic hitting probabilities for the Bolthausen-Sznitman coalescent, Cutting Edges at Random in Large Recursive Trees, The asymptotic distribution of cluster sizes for supercritical percolation on random split trees, A modification of the random cutting model, The uncover process for random labeled trees, Models of random subtrees of a graph, On moment sequences and mixed Poisson distributions, The cut-tree of large Galton-Watson trees and the Brownian CRT, Cutting down trees with a Markov chainsaw, The total path length of split trees, Fires on large recursive trees, Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process, Cutting down recursive trees, One-sided variations on binary search trees, Fires on trees, Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey, \(k\)-cut model for the Brownian continuum random tree, The \(k\)-cut model in deterministic and random trees, Cutting resilient networks -- complete binary trees, Inverting the cut-tree transform, The cut-tree of large recursive trees, The vertex-cut-tree of Galton-Watson trees converging to a stable tree, Fringe analysis of plane trees related to cutting and pruning, Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees, \(k\)-cut on paths and some trees, The forest associated with the record process on a Lévy tree, 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
Cites Work
