Essential self-adjointness for combinatorial Schr\"odinger operators I- Metrically complete graphs
Nabila Torki-Hamza (Universit\'e de Carthage)

TL;DR
This paper proves that on metrically complete weighted graphs with bounded degree, the weighted graph Laplacian and Schr"odinger operators are essentially self-adjoint, extending previous results and providing a new proof technique involving harmonic functions.
Contribution
It extends essential self-adjointness results to more general weighted graphs and introduces a method using harmonic functions to analyze Schr"odinger operators.
Findings
Weighted graph Laplacian is essentially self-adjoint on metrically complete graphs.
Schr"odinger operators are essentially self-adjoint if their quadratic form is bounded below.
Constructs a harmonic function to relate Schr"odinger operators to Laplacians.
Abstract
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant weight. The main result in this work states that on any metrically complete weighted graph with bounded degree, the weighted graph Laplacian is essentially self-adjoint and the same holds for the Schr\"odinger operator provided the associated quadratic form is bounded from below. We construct for the proof a strictly positive and harmonic function which allows us to write any Schr\"odinger operator as a weighted graph Laplacian modulo a unitary transform.
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
