The Canopy Graph and Level Statistics for Random Operators on Trees
- 116 Downloads
For operators with homogeneous disorder, it is generally expected that there is a relation between the spectral characteristics of a random operator in the infinite setup and the distribution of the energy gaps in its finite volume versions, in corresponding energy ranges. Whereas pure point spectrum of the infinite operator goes along with Poisson level statistics, it is expected that purely absolutely continuous spectrum would be associated with gap distributions resembling the corresponding random matrix ensemble. We prove that on regular rooted trees, which exhibit both spectral types, the eigenstate point process has always Poissonian limit. However, we also find that this does not contradict the picture described above if that is carefully interpreted, as the relevant limit of finite trees is not the infinite homogenous tree graph but rather a single-ended ‘canopy graph.’ For this tree graph, the random Schrödinger operator is proven here to have only pure-point spectrum at any strength of the disorder. For more general single-ended trees it is shown that the spectrum is always singular – pure point possibly with singular continuous component which is proven to occur in some cases.
KeywordsRandom operators Level statistics Canopy graph Anderson localization Absolutely continuous spectrum Singular continuous spectrum
Mathematics Subject Classifications (2000)47B80 60K40
Unable to display preview. Download preview PDF.
- 8.Altshuler, B., Shklovski, B.I.: Repulsion of energy levels and conductivity of metal samples. Sov. Phys. JETP 64, 127–135 (1986)Google Scholar
- 11.Boole, G.: On the comparison of transcendentals, with certain application to the theory of definite integrals. Philos. Trans. Roy. Soc. London Ser. A 147, 780 (1857)Google Scholar
- 12.Breuer, J.: Singular continuous and dense point spectrum for sparse trees with finite dimensions. Available at math.SP/0608159 (2006)Google Scholar
- 19.Disertori, M., Rivasseau, V.: Random matrices and the Anderson model. Avalable at math-ph/0310021 (2003)Google Scholar
- 24.Graf, G.M., Vaghi, A.: A remark on an estimate by Minami. Available at math-ph/0604033 (2006).Google Scholar
- 26.Jacobson, D., Miller, S.D., Rivin, I., Rudnick, Z.: Eigenvalue spacing for regular graphs. In: Hejhal D.A. et al. (eds.), Emerging Applications in Number Theory. Spinger, Berlin (1999)Google Scholar
- 28.Klein, A.: The Anderson metal-insulator transition on the Bethe lattice. In: Iagolnitzer, D. (ed.), Proceedings of the XIth International Congress on Mathematical Physics, Paris, France, July 18-23, 1994. International Press, Cambridge, MA (1995)Google Scholar
- 44.Woess, W.: Random walks on infinite graphs and groups. In: Cambridge Tracts in Mathematics, vol. 138. Cambridge University Press, Cambridge (2000)Google Scholar