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 three 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call