Affordable Access

Access to the full text

Cutting resilient networks - complete binary trees

Authors
  • Cai, Xing Shi
  • Holmgren, Cecilia
Publication Date
Jan 01, 2019
Identifiers
DOI: 10.37236/8350
OAI: oai:DiVA.org:uu-403240
Source
DiVA - Academic Archive On-line
Keywords
Language
English
License
Green
External links

Abstract

In our previous work [2, 3], we introduced the random k-cut number for rooted graphs. In this paper, we show that the distribution of the k-cut number in complete binary trees of size n, after rescaling, is asymptotically a periodic function of lg n - lg lg n. Thus there are different limit distributions for different subsequences, where these limits are similar to weakly 1-stable distributions. This generalizes the result for the case k = 1, i.e., the traditional cutting model, by Janson [12].

Report this publication

Statistics

Seen <100 times