A Local Clustering Algorithm for Connection Graphs

DOI10.1080/15427951.2014.968295zbMath1461.05195OpenAlexW1965476362MaRDI QIDQ4985792

Mark Kempton, Fan R. K. Chung

Publication date: 26 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Signed and weighted graphs (05C22) Internet topics (68M11)

Cites Work

• Unnamed Item
• Angular synchronization by eigenvectors and semidefinite programming
• Representation theoretic patterns in three dimensional cryo-electron microscopy. I: The intrinsic reconstitution algorithm
• Principal component analysis.
• Vector diffusion maps and the connection Laplacian
• Viewing Angle Classification of Cryo-Electron Microscopy Images Using Eigenvectors
• A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification
• Using PageRank to Locally Partition a Graph
• Matrix Analysis
• Laplacian and vibrational spectra for homogeneous graphs
• A Cheeger Inequality for the Graph Connection Laplacian
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm

This page was built for publication: A Local Clustering Algorithm for Connection Graphs