Highly Influenced

# Hearing the clusters in a graph: A distributed algorithm

@article{Sahai2012HearingTC, title={Hearing the clusters in a graph: A distributed algorithm}, author={Tuhin Sahai and Alberto Speranzon and Andrzej Banaszuk}, journal={Automatica}, year={2012}, volume={48}, pages={15-24} }

- Published 2012 in Automatica
DOI:10.1016/j.automatica.2011.09.019

We propose a novel distributed algorithm to cluster graphs. The algorithm recovers the solution obtained from spectral clustering without the need for expensive eigenvalue/vector computations. We prove that, by propagating waves through the graph, a local fast Fourier transform yields the local component of every eigenvector of the Laplacian matrix, which are used to cluster graphs. For large graphs, the proposed algorithm is orders of magnitude faster than random walk based approaches. We… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 61 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**61**citations based on the available data.See our **FAQ** for additional information.