论文标题
关于一些随机树的独立数
On the independence number of some random trees
论文作者
论文摘要
我们表明，对于许多随机树的模型，独立性数除以大小几乎会随着尺寸增长到无穷大的趋势。我们考虑的树木包括随机递归树，二进制和$ M $ $的搜索树，优先附件树等。限制常数是在分析或数字上计算的，用于几个示例。该方法基于Crump-Mode-Jagers分支过程。
We show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary search trees, preferential attachment trees, and others. The limiting constant is computed, analytically or numerically, for several examples. The method is based on Crump-Mode-Jagers branching processes.
