Implicit Renewal Theorem for Trees with General Weights

Abstract Consider distributional fixed point equations of the form R = D f ( Q , C i , R i , 1 ≤ i ≤ N ) , where f ( ⋅ ) is a possibly random real-valued function, N ∈ { 0 , 1 , 2 , 3 , … } ∪ { ∞ } , { C i } i ∈ N are real-valued random weights and { R i } i ∈ N are iid copies of R , independent of ( Q , N , C 1 , C 2 , … ) ; = D represents equality in distribution. Fixed point equations of this type are important for solving many applied probability problems, ranging from the average case analysis of algorithms to statistical physics. We develop an Implicit Renewal Theorem that enables the characterization of the power tail behavior of the solutions R to many equations of multiplicative nature that fall into this category. This result extends the prior work in Jelenkovic and Olvera-Cravioto (2012)  [16] , which assumed nonnegative weights { C i } , to general real-valued weights. We illustrate the developed theorem by deriving the power tail asymptotics of the solution R to the linear equation R = D ∑ i = 1 N C i R i + Q .