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.
Kazemi, R. (2026). Asymptotic analysis of weighted inverse degree index in random recursive trees. (e11984). Mathematical Research, (), e11984 https://doi.org/10.22034/mmr.2026.137809.1006
MLA
Kazemi, R. "Asymptotic analysis of weighted inverse degree index in random recursive trees" .e11984 , Mathematical Research, , 2026, e11984. doi: 10.22034/mmr.2026.137809.1006
HARVARD
Kazemi, R. (2026). 'Asymptotic analysis of weighted inverse degree index in random recursive trees', Mathematical Research, (), e11984. doi: 10.22034/mmr.2026.137809.1006
CHICAGO
Kazemi, R., "Asymptotic analysis of weighted inverse degree index in random recursive trees." Mathematical Research, (2026): e11984, doi: 10.22034/mmr.2026.137809.1006
VANCOUVER
Kazemi R. Asymptotic analysis of weighted inverse degree index in random recursive trees. Mathematical Research. 2026;():e11984 (In Persian). doi: 10.22034/mmr.2026.137809.1006