Abstract
Advancing a holistic theory of networks and network processes requires the extension of existing results in the processing of time-varying signals to signals supported on graphs. This paper focuses on the definition of stationarity and power spectral density for random graph signals, generalizes the concepts of autoregressive and moving average random processes to the graph domain, and investigates their parametric spectral estimation. Theoretical and algorithmic results are complemented with numerical tests on synthetic and real-world graphs.
Original language | English |
---|---|
Title of host publication | 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 4099-4103 |
Number of pages | 5 |
ISBN (Electronic) | 978-1-5090-4117-6 |
DOIs | |
Publication status | Published - 2017 |
Event | ICASSP 2017: 42nd IEEE International Conference on Acoustics, Speech and Signal Processing - The Internet of Signals - Hilton New Orleans Riverside, New Orleans, LA, United States Duration: 5 Mar 2017 → 9 Mar 2017 Conference number: 42 http://www.ieee-icassp2017.org/ |
Conference
Conference | ICASSP 2017 |
---|---|
Abbreviated title | ICASSP |
Country/Territory | United States |
City | New Orleans, LA |
Period | 5/03/17 → 9/03/17 |
Internet address |
Keywords
- ARMA graph processes
- Graph signal processing
- Parametric estimation
- Power spectral density
- Stationarity