Abstract
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the completed graphs play an essential role. A version of the Dirichlet problem is solved. Self adjoint Laplace operators and the probability semigroups they generate are constructed using reflecting and absorbing conditions on subsets of the graph boundary.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.