Abstract
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 (J. Austral. Math. Soc.11, 1970) 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference26 articles.
1. [6] Berzunza, G. , Cai, X. S. and Holmgren, C. (2019). The k -cut model in deterministic and random trees. Preprint. Available at https://arxiv.org/abs/1907.02770.
2. Transversals in Trees
3. A weakly 1-stable distribution for the number of random records and cuttings in split trees