Random colourings of aperiodic graphs: Ergodic and spectral properties
arXiv:0709.0821
Abstract
We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic measures, and prove an ergodic theorem. For covariant operators of finite range defined on those graphs, we show the existence and self-averaging of the integrated density of states, as well as the non-randomness of the spectrum. Our main result establishes Lifshits tails at the lower spectral edge of the graph Laplacian on bond percolation subgraphs, for sufficiently small probabilities. Among other assumptions, its proof requires exponential decay of the cluster-size distribution for percolation on rather general graphs.
arXiv comment26 pages
References in corpus (9)
- Random walks on supercritical percolation clusters
- Spectral measure of large random Hankel, Markov and Toeplitz matrices
- Pure Point Dynamical and Diffraction Spectra
- Spectral Analysis of Percolation Hamiltonians
- Random Tilings: Concepts and Examples
- Hamiltonians on discrete structures: Jumps of the integrated density of states and uniform convergence
- Spectral asymptotics of the Laplacian on supercritical bond-percolation graphs
- Uniform existence of the integrated density of states for models on $\ZZ^d$
- Equality of Lifshitz and van Hove exponents on amenable Cayley graphs
Cited by in corpus (5)
- Hamiltonians on discrete structures: Jumps of the integrated density of states and uniform convergence
- Ergodicity and dynamical localization for Delone-Anderson operators
- Equality of Lifshitz and van Hove exponents on amenable Cayley graphs
- Absence of singular continuous diffraction for discrete multi-component particle models
- Continuity of eigenfunctions of uniquely ergodic dynamical systems and intensity of Bragg peaks