Abstract
We study fringe subtrees of random -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 -ary search trees with and for the linear preferential attachment trees, the number of fringe subtrees that are isomorphic to an arbitrary fixed tree 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 -ary search trees for has asymptotically a normal distribution.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.