Essential self-adjointness of the Laplacian on weighted graphs: harmonic functions, stability, characterizations and capacity
Atsushi Inoue, Sean Ku, Jun Masamune, Rados{\l}aw K. Wojciechowski

TL;DR
This paper explores conditions for the essential self-adjointness of the weighted Laplacian on graphs, introducing new characterizations involving capacity and stability, with applications to Schrödinger operators and star-like graphs.
Contribution
It provides two novel characterizations of essential self-adjointness for the Laplacian on weighted graphs, including a new capacity-based approach and stability analysis.
Findings
New capacity-based characterization of essential self-adjointness.
Extension of results to Schrödinger operators and star-like graphs.
Connections established between self-adjointness and the $ ext{l}^2$-Liouville property.
Abstract
We give two characterizations for the essential self-adjointness of the weighted Laplacian on birth-death chains. The first involves the edge weights and vertex measure and is classically known; however, we give another proof using stability results, limit point-limit circle theory and the connection between essential self-adjointness and harmonic functions. The second characterization involves a new notion of capacity. Furthermore, we also analyze the essential self-adjointness of Schr\"odinger operators, use the characterizations for birth-death chains and stability results to characterize essential self-adjointness for star-like graphs, and give some connections to the -Liouville property.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpectral Theory in Mathematical Physics · Advanced Mathematical Modeling in Engineering · Graph theory and applications
