2000 character limit reached
After the Explosion: Dirichlet Forms and Boundary Problems for Infinite Graphs
Published 14 Sep 2011 in math.FA and math.PR | (1109.3137v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.