Control of graph signals over random time-varying graphs

Conference paper (2018)

Authors

F. Gama University of Pennsylvania
E. Isufi Signal Processing Systems - EEMCS
G.J.T. Leus Signal Processing Systems - EEMCS
Alejandro Ribeiro University of Pennsylvania
Research Group
Signal Processing Systems (EEMCS) (TU Delft)
Copyright: © 2018 F. Gama, E. Isufi, G.J.T. Leus, Alejandro Ribeiro
DOI: https://doi.org/10.1109/ICASSP.2018.8462381
More Info
expand_more

Published Date

2018

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Microelectronics

Research Group

Signal Processing Systems

Abstract

In this work, we jointly exploit tools from graph signal processing and control theory to drive a bandlimited graph signal that is being diffused on a random time-varying graph from a subset of nodes. As our main contribution, we rely only on the statistics of the graph to introduce the concept of controllability in the mean, and therefore drive the signal on the expected graph to a desired bandlimited state. A mean-square error (MSE) analysis is performed for two main tasks: i) to highlight the role played by the signal bandwidth and the control nodes to the deviation from the mean signal of a particular realization; and ii) to select the control nodes and design the control signal that minimize this MSE. Numerical results validate the introduced controllability in the mean framework and show its ability to cope with time-varying topologies.

Files

Control_of_Graph_Signals_Over_... (.pdf)
(.pdf | 0.416 Mb)
- Embargo expired in 13-03-2019