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.
机构:
Nanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing 210016, Peoples R ChinaNanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing 210016, Peoples R China
Xu, Kexiang
Feng, Lihua
论文数: 0引用数: 0
h-index: 0
机构:
Cent South Univ, Dept Math, Changsha, Hunan, Peoples R China
Shandong Inst Business & Technol, Sch Math, Yantai, Peoples R ChinaNanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing 210016, Peoples R China
机构:
Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China
Cent China Normal Univ, Hubei Key Lab Math Sci, Wuhan 430079, Hubei, Peoples R ChinaCent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China
Hu, Xiaolan
Chen, Yaojun
论文数: 0引用数: 0
h-index: 0
机构:
Nanjing Univ, Dept Math, Nanjing 210093, Jiangsu, Peoples R ChinaCent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China