‎Asymptotic analysis of weighted‎ inverse degree index in random recursive trees

Document Type : Original Article

Author
Imam Khomeini International ‎University
10.22034/mmr.2026.137809.1006
Abstract
Let $T_n$ be a random recursive tree (RRT) of size ‎$‎‎n$ ‎and ‎ $\alpha\geq 0$. We introduce and study the weighted inverse degree index ‎$‎‎‎\widetilde{I}_n(\alpha)$ on ‎$‎‎‏‏‎T_n‎$‎. Using the asymptotic
degree distribution of random recursive trees, we first ‎prove‎ an almost sure law of large numbers for $\widetilde{I}_n(\alpha)$ and obtain the explicit limiting constant ‎$‎c_{\alpha}=-e^{\alpha}
\ln\left(1-{e^{-\alpha}/2}\right)‎$‎. Then, we show that ‎$‎\operatorname{E}[\widetilde I_n(\alpha)]
=‎‏‎c‎_\alpha n+o(n)$. Also, we prove that ‎$‎\operatorname{Var}\!(‎‎‎\widetilde{I}_n(\alpha))
=\tau_\alpha^2 n+o(n)‎$‎, where $0<\tau_\alpha^2‎\leq1‎$. Finally, by applying a Doob martingale decomposition, we show the asymptotic normality
\[\widetilde{I}^*_n(\alpha)=\frac{\widetilde{I}_n(\alpha)-{E}[\widetilde{I}_n(\alpha)]}{\sqrt{n}}
\mathop{\longrightarrow}^{d}
N(0,\tau_\alpha^2).\]
For $\alpha=0$, these results reduce to the corresponding asymptotic properties of the classical inverse degree index.
Keywords
Subjects


Articles in Press, Accepted Manuscript
Available Online from 18 November 2026