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

DOI10.1137/21M1439936MaRDI QIDQ6157968zbMATH OpenOpenAlexFDO

Authors Emilia Blåsten, H. Isozaki, M. Lassas, Jinpeng Lu

Publication date 22 June 2023

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

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

zbMATH Keywords

heat equationunique continuationinverse spectral probleminverse problem for random walk

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Random walks on graphs (05C81) Heat equation (35K05)

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.

Recommendations

• On the solvability of the discrete conductivity and Schrödinger inverse problems
• A Calderón type inverse problem for tree graphs
• Diffusions on graphs, Poisson problems and spectral geometry
• Inverse problems for random walks on trees: network tomography
• scientific article; zbMATH DE number 1490049

Cites work

• scientific article; zbMATH DE number 3130517 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 2144581 (Why is no real title available?)
• scientific article; zbMATH DE number 2114368 (Why is no real title available?)
• scientific article; zbMATH DE number 2122438 (Why is no real title available?)
• scientific article; zbMATH DE number 872108 (Why is no real title available?)
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• scientific article; zbMATH DE number 2188813 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• $\omega$-Harmonic Functions and Inverse Conductivity Problems on Networks
• A Harnack inequality for homogeneous graphs and subgraphs
• A nonlinear inverse problem inspired by three-dimensional diffuse tomography
• An Identification Problem for Multiterminal Networks: Solving for the Traffic Matrix from Input-Output Measurements
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Boundary control and quasiphotons in the problem of reconstruction of a Riemannian manifold via dynamical data
• Boundary control and tomography of Riemannian manifolds (the BC-method)
• Boundary regularity for the Ricci equation, geometric convergence, and Gel'fand's inverse boundary problem
• Boundary spectral inverse problem on a class of graphs (trees) by the BC method
• Circular planar graphs and resistor networks
• Coalescing random walks and voting on connected graphs
• Correlation based passive imaging with a white noise source
• Determining Resistances from Boundary Measurements in Finite Networks
• Diffuse tomography: the isotropic case
• Discrete geometric analysis
• Electrical impedance tomography
• Electrical networks with prescribed current and applications to random walks on graphs
• Equivalence of time-domain inverse problems and boundary spectral problems
• Explicit inversion formulas for a model in diffuse tomography
• Foundations of Modern Probability
• Gelfand's inverse problem for the graph Laplacian
• Graph Laplacians and topology
• Hitting Time and Inverse Problems for Markov Chains
• Introduction to analysis on graphs
• Introduction to quantum graphs
• Inverse boundary spectral problems
• Inverse problem for the Riemannian wave equation with Dirichlet data and Neumann data on disjoint sets
• Inverse problems and invisibility cloaking for FEM models and resistor networks
• Inverse problems for Sturm–Liouville operators on bush-type graphs
• Inverse problems for linear and non-linear hyperbolic equations
• Inverse problems for quantum trees
• Inverse problems for quantum trees. II: Recovering matching conditions for star graphs
• Inverse problems for random walks on trees: network tomography
• Inverse problems for the connection Laplacian
• Inverse problems on graphs: recovering the tree of strings by the BC-method
• Inverse spectral problems for Sturm–Liouville operators on graphs
• Inverse spectral problems for differential operators on arbitrary compact graphs
• Inverse spectral problems on a closed manifold
• Isospectral graphs and isoperimetric constants
• Laplacians and the Cheeger inequality for directed graphs
• Markov Chains
• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Network tomography
• Network tomography: recent developments
• Numerical testing in determination of sound speed from a part of boundary by the BC-method
• On Isospectral Graphs.
• On an inverse problem for tree-like networks of elastic strings
• On inverse problems for finite trees
• On the construction of virtual interior point source travel time distances from the hyperbolic Neumann-to-Dirichlet map
• On the reconstruction of diffusions from first-exit time distributions
• Optical tomography in medical imaging
• Optical tomography on graphs
• Planar electric networks. I
• Planar electric networks. II
• Quantitative unique continuation for operators with partially analytic coefficients. Application to approximate control for waves
• Random walk and the heat equation
• Random walks and heat kernels on graphs
• Recent results in the theory of graph spectra
• Reconstruction and interpolation of manifolds. I: The geometric Whitney problem
• Reconstruction and stability in Gelfand's inverse interior spectral problem
• Recovery of a smooth metric via wave field and coordinate transformation reconstruction
• Recursive recovery of a family of Markov transition probabilities from boundary value data
• Scattering control for the wave equation with unknown wave speed
• Source identification for the wave equation on graphs
• Spektren endlicher Grafen
• Stability of the unique continuation for the wave operator via Tataru inequality and applications
• Stability of the unique continuation for the wave operator via Tataru inequality: the local case
• The Laplacian on rapidly branching trees
• The inverse problem in reducible Markov chains
• To the reconstruction of a riemannian manifold via its spectral data (Bc–Method)
• Unique continuation for solutions to pde's; between hörmander's theorem and holmgren' theorem
• Upper bounds for eigenvalues of the discrete and continuous Laplace operators

Cited in

(4)

• Gelfand's inverse problem for the graph Laplacian
• Inverse problems for locally perturbed lattices -- discrete Hamiltonian and quantum graph
• On the solvability of the discrete conductivity and Schrödinger inverse problems
• The nonlinear heat equation on \(W\)-random graphs

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)