Probabilistic Relation between In-Degree and PageRank

DOI10.1007/978-3-540-78808-9_7zbMath1142.68314OpenAlexW2159222817MaRDI QIDQ3520032

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

Publication date: 19 August 2008

Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78808-9_7

zbMATH Keywords

regular variationstochastic equationpower lawPageRankIn-Degreeweb measurement

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Information storage and retrieval of data (68P20)

Related Items (1)

Spectral properties of Google matrix of Wikipedia and other networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of max-type recursive distributional equations
• Emergence of Scaling in Random Networks
• RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
• On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1
• Asymptotic properties of supercritical branching processes I: The Galton-Watson process
• Deeper Inside PageRank
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• Determining Factors Behind the PageRank Log-Log Plot
• A Survey on PageRank Computing
• PageRank of Scale-Free Growing Networks
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?

This page was built for publication: Probabilistic Relation between In-Degree and PageRank