Name
Abstract | ||
|---|---|---|
In this paper we provide a simple formula for the expected time for a random recursive tree to grow to a given height. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1017/S0963548308009486 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
expected time,random recursive tree,simple formula,hitting time | Discrete mathematics,Loop-erased random walk,Combinatorics,Random graph,Recursive partitioning,Random binary tree,Hitting time,Recursive tree,Mathematics,Interval tree | Journal |
Volume | Issue | ISSN |
17 | 6 | 0963-5483 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas M. Lewis | 1 | 3 | 1.70 |
| LewisThomas m. | 2 | 0 | 0.34 |