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

(37)

• 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
• On moment sequences and mixed Poisson distributions
• The cut-tree of large Galton-Watson trees and the Brownian CRT
• A new combinatorial representation of the additive coalescent
• Cutting down trees with a Markov chainsaw
• 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
• Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
• Coupling Bertoin's and Aldous-Pitman's representations of the additive coalescent
• Polynomial invariants for rooted trees related to their random destruction
• The total path length of split trees
• Quenched worst-case scenario for root deletion in targeted cutting of random recursive trees
• Size distribution of clusters in site-percolation on random recursive tree
• Fires on large recursive trees
• Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process

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)