Tail behavior of solutions of linear recursions on trees

Details Tail behavior of solutions of linear recursions on trees Tail behavior of solutions of linear recursions on trees

2011-08-18

arxiv.org/abs/1108.3809v1

Mathematics

Probability

Scientific paper

Consider the linear nonhomogeneous fixed point equation R =_d sum_{i=1}^N C_i R_i + Q, where (Q,N,C_1,...,C_N) is a random vector with N in{0,1,2,3,...}U{infty}, {C_i}_{i=1}^N >= 0, P(|Q|>0) > 0, and {R_i}_{i=1}^N is a sequence of i.i.d. random variables independent of (Q,N,C_1,...,C_N) having the same distribution as R. It is known that R will have a heavy-tailed distribution under several different sets of assumptions on the vector (Q,N,C_1,...,C_N). This paper investigates the settings where either Z_N = sum_{i=1}^N C_i or Q are regularly varying with index -alpha < -1 and E[sum_{i=1}^N C_i^alpha] < 1. This work complements previous results showing that P(R>t) Ht^{-alpha} provided there exists a solution alpha > 0 to the equation E[sum_{i=1}^N|C_i|^alpha] = 1, and both Q and Z_N have lighter tails.

Affiliated with

Also associated with

No associations

Rating

Tail behavior of solutions of linear recursions on trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tail behavior of solutions of linear recursions on trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tail behavior of solutions of linear recursions on trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-181763