On distributional graph signals
Graph signal processing (GSP) studies graph-structured data, where the central concept is the vector space of graph signals. To study a vector space, we have many useful tools up our sleeves. However, uncertainty is omnipresent in practice, and using a vector to model a real signal can be erroneous in some situations. In this paper, we want to use the Wasserstein space as a replacement for the vector space of graph signals, to account for signal stochasticity. The Wasserstein is strictly more general in which the classical graph signal space embeds isometrically. An element in the Wasserstein space is called a distributional graph signal. On the other hand, signal processing for a probability space of graphs has been proposed in the literature. In this work, we propose a unified framework that also encompasses existing theories regarding graph uncertainty. We develop signal processing tools to study the new notion of distributional graph signals. We also demonstrate how the theory can be applied by using real datasets.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Distributional Signals for Node Classification in Graph Neural Networks
In graph neural networks (GNNs), both node features and labels are examples of graph signals, a key notion in graph signal processing (GSP). While it is common in GSP to impose signal smoothness constraints in learning a…
ClassificationNode ClassificationEdge centrality and the total variation of graph distributional signals
This short note is a supplement to [1], in which the total variation of graph distributional signals is introduced and studied. We introduce a different formulation of total variation and relate it to the notion of edge …
RelationDistributionally Robust Graph Learning from Smooth Signals under Moment Uncertainty
We consider the problem of learning a graph from a finite set of noisy graph signal observations, the goal of which is to find a smooth representation of the graph signal. Such a problem is motivated by the desire to inf…
Graph LearningRobust Graph Learning Under Wasserstein Uncertainty
Graphs are playing a crucial role in different fields since they are powerful tools to unveil intrinsic relationships among signals. In many scenarios, an accurate graph structure representing signals is not available at…
Graph LearningGraph2TS: Structure-Controlled Time Series Generation via Quantile-Graph VAEs
Although recent generative models can produce time series with close marginal distributions, they often face a fundamental tension between preserving global temporal structure and modeling stochastic local variations, pa…