Using PageRank to Characterize Web Structure

DOI10.1080/15427951.2006.10129114zbMath1113.68313OpenAlexW2158630329MaRDI QIDQ3431003

Gopal Pandurangan, Eli Upfal, Prabhakar Raghavan

Publication date: 5 April 2007

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2006.10129114

zbMATH Keywords

web graph

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (6)

It's a small world for random surfers ⋮ Spectral properties of Google matrix of Wikipedia and other networks ⋮ Second order accurate distributed eigenvector computation for extremely large matrices ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ Multiscale Matrix Sampling and Sublinear-Time PageRank Computation ⋮ On efficient randomized algorithms for finding the PageRank vector

This page was built for publication: Using PageRank to Characterize Web Structure