35 citations · 123 across the 21 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.PR2018★ 5 cited
Cutting resilient networks -- complete binary trees
Xing Shi Cai, Cecilia Holmgren
In our previous work, we introduced the random -cut number for rooted graphs. In this paper, we show that the distribution of the -cut number in complete binary trees of size…
math.PR2018★ 7 cited
K-cut on paths and some trees
Xing Shi Cai, Luc Devroye, Cecilia Holmgren +1
We define the (random) -cut number of a rooted graph to model the difficulty of the destruction of a resilient network. The process is as the cut model of Meir and Moon except n…