Spectral partitioning of timevarying networks with unobserved edges
Abstract
We discuss a variant of `blind' community detection, in which we aim to partition an unobserved network from the observation of a (dynamical) graph signal defined on the network. We consider a scenario where our observed graph signals are obtained by filtering white noise input, and the underlying network is different for every observation. In this fashion, the filtered graph signals can be interpreted as defined on a timevarying network. We model each of the underlying network realizations as generated by an independent draw from a latent stochastic blockmodel (SBM). To infer the partition of the latent SBM, we propose a simple spectral algorithm for which we provide a theoretical analysis and establish consistency guarantees for the recovery. We illustrate our results using numerical experiments on synthetic and real data, highlighting the efficacy of our approach.
 Publication:

arXiv eprints
 Pub Date:
 April 2019
 arXiv:
 arXiv:1904.11930
 Bibcode:
 2019arXiv190411930S
 Keywords:

 Computer Science  Social and Information Networks;
 Computer Science  Systems and Control;
 Physics  Physics and Society;
 Statistics  Machine Learning
 EPrint:
 5 pages, 2 figures