Community Detection from Low-Rank Excitations of a Graph Filter

Hoi To Wai, Santiago Segarra, Asuman E. Ozdaglar, Anna Scaglione, Ali Jadbabaie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publication2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4044-4048
Number of pages5
Volume2018-April
ISBN (Print)9781538646588
DOIs
StatePublished - Sep 10 2018
Event2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Calgary, Canada
Duration: Apr 15 2018Apr 20 2018

Other

Other2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018
CountryCanada
CityCalgary
Period4/15/184/20/18

Fingerprint

Covariance matrix
Eigenvalues and eigenfunctions
Topology
Experiments

Keywords

  • Community detection
  • Graph filter
  • Graph signal processing
  • Low rank excitation
  • Topology identification

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Wai, H. T., Segarra, S., Ozdaglar, A. E., Scaglione, A., & Jadbabaie, A. (2018). Community Detection from Low-Rank Excitations of a Graph Filter. In 2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings (Vol. 2018-April, pp. 4044-4048). [8462239] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICASSP.2018.8462239

Community Detection from Low-Rank Excitations of a Graph Filter. / Wai, Hoi To; Segarra, Santiago; Ozdaglar, Asuman E.; Scaglione, Anna; Jadbabaie, Ali.

2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings. Vol. 2018-April Institute of Electrical and Electronics Engineers Inc., 2018. p. 4044-4048 8462239.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wai, HT, Segarra, S, Ozdaglar, AE, Scaglione, A & Jadbabaie, A 2018, Community Detection from Low-Rank Excitations of a Graph Filter. in 2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings. vol. 2018-April, 8462239, Institute of Electrical and Electronics Engineers Inc., pp. 4044-4048, 2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018, Calgary, Canada, 4/15/18. https://doi.org/10.1109/ICASSP.2018.8462239
Wai HT, Segarra S, Ozdaglar AE, Scaglione A, Jadbabaie A. Community Detection from Low-Rank Excitations of a Graph Filter. In 2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings. Vol. 2018-April. Institute of Electrical and Electronics Engineers Inc. 2018. p. 4044-4048. 8462239 https://doi.org/10.1109/ICASSP.2018.8462239
Wai, Hoi To ; Segarra, Santiago ; Ozdaglar, Asuman E. ; Scaglione, Anna ; Jadbabaie, Ali. / Community Detection from Low-Rank Excitations of a Graph Filter. 2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings. Vol. 2018-April Institute of Electrical and Electronics Engineers Inc., 2018. pp. 4044-4048
@inproceedings{5a1ba2cde49144b1b7aaead44ea0f188,
title = "Community Detection from Low-Rank Excitations of a Graph Filter",
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.",
keywords = "Community detection, Graph filter, Graph signal processing, Low rank excitation, Topology identification",
author = "Wai, {Hoi To} and Santiago Segarra and Ozdaglar, {Asuman E.} and Anna Scaglione and Ali Jadbabaie",
year = "2018",
month = "9",
day = "10",
doi = "10.1109/ICASSP.2018.8462239",
language = "English (US)",
isbn = "9781538646588",
volume = "2018-April",
pages = "4044--4048",
booktitle = "2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Community Detection from Low-Rank Excitations of a Graph Filter

AU - Wai, Hoi To

AU - Segarra, Santiago

AU - Ozdaglar, Asuman E.

AU - Scaglione, Anna

AU - Jadbabaie, Ali

PY - 2018/9/10

Y1 - 2018/9/10

N2 - 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.

AB - 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.

KW - Community detection

KW - Graph filter

KW - Graph signal processing

KW - Low rank excitation

KW - Topology identification

UR - http://www.scopus.com/inward/record.url?scp=85054216578&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054216578&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2018.8462239

DO - 10.1109/ICASSP.2018.8462239

M3 - Conference contribution

AN - SCOPUS:85054216578

SN - 9781538646588

VL - 2018-April

SP - 4044

EP - 4048

BT - 2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -