Semi-supervised Graph Rewiring with the Dirichlet Principle

In this paper, we propose the concept of graph rewiring and we show how to exploit it in an un-supervised setting so that commute times can be better estimated by state-of-the-art methods. Our experiments show a significant improvement with respect to unsupervised graph rewiring.