A divisive spectral method for network community detection
DOI10.1088/1742-5468/2016/03/033403zbMath1456.68142arXiv1506.08354OpenAlexW3101373936MaRDI QIDQ3302576
Yukai Yao, Weiguo Lu, Longjie Li, Jianjun Cheng, Mingwei Leng, Xiao-yun Chen
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.08354
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (4)
Cites Work
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Personalized PageRank clustering: a graph clustering algorithm based on random walks
- Spectral redemption in clustering sparse networks
- Detecting network communities: a new systematic and efficient algorithm
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
- Community structure in social and biological networks
- Community Detection Using Spectral Clustering on Sparse Geosocial Data
- Lower Bounds for the Partitioning of Graphs
This page was built for publication: A divisive spectral method for network community detection