A structured inverse spectrum problem for infinite graphs

DOI10.1016/J.LAA.2017.10.025zbMATH Open1377.05111arXiv1512.05834OpenAlexW2963243561MaRDI QIDQ1688865FDOQ1688865

Authors: Keivan Hassani Monfared, Ehssan Khanmohammadi 

Publication date: 12 January 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $Lambda$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $Lambda$. Moreover, the set of limit points of $Lambda$ equals the essential spectrum of $A$, and the isolated points of $Lambda$ are eigenvalues of $A$ with multiplicity one. It is also shown that any two such matrices constructed by our method are approximately unitarily equivalent.

Full work available at URL: https://arxiv.org/abs/1512.05834

Recommendations

• A STRUCTURED INVERSE SPECTRUM PROBLEM FOR INFINITE GRAPHS AND UNBOUNDED OPERATORS
• scientific article; zbMATH DE number 733160
• scientific article; zbMATH DE number 3861206
• The Spectrum of an Infinite Graph
• Spectra of infinite graphs: two methods of computation

zbMATH Keywords

essential spectruminfinite graphJacobian methodapproximate unitary equivalenceinverse spectrum problemisospectral matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Infinite graphs (05C63) Inverse problems in linear algebra (15A29) Spectrum, resolvent (47A10)

Cites Work

• Title not available (Why is that?)
• The numerically stable reconstruction of a Jacobi matrix from spectral data
• Perturbation theory for linear operators.
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(C^*\)-algebras by example
• Construction of acyclic matrices from spectral data
• Eine Umkehrung der Sturm-Liouvilleschen Eigenwertaufgabe. Bestimmung der Differentialgleichung durch die Eigenwerte
• Construction of matrices with a given graph and prescribed interlaced spectral data
• The Inverse Sturm-Liouville Problem and the Rayleigh-Ritz Method
• Title not available (Why is that?)
• A structured inverse spectrum problem for infinite graphs
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph

Cited In (5)

• Title not available (Why is that?)
• A STRUCTURED INVERSE SPECTRUM PROBLEM FOR INFINITE GRAPHS AND UNBOUNDED OPERATORS
• Title not available (Why is that?)
• A structured inverse spectrum problem for infinite graphs
• Direct and Inverse Finite-Dimensional Spectral Problems on Graphs

This page was built for publication: A structured inverse spectrum problem for infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688865)