activity
20102019
most citedDiscussions on "Riemann manifold Langevin and Hamiltonian Monte Carlo methods"

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

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…