141 citations · 1.7k across the 117 of their papers we have counts for
Showing 2015 · cs.SIShow all
2 papers · 2 filters
cs.SI2015★ 10 cited
Detectability of the spectral method for sparse graph partitioning
Tatsuro Kawamoto, Yoshiyuki Kabashima
We show that modularity maximization with the resolution parameter offers a unifying framework of graph partitioning. In this framework, we demonstrate that the spectral method exh…
cs.SI2015★ 29 cited
Limitations in the spectral method for graph partitioning: detectability threshold and localization of eigenvectors
Tatsuro Kawamoto, Yoshiyuki Kabashima
Investigating the performance of different methods is a fundamental problem in graph partitioning. In this paper, we estimate the so-called detectability threshold for the spectral…