arXiv · 2002.03670
A Calder\'on type inverse problem for tree graphs
Abstract
We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula which relates this matrix to the pairwise weighted distances of the leaves of the tree and, thus, allows to recover the weighted tree. This result can be viewed as a counterpart of the Calder\'on problem in the analysis of PDEs. In contrast to earlier results on inverse problems for metric graphs, we only assume knowledge of the Dirichlet-to-Neumann matrix for a fixed energy, not of a whole matrix-valued function.
Explore related subjects
Keep this discovery
Hannes Gernandt, Jonathan Rohleder. 2020-02-10. A Calder\'on type inverse problem for tree graphs. https://arxiv.org/abs/2002.03670
Cite the original work for its findings. Save a collection to share your selection of sources.