A modification of the random cutting model

DOI10.1017/APR.2023.22MaRDI QIDQ6119935zbMATH OpenOpenAlexFDO

Authors

Publication date 20 February 2024

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.02968, https://drops.dagstuhl.de/opus/volltexte/2022/16090/

zbMATH Keywords

percolationrandom cutting modelrandom separation of graphs

Mathematics Subject Classification ID

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

Abstract: We propose a modification to the random destruction of graphs: Given a finite network with a distinguished set of sources and targets, remove (cut) vertices at random, discarding components that do not contain a source node. We investigate the number of cuts required until all targets are removed, and the size of the remaining graph. This model interpolates between the random cutting model going back to Meir and Moon and site percolation. We prove several general results, including that the size of the remaining graph is a tight family of random variables for compatible sequences of expander-type graphs, and determine limiting distributions for binary caterpillar trees and complete binary trees.

Recommendations

• Cutting resilient networks -- complete binary trees
• \(k\)-cut on paths and some trees
• k-cuts on a path
• \(k\)-cut model for the Brownian continuum random tree
• scientific article; zbMATH DE number 7703232

Cites work

• \(k\)-cut on paths and some trees
• A note on the probability of cutting a Galton-Watson tree
• A weakly 1-stable distribution for the number of random records and cuttings in split trees
• Analytic combinatorics
• Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees
• Cutting down random trees
• Cutting down trees with a Markov chainsaw
• Cutting down very simple trees
• Cutting resilient networks -- complete binary trees
• Fires on trees
• scientific article; zbMATH DE number 2127735 (Why is no real title available?)
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 2046075 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• Isolating a leaf in rooted trees via random cuttings
• Isolating nodes in recursive trees
• Multiple isolation of nodes in recursive trees
• Percolation on finite graphs and isoperimetric inequalities.
• Random cutting and records in deterministic and random trees
• Random records and cuttings in binary search trees
• The cut-tree of large trees with small heights
• Transversals in trees

Cited in

(2)

• k-cuts on a path
• Polynomial invariants for rooted trees related to their random destruction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6119935)