Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model

DOI10.1007/978-3-540-77004-6_7MaRDI QIDQ5458302zbMATH OpenOpenAlexFDO

Authors P. Constantine, David F. Gleich

Publication date 11 April 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-77004-6_7

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Random alpha PageRank
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• A Survey on PageRank Computing
• PageRank in Scale-Free Random Graphs
• Random surfing without teleportation

Cited in

(6)

• Asymptotic analysis for personalized web search
• Random surfing without teleportation
• Random alpha PageRank
• Parallel maximum clique algorithms with applications to network analysis
• Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
• Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph

Describes a project that uses

Uses Software

• SparseMatrix
• UbiCrawler

This page was built for publication: Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model

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