Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs

From MaRDI portal
Publication:6157968

DOI10.1137/21M1439936zbMATH Open1517.05067arXiv2107.00494OpenAlexW4379881576MaRDI QIDQ6157968FDOQ6157968


Authors: Emilia Blåsten, H. Isozaki, M. Lassas, Jinpeng Lu Edit this on Wikidata


Publication date: 22 June 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: We study the inverse problem of determining a finite weighted graph (X,E) from the source-to-solution map on a vertex subset BsubsetX for heat equations on graphs, where the time variable can be either discrete or continuous. We prove that this problem is equivalent to the discrete version of the inverse interior spectral problem, provided that there does not exist a nonzero eigenfunction of the weighted graph Laplacian vanishing identically on B. In particular, we consider inverse problems for discrete-time random walks on finite graphs. We show that under a novel geometric condition (called the Two-Points Condition), the graph structure and the transition matrix of the random walk can be uniquely recovered from the distributions of the first passing times on B, or from the observation on B of one realization of the random walk.


Full work available at URL: https://arxiv.org/abs/2107.00494




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs

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