Abstract

In network science, the interplay between dynamical processes and the underlying topologies of complex systems has led to a diverse family of models with different interpretations. In graph signal processing, this is manifested in the form of different graph shifts and their induced algebraic systems. In this paper, we propose the unifying Z-Laplacian framework, whose instances can act as graph shift operators. As a generalization of the traditional graph Laplacian, the Z-Laplacian spans the space of all possible Z -matrices, i.e., real square matrices with nonpositive off-diagonal entries. We show that the Z -Laplacian can model general continuous-time dynamical processes, including information flows and epidemic spreading on a given graph. It is also closely related to general nonnegative graph filters in the discrete time domain. We showcase its flexibility by considering two applications. First, we consider a …

Date

July 20, 2017

Authors

Xiaoran Yan, Brian M Sadler, Robert J Drost, L Yu Paul, Kristina Lerman

Journal

IEEE Journal of Selected Topics in Signal Processing

Volume

11

Issue

6

Pages

774-784

Publisher

IEEE