Essential self-adjointness for combinatorial Schrödinger operators II- Metrically non complete graphs
Abstract
We consider weighted graphs, we equip them with a metric structure given by a weighted distance, and we discuss essential self-adjointness for weighted graph Laplacians and Schrödinger operators in the metrically non complete case.
Origin : Files produced by the author(s)
Loading...