Tail asymptotics of maximums on trees in the critical case

Abstract: We consider solutions to the maximum recursion on weighted branching trees given by

X,{�uildrel dover=},�igvee_{i=1}^{N}{A_iX_i}vee B,

where

N

is a random natural number,

B

and

{A_{i}}_{i i n m a t h b b N}

are random positive numbers and

X_{i}

are independent copies of

X

, also independent of

N

,

B

,

{A_{i}}_{i i n m a t h b b N}

. Properties of solutions to this equation are governed mainly by the function

. 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

a l p h a > 0

and

C > 0

. In this paper we assume

m (s) g e 1

for all

s

and prove analogous results.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: Tail asymptotics of maximums on trees in the critical case