Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm

DOI10.1007/978-3-540-72504-6_1MaRDI QIDQ5425416zbMATH OpenOpenAlexFDO

Authors Reid Andersen, Fan Chung

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72504-6_1

Mathematics Subject Classification ID

Internet topics (68M11)

Recommendations

• Using PageRank to Locally Partition a Graph
• Local Partitioning for Directed Graphs Using PageRank
• Local partitioning for directed graphs using pagerank
• A local graph partitioning algorithm using heat kernel pagerank
• A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank

Cited in

(12)

• Personalized PageRank clustering: a graph clustering algorithm based on random walks
• Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
• A sharp PageRank algorithm with applications to edge ranking and graph sparsification
• Local partitioning for directed graphs using pagerank
• Local Computation of PageRank Contributions
• Using PageRank to Locally Partition a Graph
• Seeded PageRank solution paths
• A local clustering algorithm for connection graphs
• Local Computation of PageRank Contributions
• Local Partitioning for Directed Graphs Using PageRank
• Improved Cheeger's inequality and analysis of local graph partitioning using vertex expansion and expansion profile
• Approximating single-source personalized pagerank with absolute error guarantees

This page was built for publication: Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425416)