Spectral clustering in the dynamic stochastic block model
Methodology
2017-05-04 v1 Machine Learning
Abstract
In the present paper, we studied a Dynamic Stochastic Block Model (DSBM) under the assumptions that the connection probabilities, as functions of time, are smooth and that at most nodes can switch their class memberships between two consecutive time points. We estimate the edge probability tensor by a kernel-type procedure and extract the group memberships of the nodes by spectral clustering. The procedure is computationally viable, adaptive to the unknown smoothness of the functional connection probabilities, to the rate of membership switching and to the unknown number of clusters. In addition, it is accompanied by non-asymptotic guarantees for the precision of estimation and clustering.
Cite
@article{arxiv.1705.01204,
title = {Spectral clustering in the dynamic stochastic block model},
author = {Marianna Pensky and Teng Zhang},
journal= {arXiv preprint arXiv:1705.01204},
year = {2017}
}