Graph-time convolutional neural networks

Spatiotemporal data can be represented as a process over a graph, which captures their spatial relationships either explicitly or implicitly. How to leverage such a structure for learning representations is one of the key challenges when working with graphs. In this paper, we represent the spatiotemporal relationships through product graphs...

Nonlinear State-Space Generalizations of Graph Convolutional Neural Networks

Graph convolutional neural networks (GCNNs) learn compositional representations from network data by nesting linear graph convolutions into nonlinearities. In this work, we approach GCNNs from a state-space perspective revealing that the graph convolutional module is a minimalistic linear state-space model, in which the state update matrix is...

Topological Volterra Filters

To deal with high-dimensional data, graph filters have shown their power in both graph signal processing and data science. However, graph filters process signals exploiting only pairwise interactions between the nodes, and they are not able to exploit more complicated topological structures. Graph Volterra models, on the other hand, are also...

Sampling Graph Signals with Sparse Dictionary Representation

Graph sampling strategies require the signal to be relatively sparse in an alternative domain, e.g. bandlimitedness for reconstructing the signal. When such a condition is violated or its approximation demands a large bandwidth, the reconstruction often comes with unsatisfactory results even with large samples. In this paper, we propose an...

State-space based network topology identification

In this work, we explore the state-space formulation of network processes to recover the underlying network structure (local connections). To do so, we employ subspace techniques borrowed from system identification literature and extend them to the network topology inference problem. This approach provides a unified view of the traditional...

Privacy-Preserving Distributed Graph Filtering

With an increasingly interconnected and digitized world, distributed signal processing and graph signal processing have been proposed to process its big amount of data. However, privacy has become one of the biggest challenges holding back the widespread adoption of these tools for processing sensitive data. As a step towards a solution, we...

Node varying regularization for graph signals

While regularization on graphs has been successful for signal reconstruction, strategies for controlling the bias-variance trade-off of such methods have not been completely explored. In this work, we put forth a node varying regularizer for graph signal reconstruction and develop a minmax approach to design the vector of regularization...

Topology-Aware Joint Graph Filter and Edge Weight Identification for Network Processes

Data defined over a network have been successfully modelled by means of graph filters. However, although in many scenarios the connectivity of the network is known, e.g., smart grids, social networks, etc., the lack of well-defined interaction weights hinders the ability to model the observed networked data using graph filters. Therefore, in...

CNN architectures for GRAPH data

In this ongoing work, we describe several architectures that generalize convolutional neural networks (CNNs) to process signals supported on graphs. The general idea of the replace time invariant filters with graph filters to generate convolutional features and to replace pooling with sampling schemes for graph signals. The different...

Sparsest Network Support Estimation: A Submodular Approach

In this work, we address the problem of identifying the underlying network structure of data. Different from other approaches, which are mainly based on convex relaxations of an integer problem, here we take a distinct route relying on algebraic properties of a matrix representation of the network. By describing what we call possible...

Distributed Wiener-Based Reconstruction of Graph Signals

This paper proposes strategies for distributed Wiener-based reconstruction of graph signals from subsampled measurements. Given a stationary signal on a graph, we fit a distributed autoregressive moving average graph filter to a Wiener graph frequency response and propose two reconstruction strategies: i) reconstruction from a single temporal...

Graph Sampling with and Without Input Priors

In this paper the focus is on sampling and reconstruction of signals supported on nodes of arbitrary graphs or arbitrary signals that may be represented using graphs, where we extend concepts from generalized sampling theory to the graph setting. To recover such signals from a given set of samples, we develop algorithms that incorporate prior...

Distributed Analytical Graph Identification

An analytical algebraic approach for distributed network identification is presented in this paper. The information propagation in the network is modeled using a state-space representation. Using the observations recorded at a single node and a known excitation signal, we present algorithms to compute the eigenfrequencies and eigenmodes of...

Control of graph signals over random time-varying graphs

In this work, we jointly exploit tools from graph signal processing and control theory to drive a bandlimited graph signal that is being diffused on a random time-varying graph from a subset of nodes. As our main contribution, we rely only on the statistics of the graph to introduce the concept of controllability in the mean, and therefore...

Sampling and Reconstruction of Signals on Product Graphs

In this paper, we consider the problem of subsampling and reconstruction of signals that reside on the vertices of a product graph, such as sensor network time series, genomic signals, or product ratings in a social network. Specifically, we leverage the product structure of the underlying domain and sample nodes from the graph factors. The...

Space-shift sampling of graph signals

A novel scheme for sampling graph signals is proposed. Space-shift sampling can be understood as a hybrid scheme that combines selection sampling -- observing the signal values on a subset of nodes - and aggregation sampling - observing the signal values at a single node after successive aggregation of local data. Under the assumption of...