arXiv · 2104.14652
Fast Multiscale Diffusion on Graphs
Abstract
Diffusing a graph signal at multiple scales requires computing the action of the exponential of several multiples of the Laplacian matrix. We tighten a bound on the approximation error of truncated Chebyshev polynomial approximations of the exponential, hence significantly improving a priori estimates of the polynomial order for a prescribed error. We further exploit properties of these approximations to factorize the computation of the action of the diffusion operator over multiple scales, thus reducing drastically its computational cost.
Explore related subjects
Keep this discovery
Sibylle Marcotte, Amélie Barbe, Rémi Gribonval, Titouan Vayer, Marc Sebban, Pierre Borgnat, Paulo Gonçalves. 2021-04-29. Fast Multiscale Diffusion on Graphs. https://arxiv.org/abs/2104.14652
Cite the original work for its findings. Save a collection to share your selection of sources.