arXiv Analytics

Sign in

arXiv:0905.1738 [math.PR]AbstractReferencesReviewsResources

Information Ranking and Power Laws on Trees

Predrag R. Jelenkovic, Mariana Olvera-Cravioto

Published 2009-05-11, updated 2010-07-28Version 3

We study the situations when the solution to a weighted stochastic recursion has a power law tail. To this end, we develop two complementary approaches, the first one extends Goldie's (1991) implicit renewal theorem to cover recursions on trees; and the second one is based on a direct sample path large deviations analysis of weighted recursive random sums. We believe that these methods may be of independent interest in the analysis of more general weighted branching processes as well as in the analysis of algorithms.

Related articles: Most relevant | Search more
arXiv:1006.3295 [math.PR] (Published 2010-06-16, updated 2012-05-31)
Implicit Renewal Theory and Power Tails on Trees
arXiv:1012.2165 [math.PR] (Published 2010-12-10, updated 2011-10-19)
Implicit Renewal Theorem for Trees with General Weights
arXiv:2002.00634 [math.PR] (Published 2020-02-03)
Limit Theorems for Branching Processes with Immigration in a Random Environment