A local clustering algorithm for connection graphs

DOI10.1080/15427951.2014.968295MaRDI QIDQ4985792zbMATH OpenOpenAlexFDO

Authors Mark Kempton, Fan 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

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

Recommendations

• A Local Clustering Algorithm for Connection Graphs
• A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
• Clustering algorithm of graphs
• Consistency of Cheeger and ratio graph cuts
• Partitioning well-clustered graphs: spectral clustering works!

Cites work

• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A Cheeger Inequality for the Graph Connection Laplacian
• A sharp PageRank algorithm with applications to edge ranking and graph sparsification
• Angular synchronization by eigenvectors and semidefinite programming
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Laplacian and vibrational spectra for homogeneous graphs
• Matrix Analysis
• Principal component analysis.
• Representation theoretic patterns in three dimensional cryo-electron microscopy. I: The intrinsic reconstitution algorithm
• Using PageRank to Locally Partition a Graph
• Vector diffusion maps and the connection Laplacian
• Viewing angle classification of cryo-electron microscopy images using eigenvectors

Cited in

(5)

• Topological graph clustering with thin position
• Ranking and sparsifying a connection graph
• Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
• scientific article; zbMATH DE number 5556003 (Why is no real title available?)
• A Local Clustering Algorithm for Connection Graphs

This page was built for publication: A local clustering algorithm for connection graphs

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