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

DOI10.1007/978-3-540-77004-6_7zbMath1136.68321OpenAlexW1536504533MaRDI QIDQ5458302

Paul G. 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)

Related Items (4)

Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ Asymptotic analysis for personalized Web search ⋮ Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph ⋮ Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees

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