We have decided to discontinue the publication of preprints on our preprint server end of 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.
We consider random Schrödinger equations on
Denote by
The proof is based on analyzing the phase cancellations of multiple scatterings on the random potential by expanding the propagator into a sum of Feynman graphs. In this paper we consider the non-recollision graphs and prove that the amplitude of the {\it non-ladder} diagrams is smaller than their "naive size" by an extra
This is the first rigorous result showing that the improvement over the naive estimates on the Feynman graphs grows as a power of the small parameter with the exponent depending linearly on the number of vertices. This estimate allows us to prove the convergence of the perturbation series. The analysis of the recollision graphs is given in the companion paper (L. Erdös, M. Salmhofer and H.-T. Yau, Quantum diffusion of the random Schrödinger evolution in the scaling limit II. The recollision diagrams. Submitted to Commun. Math. Phys.)