Cutting down random trees

DOI10.1017/S1446788700006698MaRDI QIDQ5592944zbMATH OpenFDO

Authors A. Meir, J. W. Moon

Publication date 1970

Published in Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1446788700006698

zbMATH Keywords

topology

Cites work

• On Cayley's Formula for Counting Trees

Cited in

(36)

• Sizes of the largest clusters for supercritical percolation on random recursive trees
• The total path length of split trees
• Cutting edges at random in large recursive trees
• A new combinatorial representation of the additive coalescent
• The vertex-cut-tree of Galton-Watson trees converging to a stable tree
• Inverting the cut-tree transform
• Random records and cuttings in binary search trees
• Quenched worst-case scenario for root deletion in targeted cutting of random recursive trees
• Asymptotic hitting probabilities for the Bolthausen-Sznitman coalescent
• On moment sequences and mixed Poisson distributions
• The cut-tree of large Galton-Watson trees and the Brownian CRT
• Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process
• Cutting down trees with a Markov chainsaw
• Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
• The \(k\)-cut model in deterministic and random trees
• The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
• The tree search game for two players
• The uncover process for random labeled trees
• Fires on large recursive trees
• The fluctuations of the giant cluster for percolation on random split trees
• A weakly 1-stable distribution for the number of random records and cuttings in split trees
• Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
• Models of random subtrees of a graph
• Coupling Bertoin's and Aldous-Pitman's representations of the additive coalescent
• One-sided variations on binary search trees
• \(k\)-cut model for the Brownian continuum random tree
• Cutting resilient networks -- complete binary trees
• Cutting down recursive trees
• Fringe analysis of plane trees related to cutting and pruning
• \(k\)-cut on paths and some trees
• Fires on trees
• The forest associated with the record process on a Lévy tree
• Polynomial invariants for rooted trees related to their random destruction
• The cut-tree of large recursive trees
• Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees
• A modification of the random cutting model

This page was built for publication: Cutting down random trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592944)