Boundary value problems on weighted networks (Q1003733)

Continuing their earlier work, the authors develop a discrete vector analysis on weighted graphs in \(n\) dimensions based on a construction of tangent spaces at the vertices. After introducing discrete analogues of \textit{grad} and \textit{div}, they also define a discrete Laplace-Beltrami operator and its adjoint, and give representation formulas for both. There follow discrete analogues of integration by parts, of the co-normal derivative and of Green's identities. This allows to consider boundary value problems on finite subsets of weighted graphs and to prove a corresponding Fredholm's alternative. The authors give two applications of their theory: the inverse problem of identifying anisotropic conductivities from first-kind data (using a discrete Dirichlet principle), and a second order difference approximation of a constant coefficient elliptic problem with third-kind boundary conditions, on a square grid.