Community detection based on the “clumpiness” matrix in complex networks

► We use eigenvectors of the clumpiness matrix to identify network communities. ► A projection space is constructed using the eigenvectors. ► Accumulation of points in branches reveals communities. ► Eigenvectors are in fact spin-like states of the clumpiness matrix as a Hamiltonian. ► The method shows a good performance in artificial and real-world networks