Random Matrix Theory for Homogenization on Graphs

Abstract

I will discuss the random matrix theory behind two-component random resistor networks on general graphs. This involves random submatrices of the graph’s Gamma projection operator, with the particular realization of the submatrix determined by the disorder of the conductances. Certain combinations of graph symmetries together with different models for the random conductances lead to exactly computable spectral statistics. Our recent results lead to exact spectral statistics for the uniform spanning tree model on a diamond hierarchical lattice. Joint work with Ken Golden, Elena Cherkaev, Ben Murphy, Han Le.