An inverse problem for semilinear wave equations on metric tree graphs
Sergei Avdonin, Matti Lassas, Jinpeng Lu, Medet Nursultanov, Lauri Oksanen

TL;DR
This paper addresses an inverse problem for semilinear wave equations on metric tree graphs, aiming to recover the graph's structure, edge lengths, potential, and nonlinear coefficient from boundary data.
Contribution
It introduces a method to uniquely determine the graph's connectivity, edge lengths, potential, and nonlinear coefficient using boundary measurements.
Findings
Successfully reconstructs graph structure and parameters from boundary data
Provides a theoretical framework for inverse problems on metric graphs
Extends inverse problem techniques to nonlinear wave equations
Abstract
We study the inverse problem for a semilinear wave equation on metric tree graphs. From the Dirichlet-to-Neumann map defined at all but one of the boundary vertices, we recover unknown connectivity of the graph, lengths of the edges, the time-independent potential and the time-dependent coefficient of the nonlinear term of the equation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
