Spectral estimates for the Schr\"odinger operators with sparse potentials on graphs
Grigori Rozenblum, Michael Solomyak

TL;DR
This paper extends the concept of sparse potentials to a broad class of graphs with global dimension greater than two, analyzing the asymptotic behavior of negative eigenvalues of Schrödinger operators as the potential strength increases.
Contribution
It generalizes the construction of sparse potentials to various graphs and characterizes their impact on the spectral properties of Schrödinger operators.
Findings
Any prescribed asymptotic behavior of negative eigenvalues can be realized with sparse potentials.
The results apply to both combinatorial and metric graphs with dimension D>2.
A similar approach is valid for the two-dimensional lattice .
Abstract
The construction of "sparse potentials", suggested in \cite{RS09} for the lattice , is extended to a wide class of combinatorial and metric graphs whose global dimension is a number . For the Schr\"odinger operator on such graphs, with a sparse potential , we study the behavior (as ) of the number of negative eigenvalues of . We show that by means of sparse potentials one can realize any prescribed asymptotic behavior of under very mild regularity assumptions. A similar construction works also for the lattice , where D=2.
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 · Numerical methods in inverse problems · Mathematical Analysis and Transform Methods
