We study the problem of prediction for evolving graph data. We formulate the problem as the minimization of a convex objective encouraging sparsity and low-rank of the solution, that reflect natural graph properties. The convex formulation allows to obtain oracle inequalities and efficient solvers. We provide empirical results for our algorithm and comparison with competing methods, and point out two open questions related to compressed sensing and algebra of low-rank and sparse matrices.
@article{arxiv.1205.1406,
title = {Graph Prediction in a Low-Rank and Autoregressive Setting},
author = {Emile Richard and Pierre-Andre Savalle and Nicolas Vayatis},
journal= {arXiv preprint arXiv:1205.1406},
year = {2012}
}