The height of increasing trees
Copyright policy )The height of increasing trees
AbstractWe extend results about heights of random trees (Devroye, JACM33 (1986) 489–498, SIAM J COMP28 (1998) 409–432). In this paper, a general split tree model is considered in which the normalized subtree sizes of nodes converge in distribution. The height of these trees is shown to be in probability asymptotic toclognfor some constantc. We apply our results to obtain a law of large numbers for the height of all polynomial varieties of increasing trees (Bergeron et al. Lect Notes Comput Sci(1992) 24–48).© 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], increasing tree, Random graphs (graph-theoretic aspects), probabilistic analysis, random tree, Trees, height, branching process
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], increasing tree, Random graphs (graph-theoretic aspects), probabilistic analysis, random tree, Trees, height, branching process
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).22 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!