Abstract. We study the uniqueness question for two inverse problems on graphs. Both problems consist in finding (possibly complex) edge or nodal based quantities from boundary measurements of solutions to the Dirichlet problem associated with a weighted graph Laplacian plus a diagonal perturbation. The weights can be thought of as a discrete conductivity and the diagonal perturbation as a discrete Schrödinger potential. We use a discrete analogue to the complex geometric optics approach to show that if the linearized problem is solvable about some conductivity (or Schrödinger potential) then the linearized problem is solvable for almost all conductivities (or Schrödinger potentials) in a suitable set. We show that the conductivities (or Schrödinger potentials) in a certain set are determined uniquely by boundary data, except on a zero measure set. This criterion for solvability is used in a statistical study of graphs where the conductivity or Schrödinger inverse problem is solvable.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.