A spectral method to detect community structure based on distance modularity matrix
From MaRDI portal
Recommendations
- Detecting network communities: a new systematic and efficient algorithm
- Spectral clustering for community detection
- A divisive spectral method for network community detection
- Detecting community structure in directed networks via multiple eigenvectors
- Community detection in networks via a spectral heuristic based on the clustering coefficient
Cites work
- Collective dynamics of `small-world' networks
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Community structure in large complex networks
- Community structure in social and biological networks
- First-principles multiway spectral partitioning of graphs
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- On the Quality of Spectral Separators
Cited in
(7)- Traveling salesman problems with PageRank distance on complex networks reveal community structure
- A modularity based spectral method for simultaneous community and anti-community detection
- Community detection by resistance distance: automation and benchmark testing
- Community detection based on neighborhood information
- scientific article; zbMATH DE number 7266663 (Why is no real title available?)
- Detecting community structure in directed networks via multiple eigenvectors
- EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks
This page was built for publication: A spectral method to detect community structure based on distance modularity matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363914)
