Using PageRank to Locally Partition a Graph

DOI10.1080/15427951.2007.10129139zbMath1170.68302OpenAlexW2122799790MaRDI QIDQ3622689

Kevin J. Lang, Reid Andersen, Fan R. K. 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

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

Related Items (12)

Personalized PageRank clustering: a graph clustering algorithm based on random walks ⋮ Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs ⋮ Multi-linear pseudo-PageRank for hypergraph partitioning ⋮ A compressed sensing based least squares approach to semi-supervised local cluster extraction ⋮ Reconstructing Markov processes from independent and anonymous experiments ⋮ Network Essence: PageRank Completion and Centrality-Conforming Markov Chains ⋮ A Local Clustering Algorithm for Connection Graphs ⋮ Sampling from complex networks with high community structures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Communities, Random Walks, and Social Sybil Defense ⋮ Compressive Sensing for Cut Improvement and Local Clustering

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