The code below aims to enhance the accessibility and reproducibility of my work. If you find the code useful, please cite the associated papers.

Graph coarsening
Obtain coarse graphs that are spectrally similar to a target graph and reproduce the results from “Graph reduction with spectral and cut guarantees” published in JMLR 2019.
code, bibtex, paper, blogpost

Attention & convolution
Code reproducing results from “On the relationship between self-attention and convolution” to appear in ICLR 2020.
code, bibtex, preprint, blogpost

Solve the path extrapolation problem and reproduce results from “Path extrapolation with graph neural networks” published in IJCAI 2019.
code, bibtex, paper, blogpost

Joint Fourier Transform
The routines for Fourier analysis of graph signals are part of the GSPBOX. The code below reproduces results from “A time-vertex signal processing framework” published in TSP 2018.
code, bibtex, preprint

Time-vertex stationarity
Model stochastic graph signals that vary in time and reproduce the results from “Stationary time-vertex signal processing” published in JASP 2019.
code, bibtex, paper

ARMA graph filters
Use these filters to process graph signals while taking into account long-range interactions between nodes, as in “Autoregressive Moving Average Graph Filtering” published in TSP 2017.
code, bibtex, preprint, blogpost

Independent implementations and applications: ARMA convolution (Pytorch Geometric, Spektral, see also this); SPINNER graph partitioning on GIRAPH (Okapi)

All code is distributed freely.