PageRank on inhomogeneous random digraphs

DOI10.1016/j.spa.2019.07.002zbMath1437.05214arXiv1707.02492OpenAlexW2962764580WikidataQ127494861 ScholiaQ127494861MaRDI QIDQ1986028

Jiung Lee, Mariana Olvera-Cravioto

Publication date: 7 April 2020

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

power lawsdirected random graphsPageRankweighted branching processesstochastic fixed-point equationsranking algorithms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Ergodic theorems, spectral theory, Markov operators (37A30) Convergence of probability measures (60B10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Information storage and retrieval of data (68P20)

Related Items (9)

Local weak convergence for PageRank ⋮ PageRank Nibble on the sparse directed stochastic block model ⋮ Maxima and sums of non-stationary random length sequences ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ PageRank on inhomogeneous random digraphs ⋮ PageRank's behavior under degree correlations ⋮ Convergence of the population dynamics algorithm in the Wasserstein metric ⋮ Pagerank asymptotics on directed preferential attachment networks ⋮ The Buck-Passing Game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implicit renewal theorem for trees with general weights
• Generating simple random graphs with prescribed degree distribution
• Universality for the distance in finite variance random graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Connected components in random graphs with given expected degree sequences
• PageRank on inhomogeneous random digraphs
• Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
• Random Graphs and Complex Networks
• Implicit Renewal Theory and Power Tails on Trees
• Information ranking and power laws on trees
• The Number of Components in Random Linear Graphs
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• Asymptotic analysis for personalized Web search
• Paths in graphs
• Directed random graphs with given degree distributions
• The phase transition in inhomogeneous random graphs
• Generalized PageRank on directed configuration networks
• Determining Factors Behind the PageRank Log-Log Plot
• The average distances in random graphs with given expected degrees
• On a conditionally Poissonian graph process
• Random Graphs
• Coupling on weighted branching trees
• PageRank of Scale-Free Growing Networks
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?
• Optimal Transport

This page was built for publication: PageRank on inhomogeneous random digraphs