On quantum percolation in finite regular graphs
arXiv:1409.2000 · doi:10.1007/s00023-014-0382-9
Abstract
The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate quantitatively the empirical measure of the eigenvalues and the delocalization of the eigenvectors to the spectrum of the adjacency operator of the percolation on the infinite graph. Secondly, we prove that percolation on an infinite regular tree with degree at least preserves the existence of an absolutely continuous spectrum if the removal probability is small enough. These two results are notably relevant for bond percolation on a uniformly sampled regular graph or a Cayley graph with large girth.
arXiv comment33 pages
References in corpus (12)
- Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
- Quantum ergodicity on large regular graphs
- Resonant delocalization for random Schrödinger operators on tree graphs
- Spectral Analysis of Percolation Hamiltonians
- Sparse regular random graphs: Spectral density and eigenvectors
- Spectrum of non-Hermitian heavy tailed random matrices
- The problem of deficiency indices for discrete Schrödinger operators on locally finite graphs
- The rank of diluted random graphs
- Absolutely Continuous Spectrum for Random Schroedinger Operators on the Bethe Strip
- Ballistic Behavior for Random Schrödinger Operators on the Bethe Strip
- Absolutely continuous spectrum for multi-type Galton Watson trees
- Absolutely Continuous Spectrum for the Anderson Model on Some Tree-like Graphs