Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees (Q2363114): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 17:53, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees |
scientific article |
Statements
Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees (English)
0 references
13 July 2017
0 references
Summary: We study fringe subtrees of random \(m\)-ary search trees and of preferential attachment trees, by putting them in the context of generalised Pólya urns. In particular we show that for the random \(m\)-ary search trees with \( m\leq 26 \) and for the linear preferential attachment trees, the number of fringe subtrees that are isomorphic to an arbitrary fixed tree \(T\) converges to a normal distribution; more generally, we also prove multivariate normal distribution results for random vectors of such numbers for different fringe subtrees. Furthermore, we show that the number of protected nodes in random \(m\)-ary search trees for \(m\leq 26\) has asymptotically a normal distribution.
0 references
random trees
0 references
fringe trees
0 references
normal limit laws
0 references
Pólya urns
0 references
\(m\)-ary search trees
0 references
preferential attachment trees
0 references
protected nodes
0 references