Limit distribution for the maximum degree of a random recursive tree (Q1612294): Difference between revisions
From MaRDI portal
Latest revision as of 15:19, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Limit distribution for the maximum degree of a random recursive tree |
scientific article |
Statements
Limit distribution for the maximum degree of a random recursive tree (English)
0 references
22 August 2002
0 references
Let \(k=\lfloor\ln n/\ln 2\rfloor+ d\) for a fixed integer \(d\). The authors show that the probability that the maximum in-degree of a random recursive tree with \(n\) vertices is at most \(k\) equals \[ \exp(- 2^{\{\ln n/\ln 2\}- d-1})+ o(1) \] as \(n\to\infty\), where \(\{x\}= x-\lfloor x\rfloor\).
0 references
probability
0 references
0 references