Open Access
2018 Tail asymptotics of maximums on trees in the critical case
Mariusz Maślanka
Electron. Commun. Probab. 23: 1-11 (2018). DOI: 10.1214/18-ECP145

Abstract

We consider the endogenous solution to the stochastic recursion \[ X\,{\buildrel \mathit {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 nonnegative numbers and $X_i$ are independent copies of $X$, independent also of $N$, $B$, $\{A_i\}_{i\in \mathbb{N} }$. The properties of solutions to this equation are governed mainly by the function $m(s)=\mathbb{E} \left [\sum _{i=1}^{N}{A_i^s}\right ]$. Recently, Jelenković and Olvera-Cravioto assuming, inter alia, $m(s)<1$ for some $s$, proved 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 prove an analogous result when $m(s)=1$ has unique solution $\alpha >0$ and $m(s)>1$ for all $s\not =\alpha $.

Citation

Download Citation

Mariusz Maślanka. "Tail asymptotics of maximums on trees in the critical case." Electron. Commun. Probab. 23 1 - 11, 2018. https://doi.org/10.1214/18-ECP145

Information

Received: 24 May 2017; Accepted: 19 June 2018; Published: 2018
First available in Project Euclid: 27 July 2018

zbMATH: 1394.60074
MathSciNet: MR3841409
Digital Object Identifier: 10.1214/18-ECP145

Subjects:
Primary: 60H25 , 60J80 , 60K05

Keywords: Branching random walk , Maximum recursion , power law distributions , Stochastic fixed point equation , weighted branching process

Back to Top