Essential selfadjointness of the graph-Laplacian
Palle E.T. Jorgensen

TL;DR
This paper proves that the graph Laplacian operator on infinite graphs, relevant in various fields, is inherently selfadjoint and typically has continuous spectrum, with a framework for approximating its spectral data via finite graphs.
Contribution
It establishes the essential selfadjointness of the graph Laplacian with conductance functions and provides a method to approximate spectral data through finite graph sequences.
Findings
The Laplace operator is automatically essentially selfadjoint.
The spectrum of the operator is generically continuous.
Finite graph approximations converge to the spectral properties of the infinite graph.
Abstract
We study the operator theory associated with such infinite graphs as occur in electrical networks, in fractals, in statistical mechanics, and even in internet search engines. Our emphasis is on the determination of spectral data for a natural Laplace operator associated with the graph in question. This operator will depend not only on , but also on a prescribed positive real valued function defined on the edges in . In electrical network models, this function will determine a conductance number for each edge. We show that the corresponding Laplace operator is automatically essential selfadjoint. By this we mean that is defined on the dense subspace (of all the real valued functions on the set of vertices with finite support) in the Hilbert space . The conclusion is that the closure of the operator…
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.
