36 citations · 77 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020★ 20 cited
Graph Tikhonov Regularization and Interpolation via Random Spanning Forests
Yusuf Pilavci, Pierre-Olivier Amblard, Simon Barthelme +1
Novel Monte Carlo estimators are proposed to solve both the Tikhonov regularization (TR) and the interpolation problems on graphs. These estimators are based on random spanning for…
cs.DM2019
Smoothing graph signals via random spanning forests
Yusuf Y. Pilavci, Pierre-Olivier Amblard, Simon Barthelmé +1
Another facet of the elegant link between random processes on graphs and Laplacian-based numerical linear algebra is uncovered: based on random spanning forests, novel Monte-Carlo…