Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel

by   Francesco Sanna Passino, et al.

Spectral clustering is a popular method for community detection in networks under the assumption of the standard stochastic blockmodel. Taking a matrix representation of the graph such as the adjacency matrix, the nodes are clustered on a low dimensional projection obtained from a truncated spectral decomposition of the matrix. Estimating the number of communities and the dimension of the reduced latent space well is crucial for good performance of spectral clustering algorithms. Real-world networks, such as computer networks studied in cyber-security applications, often present heterogeneous within-community degree distributions which are better addressed by the degree-corrected stochastic blockmodel. A novel, model-based method is proposed in this article for simultaneous and automated selection of the number of communities and latent dimension for spectral clustering under the degree-corrected stochastic blockmodel. The method is based on a transformation to spherical coordinates of the spectral embedding, and on a novel modelling assumption in the transformed space, which is then embedded into an existing model selection framework for estimating the number of communities and the latent dimension. Results show improved performance over competing methods on simulated and real-world computer network data.



There are no comments yet.


page 10


Consistency of spectral clustering in stochastic block models

We analyze the performance of spectral clustering for community extracti...

Bayesian estimation of the latent dimension and communities in stochastic blockmodels

Spectral embedding of adjacency or Laplacian matrices of undirected grap...

A unified framework for spectral clustering in sparse graphs

This article considers spectral community detection in the regime of spa...

Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering

Our problem of interest is to cluster vertices of a graph by identifying...

Spectral clustering under degree heterogeneity: a case for the random walk Laplacian

This paper shows that graph spectral embedding using the random walk Lap...

Latent structure blockmodels for Bayesian spectral graph clustering

Spectral embedding of network adjacency matrices often produces node rep...

Detecting Latent Communities in Network Formation Models

This paper proposes a logistic undirected network formation model which ...

Code Repositories


Spectral clustering under the degree-corrected stochastic blockmodel

view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.