Information ranking and power laws on trees

DOI10.1239/aap/1293113151zbMath1211.60026arXiv0905.1738OpenAlexW2963796237MaRDI QIDQ3074494

Mariana Olvera-Cravioto, Predrag R. Jelenković

Publication date: 9 February 2011

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.1738

zbMATH Keywords

regular variationlarge deviationpower lawstochastic recursionimplicit renewal theorystochastic fixed point equationweighted branching processinformation ranking

Mathematics Subject Classification ID

Random operators and equations (aspects of stochastic analysis) (60H25) Large deviations (60F10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Renewal theory (60K05)

Related Items (28)

Statistical analysis of the end-to-end delay of packet transfers in a peer-to-peer network ⋮ Implicit Renewal Theory and Power Tails on Trees ⋮ Fixed points of inhomogeneous smoothing transforms ⋮ Max-linear models in random environment ⋮ On fixed points of a generalized multidimensional affine recursion ⋮ Local weak convergence for PageRank ⋮ PageRank in Scale-Free Random Graphs ⋮ Fixed points of the smoothing transform: two-sided solutions ⋮ Maxima and sums of non-stationary random length sequences ⋮ Stochastic recursions on directed random graphs ⋮ Tail behavior of solutions of linear recursions on trees ⋮ Implicit renewal theorem for trees with general weights ⋮ Maximums on trees ⋮ Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model ⋮ PageRank on inhomogeneous random digraphs ⋮ Asymptotics for Weighted Random Sums ⋮ PageRank's behavior under degree correlations ⋮ Convergence Rates in the Implicit Renewal Theorem on Trees ⋮ Mean field analysis of personalized PageRank with implications for local graph clustering ⋮ Linear stochastic equations in the critical case ⋮ Asymptotics for randomly weighted and stopped dependent sums ⋮ Information ranking and power laws on trees ⋮ Regular variation in a fixed-point problem for single- and multi-class branching processes and queues ⋮ Convergence of the population dynamics algorithm in the Wasserstein metric ⋮ Pagerank asymptotics on directed preferential attachment networks ⋮ The Smoothing Transform: A Review of Contraction Results ⋮ Precise tail asymptotics of fixed points of the smoothing transform with general weights ⋮ Approximations for finite-time ruin probability in a dependent discrete-time risk model with CMC simulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics of randomly stopped sums in the presence of heavy tails
• Implicit renewal theory and tails of solutions of random equations
• A stochastic fixed point equation related to weighted branching with deterministic weights
• Random difference equations and renewal theory for products of random matrices
• Limit theorems for semi-Markov processes and renewal theory for Markov chains
• Subexponential asymptotics for stochastic processes: Extremal behavior, stationary distributions and first passage probabilities
• On generalized multiplicative cascades
• The contraction method for recursive algorithms
• The supremum of a negative drift random walk with dependent heavy-tailed steps.
• Tail behaviour of the busy period of a GI/GI/1 queue with subexponential service times
• Elementary fixed points of the BRW smoothing transforms with infinite number of summands
• On weighted branching processes in random environment.
• Tail Asymptotics for the Busy Period in the GI/G/1 Queue
• Approximating the limiting Quicksort distribution
• Information ranking and power laws on trees
• Authoritative sources in a hyperlinked environment
• Modulated Branching Processes, Origins of Power Laws, and Queueing Duality
• Asymptotic analysis for personalized Web search
• The stochastic equation Y_n+1=A_nY_n + B_n with stationary coefficients
• On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1
• On the Asymptotic Behavior of One-Sided Large Deviation Probabilities
• Fixed points of a generalized smoothing transformation and applications to the branching random walk
• Convergence conditions for weighted branching processes
• Applied Probability and Queues
• Determining Factors Behind the PageRank Log-Log Plot
• Large Deviations of Square Root Insensitive Random Sums
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?
• Regularly varying functions
• Estimates for the distribution of sums and maxima of sums of random variables without the Cramér condition

This page was built for publication: Information ranking and power laws on trees