Blind Community Detection From Low-Rank Excitations of a Graph Filter
© 1991-2012 IEEE. This paper considers a new framework to detect communities in a graph from the observation of signals at its nodes. We model the observed signals as noisy outputs of an unknown network process, represented as a graph filter that is excited by a set of unknown low-rank inputs/excita...
Main Authors: | Wai, Hoi-To (Author), Segarra, Santiago M (Author), Ozdaglar, Asuman E. (Author), Scaglione, Anna (Author), Jadbabaie-Moghadam, Ali (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor), Massachusetts Institute of Technology. Institute for Data, Systems, and Society (Contributor), Massachusetts Institute of Technology. Department of Civil and Environmental Engineering (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2021-02-18T20:40:35Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Escaping saddle points in constrained optimization
by: Mokhtari, Aryan, et al.
Published: (2019) -
A distributed Newton method for Network Utility Maximization
by: Wei, Ermin, et al.
Published: (2011) -
A Distributed Newton Method for Network Optimization
by: Jadbabaie, Ali, et al.
Published: (2011) -
Asymmetric information diffusion via gossiping on static and dynamic networks
by: Yildiz, Mehmet Ercan, et al.
Published: (2011) -
A distributed newton method for dynamic Network Utility Maximization with delivery contracts
by: Wei, Ermin, et al.
Published: (2014)