Essential selfadjointness of the graph-Laplacian
arXiv:0802.0133 · doi:10.1063/1.2953684
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 is selfadjoint in , and so in particular that it has a unique spectral resolution, determined by a projection valued measure on the Borel subsets of the infinite half-line. We prove that generically our graph Laplace operator will have continuous spectrum. For a given infinite graph with conductance function , we set up a system of finite graphs with periodic boundary conditions such the finite spectra, for an ascending family of finite graphs, will have the Laplace operator for as its limit.
50 pages with TOC and figures
References in corpus (3)
Cited by in corpus (19)
- Path Laplacian operators and superdiffusive processes on graphs. I. One-dimensional case
- The problem of deficiency indices for discrete Schrödinger operators on locally finite graphs
- Time regularity and long-time behavior of parabolic -Laplace equations on infinite graphs
- Essential self-adjointness for combinatorial Schrödinger operators II- Metrically non complete graphs
- Essential self-adjointness of magnetic Schrödinger operators on locally finite graphs
- Laplaciens de graphes infinis I Graphes métriquement complets
- Unboundedness of adjacency matrices of locally finite graphs
- Localization criteria for Anderson models on locally finite graphs
- Infinite networks and variation of conductance functions in discrete Laplacians
- A Glazman-Povzner-Wienholtz Theorem on graphs
- Spectral Theory for Discrete Lapacians
- A note on self-adjoint extensions of the Laplacian on weighted graphs
- Stochastic incompleteness for graphs and weak Omori-Yau maximum principle
- Laplacians on infinite graphs: discrete vs continuous
- Zeta functions of graphs, their symmetries and extended Catalan numbers
- Frames and Factorization of Graph Laplacians
- After the Explosion: Dirichlet Forms and Boundary Problems for Infinite Graphs
- Infinite-Dimensional Measure Spaces and Frame Analysis
- Toeplitz Operators in Hilbert Space over Graphs