Graph Filters and the Z-Laplacian. Yan, X., Sadler, B. M., Drost, R. J., Yu, P. L., & Lerman, K. IEEE Journal of Selected Topics in Signal Processing, 11(6):774–784, 2017.
abstract   bibtex   
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 wireless communications networking problem modeled with a graph, where the framework can be applied to model the effects of the underlying communications protocol and traffic. Second, we examine a structural brain network from the perspective of low- to high-frequency connectivity.
@ARTICLE{Yan2017,
  author =       {Xiaoran Yan and Brian M. Sadler and Robert J. Drost and Paul L. Yu and Kristina Lerman},
  title =        {Graph Filters and the Z-Laplacian},
  journal =      {IEEE Journal of Selected Topics in Signal Processing},
  year =         {2017},
  volume =       {11},
  number =       {6},
  pages =        {774--784},
  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 wireless communications networking problem modeled with a graph, where the framework can be applied to model the effects of the underlying communications protocol and traffic. Second, we examine a structural brain network from the perspective of low- to high-frequency connectivity.},
}
Downloads: 0
About
Documentation
Keywords
Search
Users
Terms and Conditions of Use
Privacy Policy
Sitemap
© BibBase.org 2021