Stationary Graph Processes: Parametric Power Spectral Estimation

Santiago Segarra, Antonio G. Marques, Geert Leus, Alejandro Ribeiro

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

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 languageEnglish
Title of host publication2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages4099-4103
Number of pages5
ISBN (Electronic)978-1-5090-4117-6
DOIs
Publication statusPublished - 2017
EventICASSP 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 20179 Mar 2017
Conference number: 42
http://www.ieee-icassp2017.org/

Conference

ConferenceICASSP 2017
Abbreviated titleICASSP
CountryUnited States
CityNew Orleans, LA
Period5/03/179/03/17
Internet address

Keywords

  • ARMA graph processes
  • Graph signal processing
  • Parametric estimation
  • Power spectral density
  • Stationarity

Fingerprint

Dive into the research topics of 'Stationary Graph Processes: Parametric Power Spectral Estimation'. Together they form a unique fingerprint.

Cite this