Hostname: page-component-6bf8c574d5-n2sc8 Total loading time: 0 Render date: 2025-03-06T21:56:19.075Z Has data issue: false hasContentIssue false
  • English
  • Français

Weak convergence of the number of vertices at intermediate levels of random recursive trees

Part of: Combinatorial probability Stochastic processes Markov processes Limit theorems

Published online by Cambridge University Press:  16 January 2019

Alexander Iksanov  and
Zakhar Kabluchko
Alexander Iksanov*
Affiliation:
Taras Shevchenko National University of Kyiv
Zakhar Kabluchko*
Affiliation:
Westfälische Wilhelms-Universität Münster
*
* Postal address: Faculty of Computer Science and Cybernetics, Taras Shevchenko National University of Kyiv, 01601 Kyiv, Ukraine. Email address: [email protected]
** Postal address: Institut für Mathematische Statistik, Westfälische Wilhelms-Universität Münster, 48149 Münster, Germany. Email address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Let Xn(k) be the number of vertices at level k in a random recursive tree with n+1 vertices. We are interested in the asymptotic behavior of Xn(k) for intermediate levels k=kn satisfying kn→∞ and kn=o(logn) as n→∞. In particular, we prove weak convergence of finite-dimensional distributions for the process (Xn ([knu]))u>0, properly normalized and centered, as n→∞. The limit is a centered Gaussian process with covariance (u,v)↦(u+v)−1. One-dimensional distributional convergence of Xn(kn), properly normalized and centered, was obtained with the help of analytic tools by Fuchs et al. (2006). In contrast, our proofs, which are probabilistic in nature, exploit a connection of our model with certain Crump–Mode–Jagers branching processes.

Keywords

Crump–Mode–Jagers branching processGaussian processintermediate levelrandom recursive treeweak convergence

MSC classification

Primary: 60F05: Central limit and other weak theorems 60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Secondary: 60G50: Sums of independent random variables; random walks 60C05: Combinatorial probability
Type
Research Papers
Information
Journal of Applied Probability , Volume 55 , Issue 4 , December 2018 , pp. 1131 - 1142
Copyright
Copyright © Applied Probability Trust 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Billingsley, P. (1968). Convergence of Probability Measures. John Wiley, New York.Google Scholar
[2]Chauvin, B., Drmota, M. and Jabbour-Hattab, J. (2001). The profile of binary search trees. Ann. Appl. Prob. 11, 1042–1062.Google Scholar
[3]Chauvin, B., Klein, T., Marckert, J.-F. and Rouault, A. (2005). Martingales and profile of binary search trees. Electron. J. Prob. 10, 420–435.Google Scholar
[4]Devroye, L. (1987). Branching processes in the analysis of the heights of trees. Acta Inform. 24, 277–298.Google Scholar
[5]Drmota, M., Janson, S.and Neininger, R. (2008). A functional limit theorem for the profile of search trees. Ann. Appl. Prob. 18, 288–333.Google Scholar
[6]Fuchs, M., Hwang, H.-K. and Neininger, R. (2006). Profiles of random trees: limit theorems for random recursive trees and binary search trees. Algorithmica 46, 367–407.Google Scholar
[7]Gut, A. (2009). Stopped Random Walks. Limit Theorems and Applications, 2nd edn. Springer, New York.Google Scholar
[8]Iksanov, A. (2013). Functional limit theorems for renewal shot noise processes with increasing response functions. Stoch. Process. Appl. 123, 1987–2010.Google Scholar
[9]Iksanov, A. (2016). Renewal Theory for Perturbed Random Walks and Similar Processes. Birkhäuser, Cham.Google Scholar
[10]Iksanov, A. and Kabluchko, Z. (2018). A functional limit theorem for the profile of random recursive trees. Electron. Commun. Prob. 23, 1–13.Google Scholar
[11]Iksanov, A., Marynych, A. and Meiners, M. (2017). Asymptotics of random processes with immigration I: scaling limits. Bernoulli 23, 1233–1278.Google Scholar
[12]Kabluchko, Z., Marynych, A. and Sulzbach, H. (2017). General Edgeworth expansions with applications to profiles of random trees. Ann. Appl. Prob. 27, 3478–3524.Google Scholar
[13]Pittel, B. (1994). Note on the heights of random recursive trees and random $m$-ary search trees. Random Structures Algorithms 5, 337–347.Google Scholar