Using PageRank to Characterize Web Structure
From MaRDI portal
Recommendations
Cited in
(16)- Second order accurate distributed eigenvector computation for extremely large matrices
- On efficient randomized algorithms for finding the PageRank vector
- Justifying the small-world phenomenon via random recursive trees
- Modeling traffic on the web graph
- It's a small world for random surfers
- A Stochastic Model for the Link Analysis of the Web
- scientific article; zbMATH DE number 1945817 (Why is no real title available?)
- About the power law of the PageRank vector component distribution. II: The Buckley-Osthus model, verification of the power law for this model, and setup of real search engines
- scientific article; zbMATH DE number 2089988 (Why is no real title available?)
- Multiscale matrix sampling and sublinear-time PageRank computation
- PageRank of Scale-Free Growing Networks
- In-Degree and PageRank: why do they follow similar power laws?
- Spectral properties of Google matrix of Wikipedia and other networks
- Power-law hypothesis for PageRank on undirected graphs
- On the peninsula phenomenon in web graph and its implications on web search
- Modelling the navigation potential of a web page
This page was built for publication: Using PageRank to Characterize Web Structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431003)