Variational perspective on local graph clustering

DOI10.1007/s10107-017-1214-8zbMath1409.05196arXiv1602.01886MaRDI QIDQ1739051

Julian Shun, Kimon Fountoulakis, Michael W. Mahoney, Xiang Cheng, Farbod Roosta-Khorasani

Publication date: 24 April 2019

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

variational formulation; approximate personalized PageRank; iterative shrinkage-thresholding; local spectral graph clustering

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K10: Numerical optimization and variational techniques

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Unnamed Item, Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing, Variational perspective on local graph clustering, Multiway \(p\)-spectral graph cuts on Grassmann manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Random walks and local cuts in graphs
• Variational perspective on local graph clustering
• PageRank Beyond the Web
• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Flow-Based Algorithms for Local Graph Clustering
• Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
• An r-Dimensional Quadratic Placement Algorithm
• Expander flows, geometric embeddings and graph partitioning