Cutting Edges at Random in Large Recursive Trees

DOI10.1007/978-3-319-11292-3_3zbMath1390.60043arXiv1406.2238OpenAlexW123973323MaRDI QIDQ5374156

Erich Baur, Jean Bertoin

Publication date: 9 April 2018

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2238

zbMATH Keywords

fluctuationsrandom recursive treesupercritical percolationdisconnectioncluster sizesdestruction of graphsisolation of nodes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

A growth-fragmentation-isolation process on random recursive trees and contact tracing ⋮ Inverting the cut-tree transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The cut-tree of large Galton-Watson trees and the Brownian CRT
• Dynamics of the evolving Bolthausen-Sznitman coalescent
• Cutting down trees with a Markov chainsaw
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• Martingales and profile of binary search trees
• Random recursive trees and the Bolthausen-Sznitman coalescent
• On the degree distribution of the nodes in increasing trees
• Isolating nodes in recursive trees
• On Ruelle's probability cascades and an abstract cavity method
• Cutting down recursive trees
• Fires on trees
• Supercritical percolation on large scale-free random trees
• The cut-tree of large recursive trees
• The vertex-cut-tree of Galton-Watson trees converging to a stable tree
• The continuum random tree. III
• On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• On the Fluctuations of the Giant Component
• 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
• Emergence of Scaling in Random Networks
• Random cutting and records in deterministic and random trees
• Cutting down very simple trees
• Random Trees
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• On tree census and the giant component in sparse random graphs
• Cutting down random trees
• Strong Renewal Theorems with Infinite Mean
• Percolation on random recursive trees

This page was built for publication: Cutting Edges at Random in Large Recursive Trees