Multiscale Matrix Sampling and Sublinear-Time PageRank Computation

DOI10.1080/15427951.2013.802752zbMath1462.68008arXiv1202.2771OpenAlexW2148662050MaRDI QIDQ4985347

Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng, Christian Borgs

Publication date: 23 April 2021

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

Full work available at URL: https://arxiv.org/abs/1202.2771

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Stochastic matrices (15B51) Internet topics (68M11)

Related Items (4)

On Approximating the Stationary Distribution of Time-reversible Markov Chains ⋮ Sublinear Algorithms for Local Graph-Centrality Estimation ⋮ On approximating the stationary distribution of time-reversible Markov chains ⋮ Unnamed Item

Uses Software

• Matlab
• symrcm
• PageRank

Cites Work

• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
• Spectral methods for matrices and tensors
• Local Computation of PageRank Contributions
• Sublinear Time Algorithms
• Using PageRank to Characterize Web Structure
• Spectral Algorithms
• Sparse Matrices in MATLAB: Design and Implementation
• An improved data stream summary: the count-min sketch and its applications
• Introduction to Testing Graph Properties
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• A Survey on PageRank Computing

This page was built for publication: Multiscale Matrix Sampling and Sublinear-Time PageRank Computation