Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model
From MaRDI portal
Publication:5458302
DOI10.1007/978-3-540-77004-6_7zbMATH Open1136.68321OpenAlexW1536504533MaRDI QIDQ5458302FDOQ5458302
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
Cited In (4)
- 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
- Parallel Maximum Clique Algorithms with Applications to Network Analysis
- Asymptotic analysis for personalized Web search
Uses Software
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)
