The cut-tree of large recursive trees

DOI10.1214/13-AIHP597zbMath1351.60010MaRDI QIDQ2346180

Jean Bertoin

Publication date: 29 May 2015

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aihp/1428672677

zbMATH Keywords

random recursive treedestruction of graphsGromov-Hausdorff-Prokhorov convergencemultiple isolation of nodes

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Trees (05C05) Strong limit theorems (60F15) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (8)

Random recursive hypergraphs ⋮ On moment sequences and mixed Poisson distributions ⋮ Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014. ⋮ Tree evolution processes for bucket increasing trees ⋮ Fires on large recursive trees ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Cutting Edges at Random in Large Recursive Trees ⋮ Inverting the cut-tree transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The cut-tree of large Galton-Watson trees and the Brownian CRT
• Cutting down trees with a Markov chainsaw
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
• Cutting down recursive trees
• Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
• Fires on trees
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• Sizes of the largest clusters for supercritical percolation on random recursive trees
• Multiple isolation of nodes in 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
• Random cutting and records in deterministic and random trees
• Cutting down very simple trees
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• Cutting down random trees
• Strong Renewal Theorems with Infinite Mean
• Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu

This page was built for publication: The cut-tree of large recursive trees