## Journal of Applied Probability

### On tail bounds for random recursive trees

Götz Olaf Munsonius

#### Abstract

We consider a multivariate distributional recursion of sum type, as arises 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.

#### Article information

Source
J. Appl. Probab. Volume 49, Number 2 (2012), 566-581.

Dates
First available in Project Euclid: 16 June 2012

http://projecteuclid.org/euclid.jap/1339878805

Digital Object Identifier
doi:10.1239/jap/1339878805

Mathematical Reviews number (MathSciNet)
MR2977814

Zentralblatt MATH identifier
06053730

#### Citation

Munsonius, Götz Olaf. On tail bounds for random recursive trees. J. Appl. Probab. 49 (2012), no. 2, 566--581. doi:10.1239/jap/1339878805. http://projecteuclid.org/euclid.jap/1339878805.

#### References

• Ali Khan, T. and Neininger, R. (2004). Probabilistic analysis for randomized game tree evaluation. In Mathematics and Computer Science. III, Birkhäuser, Basel, pp. 163–174.
• Ali Khan, T. and Neininger, R. (2007). Tail bounds for the Wiener index of random trees. In 2007 Conf. Analysis of Algorithms (AofA '07 Discrete Math. Theoret. Comput. Sci. Proc. AH), Assoc. Discrete Math. Theoret. Comput. Sci., Nancy, pp. 279–289.
• Bergeron, F., Flajolet, P. and Salvy, B. (1992). Varieties of increasing trees. In CAAP '92 (Rennes, 1992; Lecture Notes Comput. Sci. 581), ed. J.-C. Raoult, Springer, Berlin, pp. 24–48.
• Broutin, N. and Devroye, L. (2006). Large deviations for the weighted height of an extended class of trees. Algorithmica 46, 271–297.
• Broutin, N., Devroye, L., McLeish, E. and de la Salle, M. (2008). The height of increasing trees. Random Structures Algorithms 32, 494–518.
• Fill, J. A. and Janson, S. (2001). Approximating the limiting Quicksort distribution. Random Structures Algorithms 19, 376–406.
• Fill, J. A. and Janson, S. (2009). Precise logarithmic asymptotics for the right tails of some limit random variables for random trees. Ann. Combinatorics 12, 403–416.
• Janson, S. and Chassaing, P. (2004). The center of mass of the ISE and the Wiener index of trees. Electron. Commun. Prob. 9, 178–187.
• Knessl, C. and Szpankowski, W. (1999). Quicksort algorithm again revisited. Discrete Math. Theoret. Comput. Sci. 3, 43–64.
• Lindvall, T. (1992). Lectures on the Coupling Method. John Wiley, New York.
• McDiarmid, C. J. H. and Hayward, R. B. (1996). Large deviations for Quicksort. J. Algorithms 21, 476–507.
• Munsonius, G. O. (2010). Limit theorems for functionals of recursive trees. Doctoral Thesis, University of Freiburg, Germany. Available at http://www.freidok.uni-freiburg.de/volltexte/7472/.
• Munsonius, G. O. (2010). The total Steiner $k$-distance for $b$-ary recursive trees and linear recursive trees. In 21st Internat. Conf. Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA '10 Discrete Math. Theoret. Comput. Sci. Proc. AH), Assoc. Discrete Math. Theoret. Comput. Sci., Nancy, pp. 527–548.
• Pittel, B. (1994). Note on the heights of random recursive trees and random $m$-ary search trees. Random Structures Algorithms 5, 337–347.
• Rösler, U. (1991). A limit theorem for “Quicksort”. RAIRO Inf. Théor. Appl. 25, 85–100.
• Rüschendorf, L. and Schopp, E.-M. (2007). Exponential bounds and tails for additive random recursive sequences. Discrete Math. Theoret. Comput. Sci. 9, 333–352.