Local partitioning for directed graphs using pagerank

DOI10.1080/15427951.2008.10129297MaRDI QIDQ3078595zbMATH OpenOpenAlexFDO

Authors Reid Andersen, Kevin J. Lang, Fan Chung

Publication date 28 February 2011

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1259158595

Mathematics Subject Classification ID

Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Local Partitioning for Directed Graphs Using PageRank
• Using PageRank to Locally Partition a Graph
• 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

Cited in

(13)

• A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
• Using PageRank to Locally Partition a Graph
• Quadratic decomposable submodular function minimization: theory and practice
• A Dynamical System for PageRank with Time-Dependent Teleportation
• Learning by unsupervised nonlinear diffusion
• A local graph partitioning algorithm using heat kernel pagerank
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Local Partitioning for Directed Graphs Using PageRank
• The buck-passing game
• Oriented spanning trees and stationary distribution of digraphs
• Local community detection by random walk on hypergraphs
• Extreme values of the stationary distribution of random walks on directed graphs
• Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic

This page was built for publication: Local partitioning for directed graphs using pagerank

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