Establishes geometric conditions and time bounds guaranteeing recovery of superposed heat kernels on graphs via linear programming, for both uniform and location-dependent times.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.FA 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deconvolution on graphs via linear programming
Establishes geometric conditions and time bounds guaranteeing recovery of superposed heat kernels on graphs via linear programming, for both uniform and location-dependent times.