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

来源：

DISCRETE APPLIED MATHEMATICS | 2021年 / 292卷

关键词：

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 条

[1] A note on the Horton-Strahler number for random binary search trees
Kruszewski, P
INFORMATION PROCESSING LETTERS, 1999, 69 (01) : 47 - 51
[2] The expectation of independent domination number over random binary trees
Lee, C
ARS COMBINATORIA, 2000, 56 : 201 - 209
[3] On the independence number of some random trees
Janson, Svante
ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2020, 25 : 1 - 14
[4] Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
Michael Fuchs
Hsien-Kuei Hwang
Ralph Neininger
Algorithmica, 2006, 46 : 367 - 407
[5] Profiles of random trees: Correlation and width of random recursive trees and binary search trees
Drmota, M
Hwang, HK
ADVANCES IN APPLIED PROBABILITY, 2005, 37 (02) : 321 - 341
[6] Profiles of random trees: Limit theorems for random recursive trees and binary search trees
Fuchs, Michael
Hwang, Hsien-Kuei
Neininger, Ralph
ALGORITHMICA, 2006, 46 (3-4) : 367 - 407
[7] Comment on "The expectation of independent domination number over random binary trees"
Clark, L. H.
McSorley, J. P.
ARS COMBINATORIA, 2008, 87 : 257 - 261
[8] On the Independence Number of Random Trees via Tricolourations
Bellin, Etienne
Leibniz International Proceedings in Informatics, LIPIcs, 2022, 225
[9] On the independence number of random trees via tricolourations
Bellin, Etienne
arXiv, 2022,
[10] NOTE ON THE HEIGHTS OF RANDOM RECURSIVE TREES AND RANDOM M-ARY SEARCH-TREES
PITTEL, B
RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (02) : 337 - 347

← 1 2 3 4 5 →