A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees

被引:4
|
作者
Fuchs, Michael [1 ]
Holmgren, Cecilia [2 ]
Mitsche, Dieter [3 ]
Neininger, Ralph [4 ]
机构
[1] Natl Chengchi Univ, Dept Math Sci, Taipei, Taiwan
[2] Uppsala Univ, Dept Math, Uppsala, Sweden
[3] Univ Lyon, Univ Jean Monnet, Inst Camille Jordan UMR 5208, Lyon, France
[4] Goethe Univ Frankfurt, Inst Math, Frankfurt, Germany
关键词
Independence number; Domination number; Clique cover number; Random recursive trees; Random binary search trees; Fringe trees; Central limit laws; LIMIT LAWS; ALGORITHMS; SETS;
D O I
10.1016/j.dam.2020.12.013
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We identify the mean growth of the independence number of random binary search trees and random recursive trees and show normal fluctuations around their means. Similarly we also show normal limit laws for the domination number and variations of it for these two cases of random tree models. Our results are an application of a recent general theorem of Holmgren and Janson on fringe trees in these two random tree models. (C) 2020 Published by Elsevier B.V.
引用
收藏
页码:64 / 71
页数:8
相关论文
共 50 条
  • [31] A Note on the Paired-Domination Subdivision Number of Trees
    Qiang, Xiaoli
    Kosari, Saeed
    Shao, Zehui
    Sheikholeslami, Seyed Mahmoud
    Chellali, Mustapha
    Karami, Hossein
    MATHEMATICS, 2021, 9 (02) : 1 - 9
  • [32] A note on the locating-total domination number in trees
    Rad, Nader Jafari
    Rahbani, Hadi
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2016, 66 : 420 - 424
  • [33] Simple Random Sampling of Binary Forests with Fixed Number of Nodes and Trees
    Dimitrov, Stoyan
    COMBINATORIAL ALGORITHMS, IWOCA 2024, 2024, 14764 : 43 - 54
  • [34] Distances and finger search in random binary search trees
    Devroye, L
    Neininger, R
    SIAM JOURNAL ON COMPUTING, 2004, 33 (03) : 647 - 658
  • [35] ON THE GENERATION OF RANDOM BINARY SEARCH-TREES
    DEVROYE, L
    ROBSON, JM
    SIAM JOURNAL ON COMPUTING, 1995, 24 (06) : 1141 - 1156
  • [36] On Weighted Depths in Random Binary Search Trees
    Aguech, Rafik
    Amri, Anis
    Sulzbach, Henning
    JOURNAL OF THEORETICAL PROBABILITY, 2018, 31 (04) : 1929 - 1951
  • [37] Distribution of distances in random binary search trees
    Mahmoud, HM
    Neininger, R
    ANNALS OF APPLIED PROBABILITY, 2003, 13 (01): : 253 - 276
  • [38] Maximal clades in random binary search trees
    Janson, Svante
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
  • [39] On Weighted Depths in Random Binary Search Trees
    Rafik Aguech
    Anis Amri
    Henning Sulzbach
    Journal of Theoretical Probability, 2018, 31 : 1929 - 1951
  • [40] Random Records and Cuttings in Binary Search Trees
    Holmgren, Cecilia
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (03): : 391 - 424