Mean quantum percolation (Q1687384): Difference between revisions

With a graph having a countable number of vertices one can associate an adjacency operator and its spectral measure. The paper under review is devoted to the analysis of of the spectral measures associated with random graphs. The first tool to prove the regularity of the spectrum is a careful labeling of the vertices. A second tool is a minimal path technique that is used to upper bound the multiplicities of eigenvalues. As a consequence, it is proved that the supercritical Bernoulli bond percolation in the two-dimensional lattice has a continuous part. A second result gives an upper bound for the total mass of atoms of the expected spectral measure for a unimodular random tree. Examples of random graphs with purely continuous spectrum are given as well as a list of open questions.