Local weak convergence for PageRank

DOI10.1214/19-AAP1494zbMath1434.60027arXiv1803.06146OpenAlexW3007863691MaRDI QIDQ2180377

Nelly Litvak, Alessandro Garavaglia, Remco van der Hofstad

Publication date: 13 May 2020

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

local weak convergencedirected random graphsPageRank

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20)

Related Items (11)

Strong couplings for static locally tree-like random graphs ⋮ PageRank Nibble on the sparse directed stochastic block model ⋮ Mixing time of PageRank surfers on sparse random digraphs ⋮ General epidemiological models: law of large numbers and contact tracing ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Stochastic recursions on directed random graphs ⋮ PageRank's behavior under degree correlations ⋮ Pagerank asymptotics on directed preferential attachment networks ⋮ Continuity and sensitivity analysis of parameterized Nash games ⋮ Random intersection graphs with communities ⋮ The Buck-Passing Game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
• Asymptotic fringe distributions for general families of random trees
• Generating simple random graphs with prescribed degree distribution
• Growth of preferential attachment random graphs via continuous-time branching processes
• Universality for the distance in finite variance random graphs
• Diameters in preferential attachment models
• Random networks with sublinear preferential attachment: degree evolutions
• The dynamics of power laws: fitness and aging in preferential attachment trees
• Recurrence of distributional limits of finite planar graphs
• Connected components in random graphs with given expected degree sequences
• Random networks with sublinear preferential attachment: the giant component
• PageRank on inhomogeneous random digraphs
• Random networks with concave preferential attachment rule
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Processes on unimodular random networks
• Random Graphs and Complex Networks
• Typical Distances in Ultrasmall Random Networks
• PageRank in Scale-Free Random Graphs
• Information ranking and power laws on trees
• Statistical mechanics of complex networks
• Convergence of directed random graphs to the Poisson-weighted infinite tree
• The growth and composition of branching populations
• PageRank in Undirected Random Graphs
• Asymptotic analysis for personalized Web search
• On the convergence of supercritical general (C-M-J) branching processes
• From trees to graphs: collapsing continuous-time branching processes
• Connectivity of a general class of inhomogeneous random digraphs
• Directed random graphs with given degree distributions
• Unimodular random trees
• Generalized PageRank on directed configuration networks
• Diameter in ultra‐small scale‐free random graphs
• Random trees and general branching processes
• The Effect of New Links on Google Pagerank
• PageRank of Scale-Free Growing Networks
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?
• Preferential Attachment Random Graphs with General Weight Function
• The diameter of sparse random graphs

This page was built for publication: Local weak convergence for PageRank