Bernoulli flow and optimal delocalisation for Erdös-Rényi graphs

We present a new dynamical way of establishing local laws for sparse random matrices, the Bernoulli flow method. It is based on a Markovian jump process, where the entries of the matrix jump independently from 0 to 1 at rate one. As an application, we show optimal (up to a constant) isotropic delocalisation for bulk eigenvectors of Erdös-Rényi graphs with edge probability p \geq (log N)^2/N. In the same regime, we obtain a local law with optimal (up to a constant) error bounds. Joint work with Antti Knowles.