Spectral analysis for adjacency operators on graphs

DOI10.1007/S00023-007-0339-3MaRDI QIDQ2463352zbMATH OpenOpenAlexFDO

Authors Serge Richard, Rafael Tiedra de Aldecoa, Marius Măntoiu

Publication date 5 December 2007

Published in Annales Henri Poincaré (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math-ph/0603020

zbMATH Keywords

absolutely continuous spectrumAdjacency operatoreigenvaluegraphsingular continuous spectrumXY Hamiltonian

Mathematics Subject Classification ID

Spectrum, resolvent (47A10) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We put into evidence graphs with adjacency operator whose singular subspace is prescribed by the kernel of an auxiliary operator. In particular, for a family of graphs called admissible, the singular continuous spectrum is absent and there is at most an eigenvalue located at the origin. Among other examples, the one-dimensional XY model of solid-state physics is covered. The proofs rely on commutators methods.

Review text

Let \(X\) be a graph without multiple edges and loops and \(\deg(X) = \sup_{x \in X} \deg(x)\) finite, where \(\deg(x)\) is the degree of the vertex \(x.\) The paper is concerned with the spectral properties of the adjacency operator \((Hf)(x) := \sum_{y \backsim x}f(y)\) on \(\mathcal{H}= \ell^2(X),\) where \(y \backsim x\) indicates that the vertices \(y\) and \(x\) are connected. It is known that \(H\) is bounded and self-adjoint on \(\mathcal{H}\) with norm bounded by \(\deg(X).\) Few examples are known of adjacency operators on graphs with purely absolutely continuous spectrum. A non-empty singular spectrum is possibly and even a dense point spectrum. A particular case of the main result proved in this paper is that for a family of graphs called admissible, the spectrum of \(H\) is purely absolutely continuous, except at the origin where it may have an eigenvalue. The approach uses the so-called method of the weakly conjugate operator which is a commutator method claimed to be easier to use than that of Mourre in this case. It is shown that the graph associated with the one-dimensional \(XY\) Hamiltonian of solid-state physics is admissible.

Recommendations

• Spectral analysis on graph-like spaces
• Adjacency matrices of semigraphs and their spectral analysis
• scientific article; zbMATH DE number 3940
• Spectral analysis of metric graphs and related spaces
• scientific article; zbMATH DE number 2149405
• scientific article; zbMATH DE number 964896
• Adjacency spectrum and the Laplacian spectrum of a graph
• On the spectral characterizations of graphs
• Publication:4946130
• Spectral analysis of (sequences of) graph matrices

Cited in

(18)

• Spectral analysis of the Laplacian acting on discrete cusps and funnels
• Spectral analysis for perturbed operators on Carnot groups
• Decay estimates for unitary representations with applications to continuous- and discrete-time models
• Spectral analysis of (sequences of) graph matrices
• A New Formula Relating Localisation Operators to Time Operators
• scientific article; zbMATH DE number 6492830 (Why is no real title available?)
• Commutator criteria for strong mixing
• The method of the weakly conjugate operator: Extensions and applications to operators on graphs and groups
• Spectral analysis of some graphs with infinite rays
• A model of Josephson junctions on Boson systems—Currents and entropy production rate
• Spectral and scattering theory for Schrödinger operators on perturbed topological crystals
• A graphical approach of the spectral theory in the (max,+) algebra
• To the spectral theory of quantum graphs with summable matrix potentials
• Spectral analysis of t-path signed graphs
• Spectral and scattering theory for topological crystals perturbed by infinitely many new edges
• Limiting absorption principle for long-range perturbation in the discrete triangular lattice setting
• Abstract theory of pointwise decay with applications to wave and Schrödinger equations
• The spectrum of the averaging operator on a network (metric graph)

This page was built for publication: Spectral analysis for adjacency operators on graphs

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