We study eigenfunctions of the discrete laplacian on large regular graphs, and prove a ``quantum ergodicity'' result for these eigenfunctions : for most eigenfunctions $\psi$, the probability measure $|\psi(x)|^2$, defined on the set of vertices, is close to the uniform measure.

Although our proof is specific to regular graphs, we'll discuss possibilities of adaptation to more general models, like the Anderson model on regular graphs.