Dirichlet problems on graphs with ends
From MaRDI portal
Publication:401057
DOI10.1016/J.JMAA.2014.06.064zbMATH Open1300.31012arXiv1406.6331OpenAlexW2020787280MaRDI QIDQ401057FDOQ401057
Authors: Tony L. Perkins 
Publication date: 26 August 2014
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Abstract: In classical potential theory, one can solve the Dirichlet problem on unbounded domains such as the upper half plane. These domains have two types of boundary points; the usual finite boundary points and another point at infinity. W. Woess has solved a discrete version of the Dirichlet problem on the ends of graphs analogous to having multiple points at infinity and no finite boundary. Whereas C. Kiselman has solved a similar version of the Dirichlet problem on graphs analogous to bounded domains. In this work, we combine the two ideas to solve a version of the Dirichlet problem on graphs with finitely many ends and boundary points of the Kiselman type.
Full work available at URL: https://arxiv.org/abs/1406.6331
Recommendations
Cites Work
- Potential theory on infinite networks
- Random Walks on Infinite Graphs and Groups - a Survey on Selected topics
- Martin and End Compactifications for Nonlocally Finite Graphs
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Harmonic functions on infinite graphs
- Classical potential theory and its probabilistic counterpart.
- Title not available (Why is that?)
- Convex and subharmonic functions on graphs
- Subharmonic functions on a directed graph
- Subharmonic functions on discrete structures
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Dirichlet problems on graphs with ends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401057)
