Tail behavior of solutions of linear recursions on trees

Consider the linear nonhomogeneous fixed-point equation R=D∑i=1NCiRi+Q, where (Q,N,C1,C2,…) is a random vector with N∈{0,1,2,3,…}∪{∞},Ci≥0 for all i∈N, P(|Q|>0)>0, and {Ri}i∈N is a sequence of i.i.d. random variables independent of (Q,N,C1,C2,…) 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,C1,C2,…). This paper investigates the settings where either ZN=∑i=1NCi or Q are regularly varying with index −α t)∼Ht−α provided there exists a solution α>0 to the equation E[∑i=1N|Ci|α]=1, and both Q and ZN have lighter tails.

[1]  J. Biggins,et al.  Martingale convergence in the branching random walk , 1977, Journal of Applied Probability.

[2]  Uwe Rösler,et al.  The contraction method for recursive algorithms , 2001, Algorithmica.

[3]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[4]  C. Goldie.  IMPLICIT RENEWAL THEORY AND TAILS OF SOLUTIONS OF RANDOM EQUATIONS , 1991 .

[5]  Predrag R. Jelenkovic,et al.  Implicit Renewal Theorem for Trees with General Weights , 2010, 1012.2165.

[6]  L. Rüschendorf,et al.  A general limit theorem for recursive algorithms and combinatorial structures , 2004 .

[7]  Svante Janson,et al.  Approximating the limiting Quicksort distribution , 2001, Random Struct. Algorithms.

[8]  Gerold Alsmeyer,et al.  The functional equation of the smoothing transform , 2009, 0906.3133.

[9]  Thomas Mikosch,et al.  Large deviations and ruin probabilities for solutions to stochastic recurrence equations with heavy-tailed innovations , 2005 .

[10]  A. Brandt.  The stochastic equation Yn+1=AnYn+Bn with stationary coefficients , 1986 .

[11]  Charles M. Goldie,et al.  Perpetuities with thin tails , 1996, Advances in Applied Probability.

[12]  D. R. Grey,et al.  Regular Variation in the Tail Behaviour of Solutions of Random Difference Equations , 1994 .

[13]  P. Spreij.  Probability and Measure , 1996 .

[14]  H. Kesten.  Random difference equations and Renewal theory for products of random matrices , 1973 .

[15]  Predrag R. Jelenkovic,et al.  Implicit Renewal Theory and Power Tails on Trees , 2010, Advances in Applied Probability.

[16]  Debora Donato,et al.  Determining Factors Behind the PageRank Log-Log Plot , 2007, WAW.

[17]  Piet Van Mieghem,et al.  Distances in random graphs with finite variance degrees , 2005, Random Struct. Algorithms.

[18]  N. Litvak,et al.  Asymptotic analysis for personalized Web search , 2010, Advances in Applied Probability.

[19]  Gerold Alsmeyer,et al.  Fixed points of the smoothing transform: two-sided solutions , 2010, Probability Theory and Related Fields.

[20]  N. H. Bingham,et al.  Regular variation in more general settings , 1987 .

[21]  Mariana Olvera-Cravioto.  Asymptotics for Weighted Random Sums , 2011, Advances in Applied Probability.

[22]  Aleksander M. Iksanov.  Elementary fixed points of the BRW smoothing transforms with infinite number of summands , 2003 .

[23]  Thomas Mikosch,et al.  Regularly varying functions , 2006 .

[24]  D. Aldous,et al.  A survey of max-type recursive distributional equations , 2004, math/0401388.

[25]  Piet Van Mieghem,et al.  Three-query PCPs with perfect completeness over non-Boolean domains , 2005 .

[26]  Predrag R. Jelenkovic,et al.  Information ranking and power laws on trees , 2009, Advances in Applied Probability.

[27]  Uwe Rr Osler.  The Weighted Branching Process , 1999 .

[28]  Quansheng Liu,et al.  On generalized multiplicative cascades , 2000 .