Tail asymptotics of maximums on trees in the critical case (1609.00993v1)

Abstract: We consider solutions to the maximum recursion on weighted branching trees given by$$X\,{\buildrel d\over=}\,\bigvee_{i=1}^{N}{A_iX_i}\vee B,$$where $N$ is a random natural number, $B$ and ${A_i}{i\in\mathbb{N}}$ are random positive numbers and $X_i$ are independent copies of $X$, also independent of $N$, $B$, ${A_i}{i\in\mathbb{N}}$. Properties of solutions to this equation are governed mainly by the function $m(s)=\mathbb{E}\big[\sum_{i=1}^NA_i^s\big]$. Recently, Jelenkovi\'c and Olvera-Cravioto proved, assuming e.g. $m(s)<1$ for some $s$, that the asymptotic behavior of the endogenous solution $R$ to the above equation is power-law, i.e.$$\mathbb{P}[R>t]\sim Ct^{-\alpha}$$for some $\alpha>0$ and $C>0$. In this paper we assume $m(s)\ge 1$ for all $s$ and prove analogous results.