Generalized PageRank on directed configuration networks

DOI10.1002/rsa.20700zbMath1370.05199arXiv1409.7443OpenAlexW2551247756MaRDI QIDQ5357980

Ningyuan Chen, Mariana Olvera-Cravioto, Nelly Litvak

Publication date: 18 September 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

power lawscomplex networksdirected configuration modelPageRankweighted branching processesstochastic fixed-point equationsranking algorithms

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (15)

Importance sampling for maxima on trees ⋮ Strong couplings for static locally tree-like random graphs ⋮ Typical distances in the directed configuration model ⋮ Local weak convergence for PageRank ⋮ PageRank in Scale-Free Random Graphs ⋮ Random walk on sparse random digraphs ⋮ Mixing time of PageRank surfers on sparse random digraphs ⋮ Scale-free graphs with many edges ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ PageRank on inhomogeneous random digraphs ⋮ PageRank's behavior under degree correlations ⋮ Mean field analysis of personalized PageRank with implications for local graph clustering ⋮ Convergence of the population dynamics algorithm in the Wasserstein metric ⋮ Pagerank asymptotics on directed preferential attachment networks ⋮ The Buck-Passing Game

This page was built for publication: Generalized PageRank on directed configuration networks