English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

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