On tail bounds for random recursive trees

Details On tail bounds for random recursive trees On tail bounds for random recursive trees

2011-06-20

arxiv.org/abs/1106.3865v1

Mathematics

Probability

Scientific paper

We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the Laplace transform. The problem is traced back to the corresponding problem for binary search trees by stochastic domination. The result obtained is applied to the internal path length and Wiener index of random b-ary recursive trees with weighted edges and random linear recursive trees. Finally, lower tail bounds for the Wiener index of these trees are given.

Affiliated with

Also associated with

No associations

Rating

On tail bounds for random recursive trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On tail bounds for random recursive trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On tail bounds for random recursive trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-255007