Cutting resilient networks - complete binary trees

被引：0

作者：

Cai, Xing Shi ^{[1
]}

Holmgren, Cecilia ^{[1
]}

机构：

[1] Uppsala Univ, Dept Math, Uppsala, Sweden

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2019年 / 26卷 / 04期

基金：

瑞典研究理事会;

关键词：

complete binary tree; infinitely divisible distributions; stable distributions; cuttings of trees; RANDOM RECORDS; NUMBER;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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].

引用

页数：28

共 50 条

[1] EMBEDDING COMPLETE BINARY-TREES INTO BUTTERFLY NETWORKS
GUPTA, AK
HAMBRUSCH, SE
IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (07) : 853 - 863
[2] Constructing Complete Binary Trees on Petersen-Torus Networks
Jung-hyun, Seo
HyeongOk, Lee
Moon-suk, Jang
THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 2, PROCEEDINGS, 2008, : 252 - +
[3] On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
Fang, WC
Hsu, CC
Wang, CM
INFORMATION SCIENCES, 2003, 151 : 51 - 70
[4] Dense edge-disjoint embedding of complete binary trees in interconnection networks
Ravindran, S
Gibbons, AM
Paterson, MS
THEORETICAL COMPUTER SCIENCE, 2000, 249 (02) : 325 - 342
[5] Performance of complete and nearly complete binary search trees
Tarek, Ahmed
RECENT ADVANCES ON APPLIED MATHEMATICS: PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS (MATH '08), 2008, : 98 - +
[6] Distant parents in complete binary trees
Glasby, S.P. (GlasbyS@gmail.com), 1600, Applied Probability Trust (38):
[7] The algebra of binary trees is affine complete
Arnold, Andre
Cegielski, Patrick
Grigorieff, Serge
Guessarian, Irene
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (02):
[8] The Euclidean Distortion of Complete Binary Trees
Discrete & Computational Geometry, 2002, 29 : 19 - 21
[9] ARE ALL COMPLETE BINARY TREES GRACEFUL
CAHIT, I
AMERICAN MATHEMATICAL MONTHLY, 1976, 83 (01): : 35 - 36
[10] The Euclidean distortion of complete binary trees
Linial, N
Saks, M
DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 29 (01) : 19 - 21

← 1 2 3 4 5 →