PageRank's behavior under degree correlations

DOI10.1214/20-AAP1623zbMath1477.05173arXiv1909.09744MaRDI QIDQ2240854

Mariana Olvera-Cravioto

Publication date: 4 November 2021

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

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

zbMATH Keywords

power lawscomplex networksdirected random graphspagerankweighted branching processesdistributional fixed-point equationsranking algorithmsdegree-correlations

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Convergence of probability measures (60B10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Related Items (6)

Strong couplings for static locally tree-like random graphs ⋮ PageRank Nibble on the sparse directed stochastic block model ⋮ Scale-free graphs with many edges ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Stochastic recursions on directed random graphs ⋮ Pagerank asymptotics on directed preferential attachment networks

Uses Software

• PageRank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tail behavior of solutions of linear recursions on trees
• Implicit renewal theorem for trees with general weights
• The functional equation of the smoothing transform
• 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
• Multiplicative cascades: Dimension spectra and dependence
• Connected components in random graphs with given expected degree sequences
• Fixed points of the smoothing transform: two-sided solutions
• PageRank on inhomogeneous random digraphs
• Local weak convergence for PageRank
• Precise tail asymptotics of fixed points of the smoothing transform with general weights
• Thin tails of fixed points of the nonhomogeneous smoothing transform
• Precise Tail Index of Fixed Points of the Two-Sided Smoothing Transform
• Implicit Renewal Theory and Power Tails on Trees
• Fixed points of inhomogeneous smoothing transforms
• 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
• Generalized potlatch and smoothing processes
• Fixed points of the smoothing transformation
• Asymptotics for Weighted Random Sums
• Connectivity of a general class of inhomogeneous random digraphs
• 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
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?
• Optimal Transport

This page was built for publication: PageRank's behavior under degree correlations