Spectral Algorithms for Community Detection in Directed Networks
Community detection in large social networks is affected by degree heterogeneity of nodes. The D-SCORE algorithm for directed networks was introduced to reduce this effect by taking the element-wise ratios of the singular vectors of the adjacency matrix before clustering. Meaningful results were obtained for the statistician citation network, but rigorous analysis on its performance was missing. First, this paper establishes theoretical guarantee for this algorithm and its variants for the directed degree-corrected block model (Directed-DCBM). Second, this paper provides significant improvements for the original D-SCORE algorithms by attaching the nodes outside of the community cores using the information of the original network instead of the singular vectors.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringCommunity DetectionSimilar Papers 제목 키워드 기반
Scalable Spectral Algorithms for Community Detection in Directed Networks
Community detection has been one of the central problems in network studies and directed network is particularly challenging due to asymmetry among its links. In this paper, we found that incorporating the direction of l…
Community DetectionBayesian estimation of the latent dimension and communities in stochastic blockmodels
Spectral embedding of adjacency or Laplacian matrices of undirected graphs is a common technique for representing a network in a lower dimensional latent space, with optimal theoretical guarantees. The embedding can be u…
Community DetectionSpectral redemption: clustering sparse networks
Spectral algorithms are classic approaches to clustering and community detection in networks. However, for sparse networks the standard versions of these algorithms are suboptimal, in some cases completely failing to det…
ClusteringCommunity DetectionStochastic Block ModelA Spectral Framework for Tracking Communities in Evolving Networks
Discovering and tracking communities in time-varying networks is an important task in network science, motivated by applications in fields ranging from neuroscience to sociology. In this work, we characterize the celebra…
Community DetectionDynamic Community DetectionRiemannian optimizationSociologyPerfect Clustering for Sparse Directed Stochastic Block Models
Exact recovery in stochastic block models (SBMs) is well understood in undirected settings, but remains considerably less developed for directed and sparse networks, particularly when the number of communities diverges. …
Community Detection