A modification of the random cutting model

DOI10.1017/apr.2023.22arXiv2111.02968OpenAlexW3208730296MaRDI QIDQ6119935

Unnamed Author

Publication date: 20 February 2024

Published in: Unnamed Author (Search for Journal in Brave)

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

zbMATH Keywords

percolationrandom cutting modelrandom separation of graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the probability of cutting a Galton-Watson tree
• Cutting down trees with a Markov chainsaw
• Isolating a leaf in rooted trees via random cuttings
• Isolating nodes in recursive trees
• Percolation on finite graphs and isoperimetric inequalities.
• Fires on trees
• Cutting resilient networks -- complete binary trees
• Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees
• \(k\)-cut on paths and some 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
• Transversals in Trees
• The cut‐tree of large trees with small heights
• Cutting down random trees

This page was built for publication: A modification of the random cutting model