A Calderón type inverse problem for tree graphs

• 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ón 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.

Ämnesord

NATURVETENSKAP  -- Matematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics (hsv//eng)

Nyckelord

Dirichlet-to-Neumann map

Tree graphs

Inverse conductivity problem

Quantum graphs

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)