Deconvolution on graphs via linear programming

Abstract: The main challenge addressed in this paper is to identify individual terms in a superposition of heat kernels on a graph. We establish geometric conditions on the vertices at which these heat kernels are centered and find bounds on the time parameter governing the evolution under the heat semigroup that guarantee a successful recovery. This result can be viewed as a type of deconvolution on a graph.

This page was built for publication: Deconvolution on graphs via linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435280)