DeepAI AI Chat
Log In Sign Up

Community Detection Based on the L_∞ convergence of eigenvectors in DCBM

by   Yan Liu, et al.
National University of Singapore
Northeast Normal University

Spectral clustering is one of the most popular algorithms for community detection in network analysis. Based on this rationale, in this paper we give the convergence rate of eigenvectors for the adjacency matrix in the l_∞ norm, under the stochastic block model (BM) and degree corrected stochastic block model (DCBM), adding some mild and rational conditions. We also extend this result to a more general model, presented based on the DCBM such that the value of random variables in the adjacency matrix is not 0 or 1, but an arbitrary real number. During the process of proving the above conclusion, we obtain the relationship of the eigenvalues in the adjacency matrix and the corresponding `population' matrix, which vary in dimension from the community-wise edge probability matrix. Using that result, we can give an estimate of the number of the communities in a known set of network data. Meanwhile we proved the consistency of the estimator. Furthermore, according to the derivation of proof for the convergence of eigenvectors, we propose a new approach to community detection -- Spectral Clustering based on Difference of Ratios of Eigenvectors (SCDRE). Our simulation experiments demonstrate the superiority of our method in community detection.


page 1

page 2

page 3

page 4


An improved spectral clustering method for community detection under the degree-corrected stochastic blockmodel

For community detection problem, spectral clustering is a widely used me...

Optimization via Low-rank Approximation for Community Detection in Networks

Community detection is one of the fundamental problems of network analys...

Robust and computationally feasible community detection in the presence of arbitrary outlier nodes

Community detection, which aims to cluster N nodes in a given graph into...

Covariate-Assisted Community Detection on Sparse Networks

Community detection is an important problem when processing network data...

Analysis of spectral clustering algorithms for community detection: the general bipartite setting

We consider the analysis of spectral clustering algorithms for community...

Community models for partially observed networks from surveys

Communities are a common and widely studied structure in networks, typic...