Using PageRank to Locally Partition a Graph

DOI10.1080/15427951.2007.10129139MaRDI QIDQ3622689zbMATH OpenOpenAlexFDO

Authors Reid Andersen, Kevin J. Lang, Fan Chung

Publication date 28 April 2009

Published in Internet Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

approximate PageRank vectors

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10)

Recommendations

• 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
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Local Computation of PageRank Contributions
• Local Computation of PageRank Contributions
• A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning

Cited in

(27)

• Personalized PageRank clustering: a graph clustering algorithm based on random walks
• Sampling from complex networks with high community structures
• Dirichlet eigenvalues, local random walks, and analyzing clusters in graphs
• A sharp PageRank algorithm with applications to edge ranking and graph sparsification
• Local partitioning for directed graphs using pagerank
• Local Computation of PageRank Contributions
• Finding small sparse cuts by random walk
• A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
• Network essence: PageRank completion and centrality-conforming Markov chains
• Communities, Random Walks, and Social Sybil Defense
• A local clustering algorithm for connection graphs
• Compressive sensing for cut improvement and local clustering
• On solving linear systems in sublinear time
• Simulating random walks on graphs in the streaming model
• Finding sparse cuts locally using evolving sets
• Flow-based algorithms for local graph clustering
• A local graph partitioning algorithm using heat kernel pagerank
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Local Computation of PageRank Contributions
• Local Partitioning for Directed Graphs Using PageRank
• Finding and visualizing graph clusters using PageRank optimization
• Multi-linear pseudo-PageRank for hypergraph partitioning
• A compressed sensing based least squares approach to semi-supervised local cluster extraction
• Local community detection by random walk on hypergraphs
• Approximating single-source personalized pagerank with absolute error guarantees
• Near-optimal two-pass streaming algorithm for sampling random walks over directed graphs
• Reconstructing Markov processes from independent and anonymous experiments

This page was built for publication: Using PageRank to Locally Partition a Graph

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