Name
Abstract | ||
|---|---|---|
We investigate protected nodes in random recursive trees. The exact mean of the number of such nodes is obtained by recurrence, and a linear asymptotic equivalent follows. A nonlinear recurrence for the variance shows that the variance grows linearly, too. It follows that the number of protected nodes in a random recursive tree, upon proper scaling, converges in probability to a constant. |
Year | Venue | Keywords |
|---|---|---|
2015 | JOURNAL OF APPLIED PROBABILITY | Recursive tree, random structure, combinatorial probability |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Nonlinear system,Recursive partitioning,Random binary tree,Recursive tree,Scaling,Mathematics,Recursion | Journal | 52 |
Issue | ISSN | Citations |
1 | 0021-9002 | 2 |
PageRank | References | Authors |
0.43 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hosam M. Mahmoud | 1 | 183 | 55.63 |
| Mark Daniel Ward | 2 | 19 | 6.99 |