skip to main content

Search for: All records

Creators/Authors contains: "Ozdaglar, Asuman"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Jain, Prateek (Ed.)
  2. Wallach, H. ; Larochelle, H. ; Beygelzimer, A. ; Fox, E. ; Garnett, R. (Ed.)
  3. null (Ed.)
  4. null (Ed.)
  5. 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 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 in both synthetic and real-world graphs. 
    more » « less