In-Degree and PageRank: Why Do They Follow Similar Power Laws?

DOI10.1080/15427951.2007.10129293zbMath1206.68352OpenAlexW1959086707MaRDI QIDQ5894139

Werner R. W. Scheinhardt, Nelly Litvak, Yana Volkovich

Publication date: 28 February 2011

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1243430605

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Internet topics (68M11)

Related Items (9)

Local weak convergence for PageRank ⋮ PageRank in Scale-Free Random Graphs ⋮ Towards Google matrix of brain ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Probabilistic Relation between In-Degree and PageRank ⋮ PageRank on inhomogeneous random digraphs ⋮ PageRank's behavior under degree correlations ⋮ Asymptotic analysis for personalized Web search ⋮ Information ranking and power laws on trees

This page was built for publication: In-Degree and PageRank: Why Do They Follow Similar Power Laws?