Corpus ID: 919316

Spectral Clustering of graphs with the Bethe Hessian

@inproceedings{Saade2014SpectralCO,
  title={Spectral Clustering of graphs with the Bethe Hessian},
  author={A. Saade and F. Krzakala and L. Zdeborov{\'a}},
  booktitle={NIPS},
  year={2014}
}
Spectral clustering is a standard approach to label nodes on a graph by studying the (largest or lowest) eigenvalues of a symmetric real matrix such as e.g. the adjacency or the Laplacian. Recently, it has been argued that using instead a more complicated, non-symmetric and higher dimensional operator, related to the non-backtracking walk on the graph, leads to improved performance in detecting clusters, and even to optimal performance for the stochastic block model. Here, we propose to use… Expand
114 Citations
Optimized Deformed Laplacian for Spectrum-based Community Detection in Sparse Heterogeneous Graphs
  • 4
  • Highly Influenced
  • PDF
Revisiting the Bethe-Hessian: Improved Community Detection in Sparse Heterogeneous Graphs
  • 12
  • Highly Influenced
  • PDF
A unified framework for spectral clustering in sparse graphs
  • 2
  • Highly Influenced
  • PDF
Sparse random graphs: regularization and concentration of the Laplacian
  • 51
  • PDF
Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
  • PDF
Improved spectral community detection in large heterogeneous networks
  • 22
  • Highly Influenced
  • PDF
Community Detection with the z-Laplacian
  • 1
  • PDF
Spectral Clustering of Signed Graphs via Matrix Power Means
  • 9
  • PDF
Spectral Clustering over the Logistic Random Dot Product Graph
  • Highly Influenced
Graph Comparison via the Non-backtracking Spectrum
  • 5
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Spectral redemption in clustering sparse networks
  • 479
  • PDF
Finding community structure in networks using the eigenvectors of matrices.
  • M. Newman
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
  • 3,672
  • PDF
Spectral density of the non-backtracking operator
  • 19
  • PDF
A tutorial on spectral clustering
  • 7,398
  • PDF
Stochastic Blockmodels for Directed Graphs
  • 437
  • Highly Influential
  • PDF
Community detection thresholds and the weak Ramanujan property
  • 341
  • PDF
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
  • 585
  • PDF
Resolvent of large random graphs
  • 43
Graph Zeta Function in the Bethe Free Energy and Loopy Belief Propagation
  • 69
  • Highly Influential
  • PDF
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Computer Science, Physics
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2002
  • 11,857
  • PDF
...
1
2
3
...