arXiv:1001.3440 [math-ph]AbstractReferencesReviewsResources
Simplicity of eigenvalues in Anderson-type models
Sergey Naboko, Roger Nichols, Günter Stolz
Published 2010-01-20Version 1
We show almost sure simplicity of eigenvalues for several models of Anderson-type random Schr\"odinger operators, extending methods introduced by Simon for the discrete Anderson model. These methods work throughout the spectrum and are not restricted to the localization regime. We establish general criteria for the simplicity of eigenvalues which can be interpreted as separately excluding the absence of local and global symmetries, respectively. The criteria are applied to Anderson models with matrix-valued potential as well as with single-site potentials supported on a finite box.
Comments: 20 pages
Keywords: anderson-type models, eigenvalues, discrete anderson model, methods work throughout, sure simplicity
Tags: journal article
Related articles: Most relevant | Search more
arXiv:math-ph/0611001 (Published 2006-11-01)
Positivity of Lyapunov exponents for Anderson-type models on two coupled strings
arXiv:1202.2915 [math-ph] (Published 2012-02-14)
An Estimate on the Number of Eigenvalues of a Quasiperiodic Jacobi Matrix of Size $n$ Contained in an Interval of Size $n^{-C}$
Simplicity of eigenvalues in the Anderson model