Pseudo-randomness and localization

Abstract
The degree of pseudo-randomness of several sequences and its relation to Anderson localization is investigated. It is rated with the help of the chi 2 test and the spectral test, which are extensively used in computer science. The relationship between this rating and localization for tight-binding models with hopping to nearest neighbours and to next-nearest neighbours in one dimension is investigated. The results are relevant for localization in systems which are studied in 'quantum chaos', where the potentials are pseudo-random but not truly random.