Essential self-adjointness for combinatorial Schrödinger operators II- Metrically non complete graphs
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...