\(k\)-cut on paths and some trees

DOI10.1214/19-EJP318zbMath1455.60018arXiv1804.03069OpenAlexW2914483255MaRDI QIDQ2423460

Cecilia Holmgren, Xing Shi Cai, Fiona Skerman, Luc P. Devroye

Publication date: 20 June 2019

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

cuttingrandom trees\(k\)-cut

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (6)

A modification of the random cutting model ⋮ The \(k\)-cut model in deterministic and random trees ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Cutting resilient networks -- complete binary 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

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representations and inequalities for generalized hypergeometric functions
• Novel characteristics of split trees by use of renewal theory
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Cutting down trees with a Markov chainsaw
• Profiles of random trees: Limit theorems for random recursive trees and binary search trees
• Cutting down recursive trees
• Cutting resilient networks -- complete binary trees
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• 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
• Random Trees
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• Universal Limit Laws for Depths in Random Trees
• Inversions in Split Trees and Conditional Galton–Watson Trees
• Cutting down random trees
• Probability
• Graph colouring and the probabilistic method

This page was built for publication: \(k\)-cut on paths and some trees