Community Detection from Low-Rank Excitations of a Graph Filter
Hoi-To Wai, Santiago Segarra, Asuman E. Ozdaglar, Anna Scaglione, Ali Jadbabaie
Abstract
This paper considers the problem of inferring the topology of a graph from noisy outputs of an unknown graph filter excited by low-rank signals. Limited by this low-rank structure, we focus on solving the community detection problem, whose aim is to partition the node set of the unknown graph into subsets with high edge densities. We propose to detect the communities by applying spectral clustering on the low-rank output covariance matrix. To analyze the performance, we show that the low-rank covariance yields a sketch of the eigenvectors of the unknown graph. Importantly, we provide theoretical bounds on the error introduced by this sketching procedure based on spectral features of the graph filter involved. Finally, our theoretical findings are validated via numerical experiments.
BibTeX
@inproceedings{icassp2018_communitydetecti,
title = {Community Detection from Low-Rank Excitations of a Graph Filter},
author = {Hoi-To Wai and Santiago Segarra and Asuman E. Ozdaglar and Anna Scaglione and Ali Jadbabaie},
booktitle = {ICASSP 2018},
year = {2018}
}