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}
}
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
Highly Cited
This paper has 61 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 41 extracted citations

61 Citations

051015'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 48 references

A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory

  • ——
  • Czechoslovak Mathematical Journal, vol. 25, no. 4…
  • 1975
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…