Cutting resilient networks -- complete binary trees

zbMath1427.60017arXiv1811.05673MaRDI QIDQ2278120

Cecilia Holmgren, Xing Shi Cai

Publication date: 9 December 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Combinatorial probability (60C05)

Related Items (5)

\(k\)-cut on paths and some trees ⋮ 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 ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Cutting down trees with a Markov chainsaw
• Cutting down recursive trees
• \(k\)-cuts on a path
• \(k\)-cut on paths and some 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
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• A note on the asymptotic expansion of the Lerch's transcendent
• Cutting down random trees
• Probability

This page was built for publication: Cutting resilient networks -- complete binary trees