Probabilistic Relation between In-Degree and PageRank

DOI10.1007/978-3-540-78808-9_7MaRDI QIDQ3520032zbMATH OpenOpenAlexFDO

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

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

In-DegreePageRankpower lawregular variationstochastic equationweb measurement

Mathematics Subject Classification ID

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

Recommendations

• Approximating PageRank from In-Degree
• PageRank in Undirected Random Graphs
• PageRank's behavior under degree correlations
• PageRank in Scale-Free Random Graphs
• Characterization of Tail Dependence for In-Degree and PageRank
• PageRank on inhomogeneous random digraphs
• A note on the PageRank of undirected graphs
• PageRank for networks, graphs, and Markov chains
• In-Degree and PageRank: why do they follow similar power laws?

Cites work

• A survey of max-type recursive distributional equations
• A Survey on PageRank Computing
• Asymptotic properties of supercritical branching processes I: The Galton-Watson process
• Deeper Inside PageRank
• Determining Factors Behind the PageRank Log-Log Plot
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 43570 (Why is no real title available?)
• scientific article; zbMATH DE number 1947316 (Why is no real title available?)
• scientific article; zbMATH DE number 2089988 (Why is no real title available?)
• In-Degree and PageRank: why do they follow similar power laws?
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1
• PageRank of Scale-Free Growing Networks
• Queueing systems with heavy tails
• RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK

Cited in

(10)

• Using PageRank to Characterize Web Structure
• A Stochastic Model for the Link Analysis of the Web
• Approximating PageRank from In-Degree
• Asymptotic analysis for personalized web search
• Characterization of Tail Dependence for In-Degree and PageRank
• scientific article; zbMATH DE number 1945817 (Why is no real title available?)
• scientific article; zbMATH DE number 2089988 (Why is no real title available?)
• Determining Factors Behind the PageRank Log-Log Plot
• In-Degree and PageRank: why do they follow similar power laws?
• Spectral properties of Google matrix of Wikipedia and other networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520032)