arXiv · 1512.05834
A Structured Inverse Spectrum Problem For Infinite Graphs
Abstract
It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $Λ$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $Λ$. Moreover, the set of limit points of $Λ$ equals the essential spectrum of $A$, and the isolated points of $Λ$ are eigenvalues of $A$ with multiplicity one. It is also shown that any two such matrices constructed by our method are approximately unitarily equivalent.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Keivan Hassani Monfared, Ehssan Khanmohammadi. 2016-10-05. A Structured Inverse Spectrum Problem For Infinite Graphs. https://arxiv.org/abs/1512.05834
Cite the original work for its findings. Save a collection to share your selection of sources.