# Reconstructing undirected graphs from eigenspaces

26 Mar 2016Yohann De CastroThibault EspinassePaul Rochet

In this paper, we aim at recovering an undirected weighted graph of $N$ vertices from the knowledge of a perturbed version of the eigenspaces of its adjacency matrix $W$. For instance, this situation arises for stationary signals on graphs or for Markov chains observed at random times... (read more)

PDF Abstract

No code implementations yet. Submit your code now