A Hermitian-matrix spectral clustering algorithm provably recovers clusters defined by edge orientation in directed stochastic block models and reveals migration flow imbalances in US county data.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Hermitian matrices for clustering directed graphs: insights and applications
A Hermitian-matrix spectral clustering algorithm provably recovers clusters defined by edge orientation in directed stochastic block models and reveals migration flow imbalances in US county data.