Joint Vertex-Time Filtering on Graphs With Random Node-Asynchronous Updates

被引:0
|
作者
Teke, Oguzhan [1 ]
Vaidyanathan, Palghat P. [1 ]
机构
[1] CALTECH, Dept Elect Engn, Pasadena, CA 91125 USA
关键词
State-space methods; Signal processing; Mathematical model; Analytical models; Numerical stability; Eigenvalues and eigenfunctions; Transient analysis; Autonomous networks; asynchronous updates; randomized iterations; vertex-time filters; INFINITE PRODUCTS; ALGORITHMS; STABILITY; SYSTEMS; SERIES;
D O I
10.1109/ACCESS.2021.3109288
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In graph signal processing signals are defined over a graph, and filters are designed to manipulate the variation of signals over the graph. On the other hand, time domain signal processing treats signals as time series, and digital filters are designed to manipulate the variation of signals in time. This study focuses on the notion of vertex-time filters, which manipulates the variation of a time-dependent graph signal both in the time domain and graph domain simultaneously. The key aspects of the proposed filtering operations are due to the random and asynchronous behavior of the nodes, in which they follow a collect-compute-broadcast scheme. For the analysis of the randomized vertex-time filtering operations, this study first considers the random asynchronous variant of linear discrete-time state-space models, in which each state variable gets updated randomly and independently (and asynchronously) in every iteration. Unlike previous studies that analyzed similar models under certain assumptions on the input signal, this study considers the model in the most general setting with arbitrary time-dependent input signals, which lay the foundations for the vertex-time graph filtering operations. This analysis shows that exponentials continue to be eigenfunctions in a statistical sense in spite of the random asynchronous nature of the model. This study also presents the necessary and sufficient condition for the mean-squared stability and shows that stability of the underlying state transition matrix is neither necessary nor sufficient for the mean-squared stability of the randomized asynchronous recursions. Then, the proposed filtering operations are proven to be mean-square stable if and only if the filter, the graph operator and the update probabilities satisfy a certain condition. The results show that some unstable vertex-time graph filters (in the synchronous case) can be implemented in a stable manner in the presence of randomized asynchronicity, which is also demonstrated by numerical examples.
引用
收藏
页码:122801 / 122818
页数:18
相关论文
共 22 条
  • [1] IIR Filtering on Graphs With Random Node-Asynchronous Updates
    Teke, Oguzhan
    Vaidyanathan, Palghat P.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 (68) : 3945 - 3960
  • [2] Random Node-Asynchronous Updates on Graphs
    Teke, Oguzhan
    Vaidyanathan, Palghat P.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2019, 67 (11) : 2794 - 2809
  • [3] NODE-ASYNCHRONOUS IMPLEMENTATION OF RATIONAL FILTERS ON GRAPHS
    Teke, Oguzhan
    Vaidyanathan, P. P.
    2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 7530 - 7534
  • [4] NODE-ASYNCHRONOUS SPECTRAL CLUSTERING ON DIRECTED GRAPHS
    Teke, Oguzhan
    Vaidyanathan, P. P.
    2020 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2020, : 5325 - 5329
  • [5] Node-Asynchronous Implementation of Filter Banks on Graphs
    Teke, Oguzhan
    Vaidyanathan, P. P.
    2020 54TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2020, : 460 - 464
  • [6] Methods of adaptive signal processing on graphs using vertex-time autoregressive models
    Variddhisai, Thiernithi
    Mandic, Danilo
    arXiv, 2020,
  • [7] Random Node-Asynchronous Graph Computations: Novel Opportunities for Discrete-Time State-Space Recursions
    Teke, Oguzhan
    Vaidyanathan, P. P.
    IEEE SIGNAL PROCESSING MAGAZINE, 2020, 37 (06) : 64 - 73
  • [8] Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
    Thomas Bläsius
    Philipp Fischbeck
    Tobias Friedrich
    Maximilian Katzmann
    Theory of Computing Systems, 2023, 67 : 28 - 51
  • [9] Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
    Blaesius, Thomas
    Fischbeck, Philipp
    Friedrich, Tobias
    Katzmann, Maximilian
    THEORY OF COMPUTING SYSTEMS, 2023, 67 (01) : 28 - 51
  • [10] Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
    Blaesius, Thomas
    Fischbeck, Philipp
    Friedrich, Tobias
    Katzmann, Maximilian
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154