Springer Proceedings in Mathematics Volume 11
Erwin Bolthausen (with kind permission of Alexander Drewitz)
c Bildarchiv des Mathematischen Forschungsinstituts J¨urgen G¨artner Oberwolfach
For further volumes: http://www.springer.com/series/8806
Jean-Dominique Deuschel Barbara Gentz Wolfgang K¨onig Max von Renesse Michael Scheutzow Uwe Schmock Editors
Probability in Complex Physical Systems In Honour of Erwin Bolthausen and J¨urgen G¨artner
123
Editors Jean-Dominique Deuschel Max von Renesse Michael Scheutzow TU Berlin Institute for Mathematics Berlin Germany Wolfgang K¨onig Weierstrass Institute for Applied Analysis and Stochastics Berlin Germany
Barbara Gentz University of Bielefeld Faculty of Mathematics Bielefeld Germany Uwe Schmock Vienna University of Technology Institute for Mathematical Methods in Economics Vienna Austria
ISSN 2190-5614 ISBN 978-3-642-23810-9 e-ISBN 978-3-642-23811-6 DOI 10.1007/978-3-642-23811-6 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2012930493 Mathematical Subject Classification (2010): 60FXX, 60GXX, 82BXX, 82CXX, 82DXX c Springer-Verlag Berlin Heidelberg 2012 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Preface
Probabilistic approaches have played a prominent role in the study of complex physical systems for more than 30 years. Two outstanding protagonists of this approach are J¨urgen G¨artner and Erwin Bolthausen, to whom this volume is dedicated. Each of them was honored with a workshop in 2010; these took place at Technische Universit¨at Berlin, where they both worked for decades. The conferences were devoted to the most important aspects of their interests: ‘Random media’ and ‘Probabilistic techniques in complex physical systems’. They were organized by the DFG Research Unit FOR718 Analysis and Stochastics in Complex Physical Systems on the occasion of J¨urgen’s 60th birthday and Erwin’s 65th birthday. J¨urgen and Erwin have been recognized for decades as outstanding experts in the probabilistic treatment, spiced with a dash of analysis, of problems in statistical mechanics and related fields. Their high esteem and profound impact are reflected by their great number of students and collaborators and by their large number of invitations to conferences, editorships, etc. over the years. Erwin started his career with various distributional limit results of central limit and martingale type, but soon turned to problems coming from large-deviation analysis, like Laplace approximations and the maximum entropy principle. One of the main types of problems that accompanied his career for decades are intricate questions about the extremal behavior of the volume of the path of a random walk or a Wiener sausage and of the intersection of two independent such objects. Here he has derived a number of striking and deep results over the years. Another core area of his research, which is closely related, is the description of paths under the influence of a self-attracting or self-repellent force, partially motivated by the polaron problem. In particular, Erwin derived several fundamental properties of polymers with various kinds of interactions. His results also had a strong influence on the understanding of interface models with gradient-type interactions. Some of his favorite subjects in recent years have been random walks in random environments, and spin glasses and the little-understood phenomenon of ultrametricity. J¨urgen was educated within the Russian school in the 1970s, pioneering the application of large deviation analysis to various models in statistical mechanics. v
vi
Preface
One of the fundamental tools, the G¨artner–Ellis theorem, is a side-result of his thesis. Later he built up a theory of large deviations for projective limits. Also his contributions to the McKean–Vlasov equation remain a vital element of the theory. Over the last two decades, he has been one of the most active researchers on the parabolic Anderson model, the Cauchy problem for the heat equation with random potential. Many of the above results were derived in close collaboration with students, colleagues, and friends, many of whom also presented talks on the occasion of the two 2010 workshops. The present volume collects 20 research and review papers by participants in the fields in which J¨urgen and Erwin are best known for their contributions. Most of these papers are, in some way or another, influenced by J¨urgen’s and Erwin’s work, and all of them present state-of-the-art results in topics that accompanied the two for decades and received significant impacts from them over the years. All papers have been peer-refereed according to highest standards. Almost half of the contributions to this volume are devoted to the parabolic Anderson model, one of the most active research fields of J¨urgen. For more than 20 years, J¨urgen has formed and extended this subject like nobody else. J¨urgen’s coauthors and students and their students and colleagues give an impressive account on some of the latest developments for the parabolic Anderson model, among which there are results on the long-time behavior for various time-dependent and time-independent potentials, and novel aspects like several moving catalysts, acceleration/deceleration, and front propagation. Another main topic covered by this volume is random polymers interacting with random and nonrandom environment and their critical behavior, a topic that received much attention from Erwin and his coauthors. Furthermore, special aspects of branching processes and interacting measure-valued processes are considered, topics that J¨urgen studied many years ago. Finally, this volume offers a choice of results on various models that Erwin worked on or was interested in for many years, like Parisi’s formulas for the generalized random energy model, metastability, hydrodynamic limits for gradient models and dimers. In total, the collection of 20 papers in this volume presents important contributions to and surveys on research areas that are of current interest and have been strongly influenced by these two eminent mathematicians. It is not too much to say that these fields have benefited tremendously from their work. Berlin June 2011
Jean-Dominique Deuschel Barbara Gentz Wolfgang K¨onig Max von Renesse Michael Scheutzow Uwe Schmock
Workshop on Probabilistic Techniques in Statistical Mechanics Celebrating the 65th Birthday of Erwin Bolthausen Organized by: Jean-Dominique Deuschel, Wolfgang K¨onig, Max von Renesse, Michael Scheutzow and the DFG Research Unit FOR718 Analysis and Stochastics in Complex Physical Systems Venue: Technische Universit¨at Berlin, Institute for Mathematics, Str. des 17. Juni 136, 10623 Berlin, Germany, Room MA043 Period: October 14–16, 2010 Speaker/Title: G´erard Ben Arous (Courant Institute New York) Extreme gaps in the spectrum of random matrices Michiel van den Berg (University of Bristol) Minimization of Dirichlet eigenvalues with geometric constraints Anton Bovier (University of Bonn) Almost sure ageing David Brydges (University of British Columbia, Vancouver) The strong interaction limit of continuous-time weakly self-avoiding walk Francesco Caravenna (University of Padova) The weak coupling limit of disordered copolymer models Amir Dembo (Stanford University) Low temperature expansion for matrix models Tadahisa Funaki (University of Tokyo) Hydrodynamic limit for two- and three-dimensional Young diagrams Giambattista Giacomin (University Paris Diderot – Paris 7) Impurities, defects and critical phenomena Ilya Goldsheid (Queen Mary College) Simple random walks in one-dimensional random environment: limiting behaviour in the sub-diffusive regimes Alice Guionnet (ENS Lyon) Potts model on random graphs Frank den Hollander (Leiden University and EURANDOM) Variational approach to copolymers near linear interfaces vii
viii
Dmitry Ioffe (Technion) Stretched polymers in random environment Nicola Kistler (University of Bonn) Traveling waves through the spin glass Alain-Sol Sznitman (ETH Zurich) Random walks and random interlacements B´eatrice de Tili`ere (University Pierre et Marie Curie, Paris) The critical Z-invariant Ising model via dimers: local statistics and combinatorics Fabio Toninelli (ENS Lyon) On the zero temperature dynamics of the three-dimensional Ising model (joint work with P. Caputo, F. Martinelli and F. Simenhaus) B´alint T´oth (Technical University Budapest) Superdiffusive lower bound for self-repelling processes in the critical dimension Yvan Velenik (University of Geneva) A new approach to the Aizenman–Higuchi theorem Wendelin Werner (University Paris-Sud 11 in Orsay and ENS Paris) Self-interacting random walks with finite spatial interaction range Ofer Zeitouni (University of Minnesota and Weizmann Institute of Science) Fluctuations of the (discrete) Gaussian free field, and branching random walks
Workshop on Random Media Celebrating the 60th Birthday of Ju¨ rgen G¨artner Organized by: Jean-Dominique Deuschel, Wolfgang K¨onig, Max von Renesse, Michael Scheutzow and the DFG Research Unit FOR718 Analysis and Stochastics in Complex Physical Systems Venue: Technische Universit¨at Berlin, Institute for Mathematics, Str. des 17. Juni 136, 10623 Berlin, Germany, Room MA043 Period: April 8–10, 2010 Speaker/Title: G´erard Ben Arous (Courant Institute New York) Random matrices and Morse theory in many dimensions: the case of mixtures of spherical spin glasses and the (possibility of) full replica symmetry breaking Marek Biskup (UCLA and University of South Bohemia) Eigenvalue order statistics for the random Schr¨odinger operator Erwin Bolthausen (University of Zurich) Kac-type interactions in a one-dimensional system with a continuous symmetry Anton Bovier (University of Bonn) Metastability in Ginzburg–Landau type stochastic differential equations Donald Dawson (University of Ottawa) McKean–Vlasov mutation–selection dynamics Klaus Fleischmann (Berlin) Recent properties of states of super-˛-stable motion with branching of index 1 C ˇ Mark Freidlin (University of Maryland) Perturbation theory for systems with many invariant measures Markus Heydenreich (Free University of Amsterdam) Random walk on high-dimensional incipient infinite cluster Frank den Hollander (Leiden University and EURANDOM) The mathematical work of J¨urgen G¨artner Gr´egory Maillard (University of Provence, Marseille) Parabolic Anderson model with a finite number of moving catalysts Peter M¨orters (University of Bath) Geometric approaches to intermittency in the parabolic Anderson model ix
x
Tom Mountford (EPF Lausanne) Parabolic Anderson model with voter model noise Alejandro Ram´ırez (Pontifical Catholic University of Chile) Ballisticity conditions for random walk in random environment Vladas Sidoravicius (CWI Amsterdam) On random growth and random walks in dynamically evolving random environment Rongfeng Sun (University of Singapore) Annealed versus quenched asymptotics for the parabolic Anderson model with moving catalysts or traps Alain-Sol Sznitman (ETH Zurich) Disconnecting discrete cylinders
Contents
Laudatio: The Mathematical Work of Jurgen ¨ G¨artner... . . . . . . . . . . . . . . . . . . . Frank den Hollander 1 G¨artner–Ellis Large Deviation Principle . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Kolmogorov–Petrovskii–Piskunov Equation . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Dawson–G¨artner Projective Limit Large Deviation Principle . . . . . . . . . . . . . . 4 McKean–Vlasov Equation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5 Parabolic Anderson Model.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 6 Personal Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Part I
1 1 3 4 5 6 8 9
The Parabolic Anderson Model
The Parabolic Anderson Model with Long Range Basic Hamiltonian and Weibull Type Random Potential .. . . . . .. . . . . . . . . . . . . . . . . . . . Stanislav Molchanov and Hao Zhang 1 Dedication and Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 The Annealed and Quenched Asymptotic Properties ˚ ˛ of u.t; 0/ with Weibull Potential V .x; !m /: P fV ./ > xg D exp x˛ . . . 3 The Annealed and Quenched Asymptotic Properties of u.t; 0/ with Potential V .x; !m / of the Form ˛ P fV ./ > xg D exp f x˛ L.x/g . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Concluding Remark . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior of Lyapunov Exponents . . . . .. . . . . . . . . . . . . . . . . . . . Gr´egory Maillard, Thomas Mountford, and Samuel Sch¨opfer 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Model .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.2 Voter Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.3 Lyapunov Exponents .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
13 13 20
23 30 30 33 34 34 34 35 xi
xii
Contents
1.4 Main Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Proof of Theorems 1.1 and 1.3 . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Coarse-Graining and Skeletons.. . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.2 The Bad Environment Set BE . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.3 The Bad Random Walk Set BW . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.4 Proof of Theorem 1.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Proof of Theorem 1.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Proof of Theorem 1.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Precise Asymptotics for the Parabolic Anderson Model with a Moving Catalyst or Trap . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Adrian Schnitzler and Tilman Wolff 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Moving Trap .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Localized Initial Condition . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.2 Homogeneous Initial Condition . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Moving Catalyst . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Spectral Properties of Higher-Order Anderson Hamiltonians . . . . . . . . 3.2 Application to Annealed Higher Moment Asymptotics .. . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Parabolic Anderson Model with a Finite Number of Moving Catalysts.. . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Fabienne Castell, Onur G¨un, and Gr´egory Maillard 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Model .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.2 Lyapunov Exponents and Intermittency . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.3 Literature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.4 Main Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.5 Discussion .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Proof of Theorem 1.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Proof of Theorems 1.2–1.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Proof of Theorem 1.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 Proof of Theorem 1.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Proof of Theorem 1.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5 Proof of Corollary 1.1 .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Appendix.. . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
38 39 40 42 48 51 51 62 67 69 70 73 74 75 79 80 87 88 91 92 92 93 94 95 99 100 106 106 107 108 110 111 116
Survival Probability of a Random Walk Among a Poisson System of Moving Traps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 119 Alexander Drewitz, J¨urgen G¨artner, Alejandro F. Ram´ırez, and Rongfeng Sun 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 120 1.1 Model and Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 120
Contents
1.2 Relation to the Parabolic Anderson Model . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.3 Review of Related Results . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.4 Outline .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Annealed Survival Probability .. . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Existence of the Annealed Lyapunov Exponent .. .. . . . . . . . . . . . . . . . . . . . 2.2 Special Case D 0 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.3 Lower Bound on the Annealed Survival Probability . . . . . . . . . . . . . . . . . . 2.4 Upper Bound on the Annealed Survival Probability: The Pascal Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Quenched and Semi-Annealed Upper Bounds .. . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Existence and Positivity of the Quenched Lyapunov Exponent.. . . . . . . . . . . . 4.1 Shape Theorem and the Quenched Lyapunov Exponent .. . . . . . . . . . . . . 4.2 Proof of Shape Theorem for Bounded Ergodic Potentials . . . . . . . . . . . . 4.3 Existence of the Quenched Lyapunov Exponent for the PAM . . . . . . . . 4.4 Positivity of the Quenched Lyapunov Exponent.. .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Quenched Lyapunov Exponent for the Parabolic Anderson Model in a Dynamic Random Environment.. . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . J¨urgen G¨artner, Frank den Hollander, and Gr´egory Maillard 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Parabolic Anderson Model . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.2 Lyapunov Exponents .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.3 Literature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.4 Main Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.5 Discussion and Open Problems . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Proof of Theorems 1.1–1.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Proof of Theorem 1.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.2 Proof of Theorem 1.2(i).. . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.3 Proof of Theorem 1.2(ii) .. . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.4 Proof of Theorem 1.2(iii) . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.5 Proof of Theorem 1.3(i).. . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.6 Proof of Theorem 1.3(iii) . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.7 Proof of Theorem 1.3(ii) .. . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Proof of Theorems 1.4–1.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Proof of Theorem 1.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 Proof of Theorem 1.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.3 Proof of Theorem 1.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Asymptotic Shape and Propagation of Fronts for Growth Models in Dynamic Random Environment .. . . . . . . . . . . . . . . . . . . . Harry Kesten, Alejandro F. Ram´ırez, and Vladas Sidoravicius 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Spread of an Infection in a Moving Population (DA > 0; DB > 0) . . . . . . . 2.1 Shape Theorem .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
xiii
122 123 125 126 126 128 131 133 138 144 144 148 151 154 157 159 160 160 162 163 167 168 170 170 171 173 177 179 180 186 189 189 189 191 192 195 195 199 199
xiv
Contents
2.2 Phase Transition .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 The Stochastic Combustion Process (DA D 0, DB > 0).. . . . . . . . . . . . . . . . . . . 3.1 Shape Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 The Stochastic Combustion Process in Dimension d D 1 .. . . . . . . . . . . 3.3 Activated Random Walks Model and Absorbing State Phase Transition .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Modified Diffusion Limited Aggregation (DA > 0; DB D 0) . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . The Parabolic Anderson Model with Acceleration and Deceleration . . . . . . Wolfgang K¨onig and Sylvia Schmidt 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Assumptions and Preliminaries .. . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Model Assumptions .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.2 Variational Formulas .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Results . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Five Phases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 Moment Asymptotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.3 Variational Convergence .. . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Proof of Variational Convergence (Proposition 3.3) .. . . .. . . . . . . . . . . . . . . . . . . . 5 Proof for Phases 1–3 (Theorem 3.1).. . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 6 Proof for Phase 4 (Theorem 3.2) . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . A Scaling Limit Theorem for the Parabolic Anderson Model with Exponential Potential . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Hubert Lacoin and Peter M¨orters 1 Introduction and Main Results. . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Overview and Background . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.2 Statement of Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Proof of the Main Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.2 Auxiliary Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.3 Upper Bounds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.4 Analysis of the Variational Problem . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.5 Proof of the Almost Sure Asymptotics.. . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.6 Proof of the Weak Asymptotics . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.7 Proof of the Scaling Limit Theorem . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Concluding Remarks .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Part II
206 208 208 209 215 216 222 225 225 227 227 228 230 230 231 232 233 238 242 244 247 247 247 251 252 252 254 257 265 267 268 269 271 271
Self-Interacting Random Walks and Polymers
The Strong Interaction Limit of Continuous-Time Weakly Self-Avoiding Walk .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 275 David C. Brydges, Antoine Dahlqvist, and Gordon Slade
Contents
1 Domb–Joyce Model: Discrete Time . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 The Continuous-Time Weakly Self-Avoiding Walk . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Fixed-Length Walks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.2 Two-Point Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Copolymers at Selective Interfaces: Settled Issues and Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Francesco Caravenna, Giambattista Giacomin, and Fabio Lucio Toninelli 1 Copolymers and Selective Solvents . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 A Basic Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.2 The (General) Copolymer Model . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.3 The Free Energy: Localization and Delocalization .. . . . . . . . . . . . . . . . . . . 1.4 The Phase Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.5 The Critical Behavior and a Word About Pinning Models .. . . . . . . . . . . 1.6 Organisation of the Chapter . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Localization Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Delocalization Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Fractional Moment Method: The General Principle .. . . . . . . . . . . . . . . . . . 3.2 Fractional Moment Method: Application . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Continuum Model and Weak Coupling Limit . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5 Path Properties.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.1 The Localized Phase . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.2 The Delocalized Phase . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Some Locally Self-Interacting Walks on the Integers . . . .. . . . . . . . . . . . . . . . . . . . Anna Erschler, B´alint T´oth, and Wendelin Werner 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Survey of Left–Right Symmetric Cases . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 When b > 0 and b=3 < a < b: The TRSM Regime? .. . . . . . . . . . . . . . 2.2 When b > 0 and a < b=3: The Stuck Case. . . . . .. . . . . . . . . . . . . . . . . . . . 2.3 When b 0 and a > b: The Slow Phase? . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.4 The Two Critical Cases . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.5 Stationary Measures for the Cases Where b > 0 and b=3 < a < b .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.6 Some Comments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Some Cases Without Left–Right Symmetry . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Setup and Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 The Scenario . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.3 Auxiliary Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.4 The Coupling .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.5 An Example with Logarithmic Behaviour . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.6 Ballistic Behaviour .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Some Open Questions.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
xv
275 277 278 281 286 289
289 289 291 293 294 298 299 300 302 302 303 304 306 307 308 310 313 313 318 318 319 320 322 323 326 327 327 329 331 332 334 336 337
xvi
Contents
References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 338 Stretched Polymers in Random Environment . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Dmitry Ioffe and Yvan Velenik 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Class of Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.2 Ballistic and Sub-Ballistic Phases . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.3 Lyapunov Exponents .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.4 Very Weak, Weak, and Strong Disorder . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Large Deviations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Ramifications for Ballistic Behavior . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.2 Proof of Lemma 1 .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Geometry of Typical Polymers . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Skeletons of Paths .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 Annealed Models.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.3 Quenched Models .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.4 Irreducible Decomposition and Effective Directed Structure .. . . . . . . . 3.5 Basic Partition Functions . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 The Annealed Model .. . . . . P . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.1 Asymptotics of tn D x tx;n . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.2 Geometry of Ka , Annealed LLN and CLT . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.3 Local Limit Theorem for the Annealed Polymer ... . . . . . . . . . . . . . . . . . . . 5 Weak Disorder .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.1 LLN at Supercritical Drifts . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.2 Very Weak Disorder.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.3 Convergence of Partition Functions .. . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.4 Quenched CLT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 6 Strong Disorder.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 6.1 Normalization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 6.2 Reduction to Basic Partition Functions . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 6.3 Fractional Moments .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Part III
339 339 340 342 343 344 345 346 347 348 348 349 350 354 355 356 356 357 358 359 359 360 361 364 365 366 366 367 368
Branching Processes
Multiscale Analysis: Fisher–Wright Diffusions with Rare Mutations and Selection, Logistic Branching System . . . .. . . . . . . . . . . . . . . . . . . . Donald A. Dawson and Andreas Greven 1 Motivation and Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Outline .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 The Fisher–Wright Model with Rare Mutation and Selection . . . . . . . . . . . . . . 2.1 A Two-Type Mean-Field Diffusion Model and Its Description .. . . . . . 2.2 Two Time Windows for the Spread of the Advantageous Type .. . . . . . 2.3 The Early Time Window as N ! 1 . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.4 The Late Time Window as N ! 1 . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
373 374 376 376 376 378 379 382
Contents
xvii
3 A Logistic Branching Random Walk and Its Growth . . .. . . . . . . . . . . . . . . . . . . . 3.1 The Logistic Branching Particle Model .. . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 The Early Time Window as N ! 1 . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.3 The Droplet Expansion and Crump–Mode–Jagers Processes.. . . . . . . . 3.4 Time Point of Emergence as N ! 1 . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.5 The Late Time Window as N ! 1 . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 The Duality Relation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.1 A Classical Duality Formula . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.2 The Genealogy and Duality . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.3 The Dual for General Type Space .. . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.4 Outlook on Set-Valued Duals. . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
388 388 390 391 394 395 398 398 400 401 406 407
Properties of States of Super-˛-Stable Motion with Branching of Index 1 C ˇ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Klaus Fleischmann, Leonid Mytnik, and Vitali Wachtel 1 Model: Super-˛-Stable Motion with Branching of Index 1 C ˇ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 Dichotomy of States at Fixed Times . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Absolutely Continuous States . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Dichotomy of Density Functions .. . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 Local H¨older Continuity of Continuous Density Functions . . . . . . . . . . 3.3 Some Transition Curiosity .. . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.4 H¨older Continuity at a Given Point . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.5 Some Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Main Tools to get the H¨older Statements . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Part IV
409
410 411 411 411 412 413 413 415 417 421
Miscellaneous Topics in Statistical Mechanics
A Quenched Large Deviation Principle and a Parisi Formula for a Perceptron Version of the GREM . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Erwin Bolthausen and Nicola Kistler 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 A Perceptron Version of the GREM . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Proofs . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 The Gibbs Variational Principle: Proof of Theorem 2.3.. . . . . . . . . . . . . . 3.2 The Dual Representation. Proof of the Theorem 2.5 . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Metastability: From Mean Field Models to SPDEs . . . . . .. . . . . . . . . . . . . . . . . . . . Anton Bovier 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Stochastic Ising Models.. . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 The Curie–Weiss Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
425 425 426 430 430 438 442 443 443 444 445
xviii
Contents
3 Large Deviations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Diffusions with Small Diffusivity . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 Jump Processes Under Rescaling . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.3 Markov Processes with Exponentially Small Transition Probabilities . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.4 Large Deviations by Massive Entropy Production . . . . . . . . . . . . . . . . . . . . 4 Limitations of the Large Deviation Approach and Alternatives . . . . . . . . . . . . 5 Capacity Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.1 Random Path Representation and Lower Bounds on Capacities . . . . . 5.2 Capacity Estimates for Mesoscopic Chains and the Return of d D 1 .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 6 Stochastic Partial Differential Equations .. . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 7 Open Issues .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 7.1 Initial Distributions and Regularity Theory .. . . . . . .. . . . . . . . . . . . . . . . . . . . 7.2 Canonical Constructions of Flows . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Hydrodynamic Limit for the r' Interface Model via Two-Scale Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Tadahisa Funaki 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Setting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.2 The Ginzburg–Landau r' Interface Model . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.3 Main Result . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2 A Priori Estimates .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3 Proof of Theorem 1.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Derivative of .t/. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 The Term I2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.3 The Term I1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.4 Summary and Completion of the Proof of Theorem 1.1 . . . . . . . . . . . . . . 4 Validity of Assumption A for Convex Potentials . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.1 Assumption A-(2) .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.2 Assumption A-(1) .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . Statistical Mechanics on Isoradial Graphs .. . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . C´edric Boutillier and B´eatrice de Tili`ere 1 Introduction .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Transfer Matrices, Star Transformations, and Z-Invariance .. . . . . . . . . 1.2 Conformal Field Theory and Discrete Complex Analysis . . . . . . . . . . . . 2 Discrete Complex Analysis on Isoradial Graphs . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.1 Discrete Holomorphic and Discrete Harmonic Functions . . . . . . . . . . . . 2.2 Discrete Exponential Functions . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2.3 Geometric Integrability of Discrete Cauchy–Riemann Equations .. . . 2.4 Generalization of the Operator @N . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
447 448 448 449 449 450 452 454 456 458 459 460 460 461 463 463 464 465 466 469 470 471 471 473 479 479 479 480 489 491 491 493 495 495 495 497 498 498
Contents
3 Dimer Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.1 Dirac Operator and Its Inverse.. . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.2 Dirac Operator and Dimer Model . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 3.3 Other Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4 Ising Model .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.1 Conformal Invariance .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4.2 The Two-Dimensional Ising Model as a Dimer Model . . . . . . . . . . . . . . . 5 Other Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.1 Random Walk and the Green Function . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 5.2 q-Potts Models and the Random Cluster Model .. .. . . . . . . . . . . . . . . . . . . . 5.3 6-Vertex and 8-Vertex Models .. . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . References . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . .
xix
499 501 502 503 504 505 507 508 508 509 510 510
Part I
The Parabolic Anderson Model
The Parabolic Anderson Model with Long Range Basic Hamiltonian and Weibull Type Random Potential Stanislav Molchanov and Hao Zhang
Abstract We study the quenched and annealed asymptotics for the solutions of the lattice parabolic Anderson problem in the situation in which the underlying random walk has long jumps and belongs to the domain of attraction of the stable process. This type of stochastic dynamics has appeared in recent work on the evolution of populations. The i.i.d random potential in our case is unbounded from above with regular Weibull type tails. Similar models but with the local basic Hamiltonian (lattice Laplacian) were analyzed in the very first work on intermittency for the parabolic Anderson problem by J. G¨artner and S. Molchanov. We will show that the long-range model demonstrates the new effect. The annealed (moment) and quenched (almost sure) asymptotics of the solution have the same order in contrast to the case of the local models for which these orders are essentially different.
1 Dedication and Introduction Asymptotic analysis of the Anderson parabolic problem, the surrounding bifurcations (depending on the tail behavior of the random potential), the phenomenon of intermittency, etc., were the central topics in the research activity of J¨urgen G¨artner and his school starting from the early 1990s. I am pleased to have collaborated with J¨urgen in this area. The present paper (with my US student H. Zhang ) is closely related to the early stage of J¨urgen’s and my work and is dedicated to J¨urgen on the occasion of his 60th birthday. S. Molchanov H. Zhang () Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, NC 28223, USA e-mail:
[email protected] J.-D. Deuschel et al. (eds.), Probability in Complex Physical Systems, Springer Proceedings in Mathematics 11, DOI 10.1007/978-3-642-23811-6 2, © Springer-Verlag Berlin Heidelberg 2012
13
14
S. Molchanov and H. Zhang
We thank the reviewer of the first version of this paper for numerous corrections and improvements. We took these remarks into account in the preparation of the final text. We also gratefully acknowledge the help of J. Whitmeyer. The Anderson parabolic problem can appear in the following situation. Assume that at the moment t D 0. we have on the lattice Z d the particle field n.0; x/. The r.v.s n.0; x/, x 2 Z d , are i.i.d (for instance, Poissonian) with mean value 0 D En.0; x/. The parameter 0 is the initial density of the population. The stochastic dynamics of the system include: (1) Division (or splitting) (independent for different particles) with rate .x/, annihilation (or death) with rate .x/; (2) Transition from a given position x to x C z with rate a.z/, x; z 2 Z d . P We will assume that a.z/ D a.z/ 0, a.0/ D 0 and z¤0 a.z/ D 1, i.e., is the rate of the exponentially distributed time that the underlying random walk spends in each site x 2 Z d . The random walk X.s/; s 0 has the following infinitesimal transition probabilities: P fX.s C ds/ D x C zjX.s/ D xg D a.z/ds; z ¤ 0: P fX.s C ds/ D xjX.s/ D xg D 1 a.z/ds:
(1)
We call the rate “diffusivity.” Let us introduce the operator L of this random walk and call it the basic Hamiltonian: X Lf .x/ D Œf .x C z/ f .x/a.z/; (2) z¤0
where f 2 l 1 .Z d /. P If Lf .x/ D f .x/ D 2d z¤0 Œf .x C z/ f .x/ is the lattice Laplacian, then we can call the underlying random walk the diffusion with diffusivity > 0. We will consider here the nonlocal random walk with long jumps: Lf .x/ D
X
Œf .x C z/ f .x/a.z/:
(3)
z¤0
Conditions on a.z/ will be presented later in Lemma 1.2. Clearly, the transition probabilities p.t; x; y/ depend on the difference z D y x (i.e., the process Xs has independent increments) and, due to the symmetry of a.z/, are symmetric. Furthermore, it follows easily from (1) that @p D .Lp/.t; 0; y/; p.0; 0; y/ D ı0 .y/: @t
(4)
This equation is most easily analyzed using the Fourier transform (characteristic function). To do so, we use the following lemma.
The Parabolic Anderson Model with Long Range Basic Hamiltonian
P
O Lemma 1.1. Define L.'/ D O Then, Lf .'/ D fO.'/L.'/.
b
z¤0 .1
15
cos.'; z//a.z/.
Proof. By definition,
b
Lf .'/ D
X x
D
X z¤0
D
X
ei.';x/
X a.z/.f .x C z/ f .x// z¤0
"
a.z/ e
i.';z/
X X ei.';xCz/ f .x C z/ ei.';x/ f .x/ x
#
x
X a.z/.ei.';z/ 1/fO.'/ D fO.'/ .1 cos.'; z//a.z/
z¤0
z¤0
O D fO.'/L.'/:
In the subsequent discussion, we use the following notation:
b
O Lf .'/ D fO.'/L.'/; fO.'/ D
X
O ei.';x/ f .x/; L.'/ D
x2Z d
X .1 cos.'; z//a.z/: z¤0
(5) Operator L is the bounded and self-adjoint in L2 .Z d /. In the dual Fourier space O L2 .T d ; d'/, it acts as the operator of multiplication by L.'/. The characteristic function of the random walk is X
E0 ei.';Xt / D
p.t; 0; y/ei.';y/ D p.t; O 0; '/;
y2Z d
where ' 2 Œ; /2 D T 2 . From (3), we have @pO O D L.'/; p.0; O 0; '/ D 1; @t
(6)
which gives the explicit expression O
p.t; O 0; '/ D et L.'/ : If
P z¤0
O a.z/jzj2 < 1, then L.'/ Ee
X.t / t
i. p /
.B';'/ 2 ,
j'j ! 0. For fixed 2 R2 :
! Eei
t !1
.B ; / 2
i.e., Xptts , s 2 Œ0; 1, is asymptotically two-dimensional Brownian motion with correlation matrix B (calculation not shown).
16
S. Molchanov and H. Zhang
P We are interested in the situation z¤0 a.z/jzj2 D 1. As usual in the theory of stable distributions, we impose the regularity condition on a.z/ given by (7). Lemma 1.2. (See [8]) Suppose a.z/ D
h. / jzj2C˛
1CO
1 jzj2
; z¤0
(7)
z 2 Œ; / D T 1 , h 2 C 2 .T 1 /, h > 0 and so satisfies jzj the heavy tails assumption. Then, with 0 < ˛ < 2, D arg
O a/L.'/ D c˛ j'j˛ H. / C O.j'j2 / as ' ! 0; Z Z1 1 cos t ˛ h. /j cos. /j d and c˛ D dt; where H. / D t 1C˛
b/P fx.t/ D xg ! t !1
1 t d=2
0
St ˇ;H.
(8)
x .1 C o.1// uniformly in x 2 Z d : t 1=˛
/
This lemma is the local form of the usual statement that Z x.t/ law x.t/ ! S tˇ;H./ , P 2 D S tˇ;H./ .z/dz: 1 1 t ˇ t !1 tˇ
(9)
In addition, this local form indicates the absence of “large deviations.” A similar “global” theorem was published recently in [18]. We will give a sketch of the proof following the idea of [18]. See [8] for the detailed proof. P O Proof. We have L.'/ D z¤0 a.z/.1 cos.' z//. Let us consider the following integral I.'/, which will give a good approximaO tion of L.'/, ' 2 Œ; /2 D T 2 : I.'/ D
X
In .'/; where In .'/ D
n¤0
Z h x jxj jxj2C˛
.1 cos.' x//dx:
A.n/
For large jnj, the leading term in the expansion of In .'/ is equal to n .'/ WD
1 n .1 cos.n '// h jnj2C˛ jnj
while the remaining termPin the expansion of In .'/ will give a contribution of order O O.j'j2 /, j'j ! 0. With n¤0 n .'/ D L.'/, we have O L.'/ D I.'/ C O.j'j2 /; j'j ! 0:
The Parabolic Anderson Model with Long Range Basic Hamiltonian
17
Some calculations about I.'/ give Z I.'/ D
x h. jxj /
jxj2C˛
.1 cos.' x//dx D c˛ j'j˛ H. /;
R2 A.0/
R where H. / D h. /j cos. /j˛ d , D arg ', H. / 2 C.T 1 /, H. / > 0 and R 11cos t c˛ D 0 t 1C˛ dt. Then: O L.'/ D c˛ j'j˛ H. / C O.j'j2 /; j'j ! 0:
Corollary 1.3. Under our condition on a.z/,
E0 e
i '
X.t / t 1=ˇ
! ec˛ j'j
˛ H.Arg'/
t !1
(center symmetric distribution with parameter 0 < ˇ < 2 and angular measure H. /, D arg '). Corollary 1.4. Under our condition on a.z/, the random walk X.S / on Z 2 is transient for any 0 < ˇ < 2. In fact: p.t; 0; 0/ D
1 .2/2
Z
O
et L.'/ d' )
Z1 p.t; 0; 0/dt D 0
T2
1 .2/2
Z T2
d' < 1: O L.'/
Random walks with long jumps appear in a recent paper [8] by Y. Feng, S. Molchanov, and J. Whitmeyer about models of stochastic dynamics that are stationary in time and space of biological populations. Under mild conditions on the functions .x/ and .x/, the particle field n.t; x/ exists, is unique and has all statistical moments. In particular, the first moment, or the population density, u.t; x/ D En.t; x/ is the solution of the parabolic problem 8 < @u D Lu C V .x; ! /u m @t : u.0; x/ 0 > 0;
(10)
where V .x/ D .x/ .x/. We will assume that the values of V .x; !m /, x 2 Z d are i.i.d. r.v.s on the probability space ( m , m , Pm ). The points !m 2 ˝m represent the realization of random media (a random environment) and Pm is the
18
S. Molchanov and H. Zhang
distribution on m . In other words, we consider random particle dynamics in a random environment. Consider the case of the potential V .x; !m / unbounded from above, i.e, P fV ./ > ag > 0 for any a > 0. A typical example is the i.i.d. N.0; 1/ r.v.s. See [17] for detailed analysis of the Gaussian case. General study of the problem (10) in the particular case of local diffusion L D was started in a paper by J. G¨artner and S. Molchanov [10] and later was expanded by J. G¨artner and his students and other collaborators in many different directions. The central idea is the justification of the intermittency phenomenon: the random environment leads to a highly nonuniform population structure (see J. G¨artner and S. Molchanov [10–12], J. G¨artner, W. K¨onig and S. Molchanov [13], S. Molchanov [17], J. G¨artner and W. K¨onig [9]). Corresponding effects were known in the physics literature [20]. There are many works on random environments changing in time (in the areas in physics of turbulent flow, moving catalysts, etc.; see [2, 3, 6, 7, 14–16, 19]). Some of them are included in in this volume of proceedings. We will discuss only the stationary environment. Let us mention one of the results from [10]. Under the condition he V ./ i D ‰. / < 1, 8. 2 R1 /, the particle field u.t; x/ has all statistical moments and mk .t/ D huk .t; 0/i D huk .t; x/i;
k D 1; 2; : : : :
Here, and in the future, the symbol h i means the expectation with respect to the random environment. The notation E will be used for the expectation over the random process x.t/ associated with L. For instance, due to the Kac–Feynman formula for the fixed environment V .; !m /, the quenched representation of the first moment is u.t; !m ; x/ D Ex e
Rt 0
V .xs ;!m /ds
0 :
At the same time, m1 .t; 0/ D hE0 e
Rt 0
V .xs ;!m /ds
0 i D E0 he
Rt 0
V .xs ;!m /ds
0 i
is the corresponding annealed first moment. In the following content, without loss of generality we take 0 D 1. In this paper, we are mainly concerned with the potential V .x; !m / with EetV ./ < 1 for all t > 0 in the following two Weibull type forms: x˛ ; P fV ./ > xg D expfh.x/g D exp ˛
(11)
and
x˛ P fV ./ > xg D expfh.x/g D exp L.x/ ˛
with ˛ > 1;
(12)
The Parabolic Anderson Model with Long Range Basic Hamiltonian
19
where L.x/ is a slowly varying function with some restrictions (see below). Recall that a slow varying function is a positive measurable function f satisfying f . x/ ! 1 .x ! 1/; 8 > 0; f .x/ and a regularly varying function of index is a measurable function f > 0 satisfying f . x/ ! .x ! 1/; 8 > 0; f .x/ alternatively written f 2 R . For details and further reference see Bingham et al. [4]. The particular case when V .xs ; !m / is i.i.d. N.0; 2 / r.v.s is also essential: Z1
1
P fV ./ > ag D p 2
e a
x2 2 2
a2
e 2 2 p : dx a!1 a 2
It is close to the Weibull situation with ˛ D 2. Let us formulate the annealed (moment) asymptotics and quenched (Pm -a.s.) asymptotics of u.t; 0/ in the Gaussian case and the random walk with Laplacian operator Lf .x/ D
2d
X
Œf .x C z/ f .x/:
jzxjD1
Theorem 1.5. (See [10, 17]) (a) For every p 1 and every t 0, exp
p2t 2 2 pkt 2
hup .t; 0/i exp
p2 t 2 2 ; 2
or p2 2 lnhup .t; 0/i : D 2 t !1 t 2 lim
A more precise version of (a) is .a0 / lnhup .t; 0/i D ln u.t;0/ p t !1 t ln t
(b) Pm -a.s.: lim
D
p2t 2 2 pkt C o.t/ .see also [17]/: 2
p 2d :
20
S. Molchanov and H. Zhang
Let us stress that the annealed and quenched asymptotics have completely different orders. It is a general feature of all models with the local basic Hamiltonian (see [10,17], etc.). We will see that for the long range Hamiltonian the opposite situation obtains, that is, the annealed and quenched asymptotics have the same order. Let us return to the formula (10) and impose some technical conditions on the function L.x/ in the spirit of the paper [1].
2 The Annealed and Quenched Asymptotic Properties of u.t; 0/ with Weibull V.x; !m /: n Potential o x˛ PfV./ > xg D exp ˛ ˛
For a tail probability of the form P fV ./ > xg D exp f x˛ g, we have the following annealed asymptotic result for u.t; x/. Theorem 2.1. For every p 2 N and every t 0, ( 0 0 ) ( 0 0 ) p˛ t ˛ p˛ t ˛ p exp pt C O.ln t/ hu .t; x/i exp C O.ln t/ ; ˛0 ˛0 and 0
1 lnhup .t; x/i p˛ 1 D ; where ˛ 0 satisfies C 0 D 1: lim 0 t !1 t˛ ˛0 ˛ ˛ Remark 2.2. Except for the specific calculation of the Laplace transformation, this theorem is the direct representation of the corresponding general result from [10]. Proof. (a) Lower Estimation of the Annealed Asymptotics of mp .t/. The first moment of the solution u.t; 0/ is m1 .t/ D hu.t; 0/i hetV .0/ iet : For the Weibull tail, we calculate the term hetV .0/ i as follows: Z1 hetV .0/ i D
x˛
etx ˛ x ˛1 dx: 0
Changing variables by setting x D t ˇ y and selecting ˇ W 1 C ˇ D ˛ˇ gives Z1 he
tV .0/
iD
et 0
where ˇ D
1 , ˛1
˛0 D
˛ ˛1
D 1 C ˇ.
˛ ˛ 0 .y y ˛
/ ˛ˇ
t y ˛1 dy;
The Parabolic Anderson Model with Long Range Basic Hamiltonian
21
˛
The term y y˛ is maximal when y D 1. Then, using Laplace’s method, we obtain: Z1 e
0 y˛ t ˛ y ˛ ˛ˇ
t˛
0
t y ˛1 dy D e ˛0
0
2 C ˛2 ln t C 12 ln. ˛1 /Co.1/
:
0 ˛0
0
t ˛ 1 2 Thus, m1 .t/ e ˛0 t C 2 ln t C 2 ln. ˛1 /Co.1/ . For p > 1, we can consider p independent copies xsi , i D 1; : : : ; p of the random walk xs . For the pth moment of the solution u.t; 0/, we have
8 19+ 0 p Zt = < X .xsi /A hup .t; x/i D E0 exp @ ; : *
(
i D1 0
) p t ˛0 1 2 exp pt C ln t C ln C o.1/ ˛0 2 2 ˛1 ( 0 0 ) p˛ t ˛ D exp pt C O.ln t/ : ˛0 ˛0
˛0
(b) Upper Estimation of mp .t/. We obtain the following results after applying H¨older’s inequality, Jensen’s inequality and Fubini’s theorem. *0
0
hu .t; x/i D @E0 exp @ p
Zt
1p + .xs /ds A
*0
0
@E0 exp @p
1+ 00 t *0 Z D E0 @exp @p .xs /ds A 0
1 t
Zt
1+
Zt
1+ .xs /ds A
0
) ˛0 ˛0 t p dsE0 hexp pt.xs /A D exp C O.ln t/ : ˛0 (
0
Combining the lower and upper estimations of the mp .t/ of the solution u.t; 0/, we get the result. Remark 2.3. Following the method in [17], the more precise upper estimation can be proved: 0
hln up .t; x/i D
0
p˛ t ˛ pt C O.ln t/: ˛0
For the discussion of the quenched asymptotic properties of the solution u.t; 0/, we need the following lemma concerning the asymptotics of max V .x/ as n ! 1 for jxjn ˚ ˛
the potential P fV .x; !m / > ag D exp a˛ .
22
S. Molchanov and H. Zhang
Lemma 2.4. Pm -a.s., max V .x/ .˛d ln n/1=˛ :
jxjn
(1)
n!1
Proof. Using the Borel–Cantelli lemma for the event A˙ x D fV .x/ > .1 ˙ / .˛d ln jxj/1=˛ g, jxj D jx1 jC Cjxk j, straightforward calculation proves the lemma. Theorem 2.5. Pm -a.s. for t ! 1, ln u.t; 0/ 1 0; 0 ˛ t ˛ t !1 ˛˛0 1 ln u.t; 0/ d 0 : lim inf t !1 t ˛0 ˛ d Cˇ
lim sup
Proof. (a) Lower Estimation for the Quenched Asymptotics of u.t; 0/. To check the lower estimation, let us consider the “almost optimal” trajectory xs , s 0. This trajectory spends the time t 1 at the origin, then jumps to the point x0 D x0 .t; !m / of the very high local maximum of V .x; / and stays there until moment t (i.e., time at least t 1.) 0 Assume that jx0 j 2 ŒR.1 ı /; R for some R, R 1 and V .x0 / .1 ı/ .˛d ln R/1=˛ . Then, for R ! 1, 1 exp f.t 1/.1 ı/.˛d ln R/1=˛ g Rd Cˇ 00 t .d Cˇ/ ln RCt .1ı /.˛d ln R/1=˛ because a.0; x0 / C2 e max e
u.t; 0/ max Œet C2 R
R
Putting x D ln R, we find 00
max Œ.d C ˇ/x C tQ.˛dx/1=˛ ; tQ D .1 ı /t: x
The equation for the critical point gives: tQd.˛dx0 /
1=˛1
Dd Cˇ
1 ) x0 D ˛d
The value at the critical point is 1 t ˛0 0 Q˛
d d Cˇ
˛˛0 :
tQd d Cˇ
˛0 :
C jx0 jd Cˇ
:
The Parabolic Anderson Model with Long Range Basic Hamiltonian 00
23
00
Because tQ D .1 ı /t and ı is arbitrarily small, we have proved the lower estimation 1 ln u.t; 0/ lim inf 0 t !1 t ˛0 ˛
d d Cˇ
˛˛0 :
(b) Upper Estimation for the Quenched Asymptotics of u.t; 0/. It follows from the Kac–Feynman formula that u " as a function of t for fixed !m . It means that for n t < n C 1, u.n; 0/ u.t; 0/ u.n C 1; 0/: But 8. > 0/ and t D n or n C 1,
˛0
P u.t; 0/ > e
.1C/ t˛ 0
hu.t; 0/i e
˛0 .1C/ t˛ 0
hexp .tV .0//i t˛
0
:
e.1C/ ˛0
Trivial calculation gives t˛
0
hexp .tV .0//i e ˛0 and, due to the Borel–Cantelli lemma, 8. > 0/ u.t; 0/ e.1C
0 t ˛0 / ˛0
; t t0 .!/;
first for integer t, then, due to the monotonicity of u.t; 0/, for all t > t0 .!/. It means that lim sup t !1
1 ln u.t; 0/ .1 C / 0 : t ˛
Because can be arbitrarily small, we have proved the upper estimation.
3 The Annealed and Quenched Asymptotic Properties of u.t; 0/ with Potential V.x; !m / of the Form ˛ PfV./ > xg D exp f x˛ L.x/g In the spirit of the paper [1] by G. Ben Arous, L. Bogachev, and S. Molchanov on REM model, we will introduce some essential technical developments of the Weibull case of Sect. 2. Specifically, we will study models when P fV ./ > ˛ xg D exp f x˛ L.x/g, and L./ is a slowly varying function with some additional regularity assumptions. We will start from several definitions and propositions.
24
S. Molchanov and H. Zhang
The following lemmas and definitions are fundamental to our paper and can be found in [4]. Lemma 3.1. (Uniform Convergence Theorem by Karamata and Korevaar et al.) If f .x/ is slowly varying then ff. x/ .x/ ! 1.x ! 1/ uniformly on each compact -set in .0; 1/. It is known (see [4]) that a function f .x/ 2 R iff f .x/ admits the Karamata representation 8 x 9
for some a > 0, where c./, ./ are measurable functions and c.x/ ! c0 > 0, .x/ ! 0 as x ! 1. Definition 3.2. (After [4].) The function f is a normalized regularly varying function, or f 2 NR , if it can be represented in the form (1) with c./ D constant> 0. One of the important properties of a normalized regularly varying function f .x/, f .x/ 2 NR , is provided by the following lemma (see [4, page 24]). Lemma 3.3. A positive measurable function f is a normalized regularly varying .x/ .x/ is ultimately increasing and xfC function, or f .x/ 2 NR , iff for every > 0 xf is ultimately decreasing. Another important property of a normalized regularly varying function f .x/ 2 NR is given by the following lemma (see [4, page 15]). Lemma 3.4. Let f be a positive measurable function. Then f 2 NR iff f is differentiable (a.e.) and when x ! 1, xf 0 .x/ ! : f .x/ Kasahara-de Bruijn’s Tauberian theorem (see Bingham et al. [4, page 253]) is fundamental to this paper. In the following, f .y/ is the generalized inverse function of f , defined f .y/ D inffx W f .x/ yg. Theorem 3.5. (Kasahara-de Bruijn’s Tauberian Theorem). Let be a measure on .0; 1/ such that Z1 M. / D e x d.x/ < 1 0
for all > 0. If 0 < ˛ < 1, 2 R˛ , put
. / D =. / 2 R1˛ ; then, for B > 0,
ln .x; 1/ B .x/ .x ! 1/
(2)
The Parabolic Anderson Model with Long Range Basic Hamiltonian
25
if and only if ln M. / .1 ˛/.˛=B/˛=.1˛/
. / . ! 1/:
To make use of the theorem, we restrict our attention to L.x/ that satisfy: Assumption 3.6. The function L.x/ in (12) is slowly varying and L.x/ 2 NR0 , that is, xL0 .x/ ! 0 .x ! 1/: L.x/ 0
˛
.x/ With Assumption 3.6, we see that xhh.x/ ! ˛ when x ! 1, where h.x/ D x L.x/ . ˛ From Lemmas 3.3 and 3.4, h.x/ is a normalized regularly varying function and is ultimately increasing. This assumption is not completely sufficient for our analysis. To prove the results similar to the Theorem 2.1 and 2.5, we need the additional technical
Assumption 3.7. L.x/ in (12) satisfies L.xL˛ .x//=L.x/ ! 1 .x ! 1/ locally uniformly in ˛ 2 R: We will use the Assumption 3.7 to control the critical point x0 in the application of Laplace method. The Assumption 3.7 is fulfilled for all “standard” slowly varying functions, for example, L.x/ D lnˇ .2 C x/, ˇ 2 R1 , L.x/ D ln ln.x C 4/, 2 R1 and L.x/ D exp.lnˇ .2 C x//, 0 < ˇ < 12 . However, the function L.x/ D exp.lnˇ .2 C x//, 12 < ˇ < 1, is slowly varying but elementary calculation gives lim L.xL.x// D C1, i.e., the Assumption 3.7 restricts the growth of L.x/. x!1 L.x/ The following lemma (see Bojanic and Seneta [5] and see Bingham et al. [4, page 77, 78]) is related to the sufficient condition for the Assumption 3.7. Lemma 3.8. (Bingham et al. [4], Bojanic and Seneta [5]) If L.x/ is nondecreasing slowly varying function, L.x/ > 1 and L.x/ is continuously differentiable, then xL0 .x/ ln L.x/ ! 0 L.x/
(3)
implies L.xL˛ .x//=L.x/ ! 1 .x ! 1/ locally uniformly in ˛ 2 R: This result is very general and useful. Its main defect is the assumption that L.x/ is nondecreasing. The following theorem is similar to Theorem 2.1 but in our more general setting: Theorem 3.9. Under Assumptions 3.6 and 3.7, for every p 2 N and t ! 1, heptV .0/iept hup .t; x/i heptV .0/i
26
S. Molchanov and H. Zhang
and 0
1 lnhup .t; x/i 1 1 p˛ 1 ˛1 .t ˛1 / D L ; where ˛ 0 satisfies C 0 D 1: 0 ˛ 0 t !1 t ˛ ˛ ˛ lim
Proof. The first moment of the solution u.t; 0/ with tail probability P fV ./ > xg D ˛ exp fh.x/g, where h.x/ D x˛ L.x/, is m1 .t/ D hu.t; 0/i hetV .0/ iet :
(4)
Using integration by parts, we get Z1 he
tV .0/
iD1Ct
Z1 e P fV .0/ > xgdx D 1 C t tx
0
etx
x˛ ˛
L.x/
dx;
0
i.e., we have to evaluate asymptotically Z1 I.t/ D
etxh.x/ dx: 0
The natural idea is to apply the Laplace method. One can do this under additional 2 L00 .x/ 2 and x˛L.x/ ! 0. However, on the level of the assumption that L.x/ 2 Cloc logarithmical asymptotics, the initial Assumption 3.7 is sufficient. 1 ˛1 t Fix the point x0 D (which is not exactly the extreme for txh.x/) 1 L.t ˛1 /
and divide Œ0; 1/ into the following intervals: h 1 h1 h 1 D 0; x0 ; 0 D x0 ; 2x0 ; : : : ; n D 2n x0 ; 2nC1 x0 ; : : : 2 2 Since x0 .t/ ! 1 and L is slowly varying, there exists function ı D ı.t/ ! 0, t ! 1 such that for x 2 n , n 0, we have .1 ı/L.2n x0 / L.x/ .1 C ı/L.2n x0 /: Finally, the exponent tx h.x/ is increasing on the Œ0; 12 x0 / and decreasing on Œ2x0 ; 1/ as the function of x. R Consider the integral I0 .t/ D 0 etxh.x/ dx, then Z
˛
e 0
tx.1Cı/ xa L.x0 /
Z dx I0
etx.1ı/ 0
x˛ a
L.x0 /
dx:
The Parabolic Anderson Model with Long Range Basic Hamiltonian
The critical points here are x˙ .t/ D
t L.x0 /
1 ˛1
27
1 1
: The usual Laplace
.1ı/ ˛1
method (L now is constant) gives 1 : 1 1 ˛ L ˛1 .x0 / ˛
ln I0
t ˛1
On 1 , we can use a very rough estimation: Z I1 .t/ D
e
txh.x/
dx j1 j e
1
x0 e 2
t ˛=.˛1/ L1=.˛1/ .x0 /
˛
1 1 2 2
t
x0 2
h
x0 2
x 0
L
2 L.x0 /
˛1
and I1 .t/ is exponentially smaller than I0 .t/. Similarly for n 1, Z
etxh.x/ dx jn j et
In .t/ D
2 n x0 2
h.2n x0 /
n
2n x0 e 2n x0 e
t ˛=.˛1/ L1=.˛1/ .x0 / t ˛=.˛1/ L1=.˛1/ .x0 /
˛ n L.2n x / 2n 2 ˛ L.x 0/ 0
2n 2
L˛=.˛1/ .x0 / L˛=.˛1/ .t 1=.˛1/ /
(5)
.˛ı/n ˛
:
In (5) we P use the Assumption 3.7, which provides that L.x0 /=L.t 1=.˛1/ / ! 1. Again n1 In .t/ is exponentially small than I0 . Finally, 0 t˛ 1 1 0 1 : ln I.t/ 1 1 1 t !1 L ˛1 ˛ ˛ L ˛1 .t ˛1 .x0 / / ˛
t ˛1
In the last step, we use the Assumption 3.7 again.
For the quenched asymptotics of u.t; x/, t ! 1, as in the previous section we need the asymptotics of max V .x/ similar to Lemma 2.4. jxjn
Lemma 3.10. If function L.x/ satisfies Assumption 3.7, Pm -a.s., then max V .x/
jxjn
n!1
˛d ln n L.ln1=˛ n/
1=˛ :
Proof. (a) Lower Estimation of V .x/. For notational convenience, we define ˛d ln jxj 1=˛ ˇ.x/ D L.ln .x/g. 1=˛ jxj/ . Consider the events Ax;ı D f!m W V .x/ > .1 C ı/ˇ
28
S. Molchanov and H. Zhang
Then, for any ı > 0, 1 P .Ax;ı / D exp .1 C ı 0 / ˇ.x/ L.ˇ 1=˛ .x// ˛ D
1 jxjd.1Cı0 /.1Co.1//
:
The last stepP follows from Assumption 3.7. Because jxjd.1Cı10 /.1Co.1// < 1, we have that for jxj C.ı; !m /, V .x/ .1 C x
ı/ˇ 1=˛ .x/, due to the Borel–Cantelli lemma. ˛d ln Rn (b) Upper Estimation of V .x/. We define ˇ.Rn / D L.ln . Let us split Z d into 1=˛ Rn / n : n D fx W Rn < kxk1 RnC1 g, where Rn D .1 C /n and > 0, and consider the event Bn;ı D f!m W maxV .x/ < .1 ı/ˇ 1=˛ .Rn /g. The events Bn;ı are n
independent for different n and due to independence P fBn;ı g D P j n j fV .x/ < .1 ı/ˇ 1=˛ .Rn /g j n j 1=˛ ej n jP fV .x/>.1ı/ˇ .Rn /g : D 1 P fV .x/ .1 ı/ˇ 1=˛ .Rn /g But with j n j Rn .2Rn /d 1 and P fV .x/ > .1 ı/ˇ 1=˛ .Rn /g P fBn;ı g e
Rn .2Rn /d 1
c d.1ı 0 / Rn
c
d.1ı 0 /
Rn
,
X P fBn;ı g < 1:
ı0 d
ecRn ;
n
So for n > n0 .!/, max V .x/ .1 ı/ˇ 1=˛ .Rn /. Thus, Lemma 3.10 is proved. n
Let us give some illustrations. Corollary 3.11. If L.x/ D lnˇ x, Pm -a.s.: max V .x/
jxjn
˛d ln n
1=˛ ˛ ˇ=˛ :
ln lnˇ n
n!1
Corollary 3.12. If L.x/ D ln lnˇ x, Pm -a.s.: max V .x/
jxjn
n!1
1=˛
˛d ln n
:
ln ln lnˇ n
ˇ
Corollary 3.13. If L.x/ D eln x , 0 < ˇ < 12 , Pm -a.s.: max V .x/
jxjn
n!1
˛d ln n e.
ln ln n ˇ ˛ /
!1=˛ :
The Parabolic Anderson Model with Long Range Basic Hamiltonian
29
Using Lemma 3.10, we can obtain the following theorem for the quenched ˛ asymptotics of u.t; x/ for potential P fV .x; !m / > xg D exp f x˛ L.x/g. Theorem 3.14. Under Assumptions 3.6 and 3.7, Pm -a.s., for t ! 1: 1 ln u.t; 0/ 1 1 L ˛1 t ˛1 0 ; ˛0 t ˛ t !1 ˛˛0 1 1 1 d 1 t ˛1 0 ; where ˛ 0 satisfies C 0 D 1: ˛ d Cˇ ˛ ˛ lim sup
lim inf t !1
ln u.t; 0/ 1 L ˛1 t ˛0
Proof. (a) Lower Estimation for the Quenched Asymptotics of u.t; 0/. Assume 1=˛ 0 ˛d ln R that jx0 j 2 ŒR.1 ı /; R for some R, R 1 and V .x0 / .1 ı/ . 1 L.ln ˛ R/
Then, for R ! 1, 2 1
u.t; 0/ max 4et C2
Rd Cˇ
R
8 !1=˛ 39 = < ˛d ln R 5 exp .t 1/.1 ı/ 1 ; : L.ln ˛ R/
C2 et max e
.d Cˇ/ ln RCt 1ı
00
!1=˛
˛d ln R 1 L.ln ˛ R/
:
R
1
Putting x D ln ˛ R, we find "
.˛d /1=˛ x
max .d C ˇ/x C tQ ˛
1 ˛
x
L .x/
# 00
tQ D .1 ı /t:
;
The equation for the critical point is: tO
1
x0 L0 .x0 / ˛L.x0 / 1
L ˛ .x0 /
˛.d C ˇ/x0˛1 D 0;
where tO D tQ.˛d /1=˛ . Under Assumption (3.7) 1
L ˛ .x0 / D
tO ; ˛.d C ˇ/x0˛1
or x0 D where tN D
tO ˛.d Cˇ/ .
tN 1
L ˛ .x0 /
1 ! ˛1
;
(6)
30
S. Molchanov and H. Zhang
We use the iterative method to solve (6) by setting the initial point x0 D tN ˛1 . We obtain 1
tN ˛1 x0 1 1 1 : L ˛ ˛1 tN ˛1 1
The value at the critical point is 1 t ˛0 0 N˛
d d Cˇ
˛˛0 L
1 ˛1
1 1 : tN ˛1
00
Because ı is arbitrarily small, we have proved the lower estimation: 1 ln u.t; 0/ 1 1 lim inf L ˛1 t ˛1 0 0 ˛ t !1 t ˛
d d Cˇ
˛˛0 :
(b) Upper Estimation for the Quenched Asymptotics of u.t; 0/. Applying the upper estimation of the quenched asymptotics of u.t; 0/, Theorem 2.5 and the result in Theorem 3.9, we have lim sup t !1
1 ln u.t; 0/ 1 1 L ˛1 t ˛1 0 : t ˛0 ˛
Combining the lower and upper estimations of the quenched asymptotics of u.t; 0/, we obtain the result.
4 Concluding Remark Let us emphasize that we did not find the exact quenched asymptotics but only the upper and lower estimations of the same order. To find the true asymptotics, we need a better understanding of the a.s. behavior of the underlying random walk x.t/, t ! 1 (upper and lower functions, etc.). In the 1-d case the situation is clear, but the multidimensional case is more difficult. We will return to this subject in the future.
References 1. Ben Arous, G., Bogachev, L., Molchanov, S.: Limit theorems for sums of random exponentials. Probab. Theory Relat. Fields 132(4), 579–612 (2005) 2. Ben Arous, G., Molchanov, S., RamKırez, A.F.: Transition from the annealed to the quenched asymptotics for a random walk on random obstacles. Ann. Probab. 33(6), 2149–2187 (2005)
The Parabolic Anderson Model with Long Range Basic Hamiltonian
31
3. Ben Arous, G., Molchanov, S., RamKırez, A.F.: Transition asymptotics for reaction-diffusion in random media. In: Probability and Mathematical Physics, 1–40, CRM Proc. Lecture Notes, vol. 42. Amer. Math. Soc., Providence, RI (2007) 4. Bingham, N.H., Goldie, C.M., Teugels, J.L.: Regular Variation. Cambridge University Press, Cambridge (1989) 5. Bojanic, R., Seneta, E.: Slowly varying functions and asymptotic relations. J. Math. Anal. Appl. 34, 302–315 (1971) 6. Castell, F., G´un, O., Maillard, G.: Parabolic Anderson model with a finite number of moving catalysts. In: Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11, Springer (2012) 7. Drewitz, A., G¨artner, J., RamKırez, A.F., Sun, R.: Survival Probability of a Random Walk Among a Poisson System of Moving Traps. In: Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11, Springer (2012) 8. Feng, Y, Molchanov, S., Whitmeyer, J.: Random walks with heavy tails and limit theorems for branching processes with migration and immigration. 2010. (Preprint) 9. G¨artner, J., K¨onig, W.: Moment asymptotics for the continuous parabolic Anderson model. Ann. Appl. Probab. 10(1), 192–217 (2000) 10. G¨artner, J., Molchanov, S.: Parabolic problems for the Anderson model. I. Intermittency and related topics. Commun. Math. Phys. 132, 613–655 (1990) 11. G¨artner, J., Molchanov, S.: Parabolic problems for the Anderson model. II: Second-order asymptotics and structure of high peaks. Probab. Theory Relat. Fields 111(1), 17–55 (1998) 12. G¨artner, J., Molchanov, S.: Moment asymptotics and Lifshitz tails for the parabolic Anderson model. Stochastic models, Ottawa, ON, 1998. CMS Conf. Proc., vol. 26, pp. 141–157. Amer. Math. Soc., Providence, RI (2000) 13. G¨artner, J., K¨onig, W., Molchanov, S.: Geometric characterization of intermittency in the parabolic Anderson model. Ann. Probab. 35(2), 439–499 (2007) 14. G¨artner, J., den Hollander, F., Maillard, G.: Quenched Lyapunov exponent for the parabolic Anderson model in a dynamic random environment. In: Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11, Springer (2012) 15. K¨onig, W., Schmidt, S.: The Parabolic Anderson Model with Acceleration and Deceleration. In: Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11, Springer (2012) 16. Maillard, G., Mountford, T., Sch¨opfer, S.: Parabolic Anderson model with voter catalysts: dichotomy in the behavior of Lyapunov exponents. In: Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11, Springer (2012) 17. Molchanov, S.: Lectures on random media. In: Bakry, D., Gill, R.D., Molchanov, S. (eds.) Lectures on Probability Theory, Ecole d’EtKe de ProbabilitKes de Saint-Flour XXII-1992, LNM 1581, pp. 242–411. Springer, Berlin (1994) 18. Molchanov, S., Petrov, V.V., Squartini, N.: Quasicumulants and limit theorems in case of the Cauchy limiting law. Markov Process. Relat. Fields 17(3), 597–624 (2007) 19. Schnitzler, A., Wolff, T.: Precise asymptotics for the parabolic Anderson model with a moving catalyst or trap. In: Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11, Springer (2012) 20. Zeldovich, Ya., Molchanov, S., Ruzmaikin A., Sokoloff D.: Intermittency, diffusion and generation in a non-stationary random media. Sov. Sci. Rev., Sec C 7, 1–100 (1988)
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior of Lyapunov Exponents Gr´egory Maillard, Thomas Mountford, and Samuel Sch¨opfer
Abstract We consider the parabolic Anderson model @u=@t D u C u with uW Zd RC ! RC , where 2 RC is the diffusion constant, is the discrete Laplacian, 2 RC is the coupling constant, and W Zd RC ! f0; 1g is the voter model starting from Bernoulli product measure with density 2 .0; 1/. The solution of this equation describes the evolution of a “reactant” u under the influence of a “catalyst” . In G¨artner, den Hollander and Maillard [G¨artner et al., Intermittency on catalysts: Voter model. Ann. Probab. 38, 2066–2102 (2010)] the behavior of the annealed Lyapunov exponents, i.e., the exponential growth rates of the successive moments of u w.r.t. , was investigated. It was shown that these exponents exhibit an interesting dependence on the dimension and on the diffusion constant. In the present paper we address some questions left open in [G¨artner et al., Intermittency on catalysts: Voter model. Ann. Probab. 38, 2066–2102 (2010)] by considering specifically when the Lyapunov exponents are the a priori maximal value in terms of strong transience of the Markov process underlying the voter model.
G. Maillard () CMI-LATP, Universit´e de Provence, 39 rue F. Joliot-Curie, 13453 Marseille Cedex 13, France EURANDOM, P.O. Box 513, 5600 MB Eindhoven, The Netherlands e-mail:
[email protected] T. Mountford S. Sch¨opfer ´ Institut de Math´ematiques, Ecole Polytechnique F´ed´erale, Station 8, 1015 Lausanne, Switzerland e-mail:
[email protected];
[email protected] J.-D. Deuschel et al. (eds.), Probability in Complex Physical Systems, Springer Proceedings in Mathematics 11, DOI 10.1007/978-3-642-23811-6 3, © Springer-Verlag Berlin Heidelberg 2012
33
34
G. Maillard et al.
1 Introduction 1.1 Model The parabolic Anderson model (PAM) is the partial differential equation @ u.x; t/ D u.x; t/ C .x; t/u.x; t/; @t
x 2 Zd ; t 0;
(1)
with u a RC -valued field, 2 RC a diffusion constant, the discrete Laplacian, acting on u as u.x; t/ D
X
Œu.y; t/ u.x; t/
y2Zd yx
(y x meaning that y is a nearest neighbor of x), 2 RC a coupling constant and D .t /t 0
with
t D ft .x/ WD .x; t/W x 2 Zd g
the Voter Model (VM) taking values in f0; 1gZ u.x; 0/ D 1;
d RC
. As initial condition, we choose
x 2 Zd :
(2)
One can interpret (1) in terms of population dynamics. Consider a system of two types of particles, A “catalyst” and B “reactant,” subject to: • A-particles evolve autonomously according to the voter dynamics. • B-particles perform independent random walks at rate 2d and split into two at a rate that is equal to times the number of A-particles present at the same location. • The initial configuration of B-particles is one particle everywhere. Then u.x; t/ can be interpreted as the average number of B-particles at site x at time t conditioned on the evolution of the A-particles.
1.2 Voter Model The VM is the Markov process on f0; 1gZ with generator L acting on cylindrical functions f as d
Lf . / D
X x2Zd
p.x; y/
X f . x;y / f . / ; y2Zd yx
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
35
where pW Zd Zd ! Œ0; 1 is the transition kernel of an irreducible random walk and x;y is the configuration (
x;y .z/ D .z/ x;y
8z 6D x;
.x/ D .y/:
In words, .x; t/ D 1 and .x; t/ D 0 mean the presence and the absence of a particle at site x at time t, respectively. Under the VM dynamics, the presence and absence of particles are imposed according to the random walk transition kernel p.; /. The VM was introduced independently by Clifford and Sudbury [3] and by Holley and Liggett [8], where the basic results concerning equilibria were shown. Let .St /t 0 be the Markov semigroup associated with L, p .s/ .x; y/ D .1=2/Œp.x; y/Cp.y; x/, x; y 2 Zd , be the symmetrized transition kernel associated with p.; /, and be the equilibrium measure with density 2 .0; 1/. When p .s/ . ; / is recurrent all equilibria are trivial, i.e., of the form D .1 /ı0 C ı1 , while when p .s/ . ; / is transient there are also nontrivial equilibria, i.e., ergodic measures , different from the previous one, which are the unique shift-invariant and ergodic equilibria with density 2 .0; 1/. For both cases we have
St !
weakly as t ! 1
(3)
for any starting measure that is stationary and ergodic with density (see Liggett [11], Corollary V.1.13). This is in particular the case for our choice WD , the Bernoulli product measure with density 2 .0; 1/.
1.3 Lyapunov Exponents Our focus of interest will be on the pth annealed Lyapunov exponent, defined by p D lim
t !1
1=p 1 log E Œu.0; t/p ; t
p 2 N;
(4)
which represents the exponential growth rate of the pth moment of the solution of the PAM (1), where E denotes the expectation w.r.t. the -process starting from Bernoulli product measure with density 2 .0; 1/. Note that p depends on the parameters , d , , and with the two latter being fixed from now. If the above limit exists, then, by H¨older’s inequality, 7! p ./ satisfies p ./ 2 Œ;
8 2 Œ0; 1/:
36
G. Maillard et al.
The behavior of the annealed Lyapunov exponents with VM catalysts has already been investigated by G¨artner, den Hollander and Maillard [17], where it was shown that: • The Lyapunov exponents defined in (4) exist and do not depend on the choice of the starting measure ST , T 2 Œ0; 1, where S1 WD denotes the equilibrium measure of density (recall (3)) • The function 7! p ./ is globally Lipschitz outside any neighborhood of 0 and satisfies p ./ > for all 2 Œ0; 1/ • The Lyapunov exponents satisfy the following dichotomy (see Fig. 1): – When 1 d 4, if p.; / has zero mean and finite variance, then p ./ D for all 2 Œ0; 1/ – When d 5 lim!0 p ./ D p .0/ lim!1 p ./ D If p.; / has zero mean and finite variance, then p 7! p ./ is strictly increasing for 1 The following questions were left open (see [17], Sect. 1.8): Does p < when d 5 if p.; / has zero mean and finite variance? Is there a full dichotomy in the behavior of the Lyapunov exponents? Namely, p < if and only if p .s/ .; / is strongly transient, i.e.,
(Q1) (Q2)
Z1 .s/
tpt .0; 0/ dt < 1: 0
R1 Since any transition kernel p.; / in d 5 satisfies 0 t pt .0; 0/dt < 1, a positive answer to (Q2) will also ensure a positive one to (Q1) in the particular case when
p ./
6
p ./
6
1d 4
r
pD3 pD2 pD1
0
d 5
-
0
r r r -
Fig. 1 Dichotomy of the behavior of 7! p ./ when p. ; / has zero mean and finite variance
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
37
p.; / is symmetric. Theorems 1.2 and 1.4 in Sect. 1.4 give answers to question (Q2), depending on the symmetry of p.; /. A positive answer to (Q1), given in Theorem 1.1, can also be deduced from our proof of Theorem 1.2. By the Feynman–Kac formula, the solution of (1) and (2) reads 0
2
u.x; t/ D E x @exp 4
Zt
31 .X .s/; t s/ ds 5A ;
0
where X D .X .t//t 0 is a simple random walk on Zd with step rate 2d and E x denotes the expectation with respect to X given X .0/ D x. This leads to the following representation of the Lyapunov exponents: p D lim p .t/ t !1
with " Zt p #! X 1 ˝p log E ˝ E 0 exp Xj .s/; t s ds ; p .t/ D pt j D1 0
where Xj , j D 1; : : : ; p, are p independent copies of X . In the above expression, the and X processes are evolving in time reversed directions. It is nevertheless possible to let them run in the same time evolution by using the following arguments. ep .t/ denote the -time-reversal analogue of p .t/ defined by Let " Zt p #! X 1 ˝p ep .t/ D log E ˝ E 0 exp Xj .s/; s ds pt j D1 0
and denote p .t/ " Zt p # p ! X Y 1 ˝p log max E ˝ E 0 exp Xj .s/; t s ds ıx Xj .t/ D pt x2Zd j D1 j D1 0
D
1 log max E d pt x2Z
" Zt p # p ! X Y ˝p exp ˝ E0 Xj .s/; s ds ıx Xj .t/ ; 0
j D1
j D1
where in the last line we reverse the time of the -process by using that is shiftinvariant and Xj , j D 1; : : : ; p, are time-reversible. As noted in [13], Sect. 2.1, ep .t/ limt !1 Œ p .t/ p .t/ D 0 and, using the same argument, limt !1 Œ
38
G. Maillard et al.
p .t/ D 0, after which we can conclude that " Zt p #! X 1 ˝p log E ˝ E 0 p ./ D lim exp Xj .s/; s ds : t !1 pt j D1 0
1.4 Main Results In what follows we give answers to questions (Q1) and (Q2) addressed in [17] concerning when the Lyapunov exponents are trivial, i.e., equal to their a priori maximal value . Our first theorem gives a positive answer to (Q1). It will be proved in Sect. 2 as a consequence of the proof of Theorem 1.3. Theorem 1.1. If d 5 and p.; / has zero mean and finite variance, then p ./ < for all p 1 and 2 Œ0; 1/. Our two next theorems state that the full dichotomy in (Q2) holds in the case when p.; / is symmetric (see Fig. 2). They will be proved in Sects. 2 and 3, respectively. Theorem 1.2. If p.; / is symmetric and strongly transient, then p ./ < for all p 1 and 2 Œ0; 1/. Theorem 1.3. If p.; / is symmetric and not strongly transient, then p ./ D for all p 1 and 2 Œ0; 1/. A similar full dichotomy also holds for the case where is symmetric exclusion process in equilibrium, between recurrent and transient p.; / (see [6]).
p ./
6 r
p ./ not strongly transient
6
strongly transient
r
0
-
0
Fig. 2 Full dichotomy of the behavior of 7! p ./ when p.; / is symmetric
-
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
39
Our fourth theorem shows that this full dichotomy only holds for symmetric transition kernels p.; /, ensuring that the assertion in (Q2) is not true in its full generality. Theorem 1.4. There exists p.; / not symmetric with p .s/ .; / not strongly transient such that p ./ < for all p 1 and 2 Œ0; 1/. In the strongly transient regime, the following problems remain open: (a) (b) (c) (d)
lim!0 p ./ D p .0/. lim!1 p ./ D . p 7! p ./ is strictly increasing for 1. 7! p ./ is convex on Œ0; 1/.
In [17], (a) and (b) were established when d 5, and (c) when d 5 and p.; / has zero mean and finite variance. Their extension to the case when p.; / is strongly transient remains open. In what follows, we use generic notation P and E for probability and expectation whatever the corresponding process is (even for joint processes) and denote s .x/ WD .s; x/.
2 Proof of Theorems 1.1 and 1.3 We first give the proof of Theorem 1.3. Recall that the transition kernel associated to the Voter Model is assumed to be symmetric. At the end of the section we will explain how to derive the proof of Theorem 1.1. We have to show that p ./ < for all 2 Œ0; 1/. In what follows we assume without loss of generality that p D 1, the extension to arbitrary p 1 being straightforward. Our approach is to pick a bad environment set BE associated to the -process and a bad random walk set BW associated to the random walk X so that, for all n 2 N, 0
2
E @exp 4
Zn
31 s .X .s// ds 5A
(5)
0
0 2 n 31 Z P .BE / C P .BW / e n C E @11BEc \BWc exp 4 s .X .s// ds 5A 0
with, for some 0 < ı < 1, P .BE / eın ;
P .BW / eın ;
(6)
40
G. Maillard et al.
and, Zn s .X .s// ds n.1 ı/
on BEc \ BWc :
(7)
0
Since, combining (5)–(7), we obtain h Zn i 1 lim log E exp s .X .s// ds < ; n!1 n 0
it is enough to prove (6) and (7). The proof of (6) is given in Sects. 2.1–2.2 and (7) will be obvious from our definitions of BE and BW .
2.1 Coarse-Graining and Skeletons Write Zde D 2Zd and Zdo D 2Zd C 1, where 1 D .1; : : : ; 1/ 2 Zd . We are going j to use a coarse-graining representation defined by a space–time block partition By and a random walk skeleton .yi /i 0 . To that aim, for a fixed M , consider Byj
D
d Y
.yk 1/M; .yk C 1/M jM; .j C 1/M Zd RC ;
kD1
where j 2 N0 WD N [ f0g and ( y2
Zde when j is even, Zdo when j is odd.
Without loss of generality we can consider random walk trajectories on interval Œ0; n with n 2 N multiple of M . Define the M -skeleton set set by
D
o n n y0 ; : : : ; y Mn 2 .Zd / M C1 W y2k 2 Zde ; y2kC1 2 Zdo 8k 2 N0
and the M -skeleton set associated to a random walk X by
.X / D
o n y0 ; : : : ; y Mn 2 W X.kM / 2 Bykk 8k 2 f0; : : : ; n=M g :
In what follows, we will consider the M -skeleton .X /, but, as X starts from 0 2 Zd , the first point of our M -skeleton will always be y0 WD 0 2 Zd (see Fig. 3).
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
41
RC
6 j
By
jM y2 y1 y0
yM
0
Zd j
Fig. 3 Illustration of a M -skeleton .y0 ; y1 ; y2 ; : : :/ 2 and coarse-grained By blocks
In the next lemma we prove that the number of M -skeletons not oscillating too much is at most exponential in n=M . For that, define 9 8 n=M < X n =
A D y0 ; : : : ; y Mn 2 W .kyj yj 1 k1 1/ ; : Md ; j D1
(8)
where kk1 is the standard l1 norm, the set of all M -skeletons that are appropriate. Lemma 2.1. There exists some universal constant K 2 .1; 1/ such that, for any n; M 2 N, j A j K n=M : Proof. For any fixed y1 2 Zd and N 2 N0 , let ˇ˚ ˇ I.N / D ˇ y2 2 Zd W ky1 y2 k1 1 D N ˇ be the number of elements of Zd on the boundary of the cube of size 2N C3 centered at y1 . For any N 2 N, we have I.N / D .2N C 3/d .2N C 1/d and I.0/ D 3d 1, therefore, for any N 2 N0 , I.N / 3d .N C 1/d :
(9)
Define, for any N; k 2 N, ˇ8 9ˇ ˇ< k =ˇˇ X ˇ I.N; k/ D ˇˇ .yj /0j k 2 .Zd /kC1 W .kyj yj 1 k1 1/ D N ˇˇ ;ˇ ˇ: j D1
(10)
42
G. Maillard et al.
the number of sequences in .Zd /kC1 having size N . By (9) and (10), we have X
k Y
.N1 ;:::;Nk /W Pk i D1 Ni DN
i D1
I.N; k/ D
X
3d k
3
I.Ni /
k Y .Ni C 1/
!d
i D1
.N1 ;:::;Nk /W Pk i D1 Ni DN
dk
!
! k C N C 1 dN 2 ; N
(11)
where, in the last line, we used that k Y
max
.N1 ;:::;Nk /W Pk i D1 Ni DN
.Ni C 1/ D 2N :
i D1
Using (11) and the fact that Zd , we obtain n b Mnd c bX Md c n X n M 3 j A j I N; M N D0 N D0
3
n M
n bX Md c
N D0 n M
2n M
!
N
2n
2
dN
3
n M
M X
N D0
n M
! C N C 1 dN 2 N 2n M
N
! 2dN
2n M
D 3 .2d C 1/ ; which ends the proof of the lemma.
t u
2.2 The Bad Environment Set BE This section is devoted to the proof of the leftmost part of (6) for suitable set BE defined below. We say that an environment is good w.r.t. an M -skeleton .y0 ; : : : ; y Mn / if we have ˇn oˇ n n ˇ ˇ W 9.x; jM / 2 Byjj s.t. s .x/ D 0 8s 2 ŒjM; jM C 1 ˇ : ˇ 0j < M 4M
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
43
Since we want the environment to be good w.r.t. all appropriate M -skeleton, we define the bad environment set as BE D f9 an M -skeleton 2 A s.t. is not good w.r.t. itg: In the next lemma we prove that for any fixed M -skeleton, the probability that is not good w.r.t. it is at most exponentially small in n=M . Lemma 2.2. Take .yi /0i Mn 2 an M -skeleton. For M big enough, we have P is not good w.r.t. .yi /0i Mn .4K/n=M ; where K is the universal constant defined in Lemma 2.1. Therefore, combining Lemmas 2.1 and 2.2, we get P .BE / 4n=M for M big enough, from which we obtain the leftmost part of (6). Before proving Lemma 2.2, we first give an auxiliary lemma. In order to study the evolution of the VM, we consider, as usual, the dual process, namely, a coalescing random system that evolves backward in time. To that aim, define .X x;t .s//0st to be the random walk starting from 0 at time t (i.e., X x;t .0/ D 0). From the graphical representation of the VM, we can write t .x/ D 0 .X x;t .t//, x 2 Zd , and therefore the the VM process can be expressed in terms of its initial configuration and a system 0 0 of coalescing random walks. Two random walks X x;s and X x ;s with s 0 < s meet if 0 0 there exists u s 0 such that X x ;s .s 0 u/ D X x;s .s u/. It is therefore the same 0 0 to say that X x;s and X x ;s with s 0 < s meet (in some appropriate time interval) if there exists t 0 in this interval (by letting t D s 0 u) such that 0 0
X x ;s .t/ D X x;s .t C s s 0 /: For convenience we will adopt this notation in the rest of the section. 0
0
Lemma 2.3. Take two independent random walks X x;s and X x ;s with s 0 < s. Then the probability they ever meet is bounded above by Z1 pt .0; 0/ dt: ss 0
Proof. Consider the random variable Z1 n o 0 0 W D 1 X x;s .t/ D X x ;s .t C .s s 0 // dt: 0
44
G. Maillard et al.
By symmetry, its expectation satisfies Z1 E.W / D
P X 0;0 .2t C s s 0 / D x x 0 dt
0
Z1
P X 0;0 .2t C s s 0 / D 0 dt
0
1 D 2
Z1 pt .0; 0/ dt: ss 0
Moreover, we have Z1 E.W j W > 0/ D
p2t .0; 0/ dt 0
1 2
and then, since E.W / D E.W j W > 0/ P .W > 0/, it follows that Z1 P .W > 0/ 2E.W / D
pt .0; 0/ dt: ss 0
t u We are now ready to prove Lemma 2.2. Proof. Recall that s .x/ D 0 .X x;s .s//, where 0 is distributed by a product Bernoulli law with density 2 .0; 1/. We first consider any M -skeleton .y0 ; : : : ; yn=M / 2 (even not appropriate). For each 0 j < n=M , we choose R j j j sites .x1 ; jM /; : : : ; .xR ; jM / 2 Byj such that j j P 90 k; k 0 R; k ¤ k 0 W X xk ;jM .s/ D X xk0 ;jM .s/ for some s 2 Œ0; jM (12) for 1 to be specified later (see Fig. 4). Remark that we first fix and R and then we choose M large enough so we can find these R sites. As we are in the strongly transient regime, we know that these points exist. If two such random walks hit each other, then we freeze all the random walks issuing from the corresponding block j .
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
RC6 n
45
.j C 1/M
-
j
By
jM
jM C 1 jM
-
0 0
yM
j
x1
`
` `
j
xk
`
`
j
xR
`
Zd
j
Fig. 4 Illustration of sites .xk ; jM /, k 2 f1; : : : ; Rg, for a fixed M -skeleton
For any 1 j < 0
n M
, 1 k R for some R > 0, we have
1 1 R X X j0 0 j 1 X xk0 ;j M .s C .j 0 j /M / D X xk ;jM .s/ for some s 2 Œ0; jM A E@ n M
j 0 Dj C1 k 0 D1 n M
1 X
R
Z1 pt .0; 0/ dt
j 0 Dj C1.j 0 j /M
Z1 R M
t pt .0; 0/ dt; M
and therefore, summing over 1 k R, we get 0 E@
n M
1 X
1 j0 0 j 1 X xk0 ;j M.s C .j 0 j /M / D X xk ;jM.s/ for some s 2 Œ0; jM A
R X
j 0 Dj C1 k;k 0 D1
R2 M
Z1 t pt .0; 0/ dt 2 ;
(13)
M
for M sufficiently large. Again, remark that we first fix and R, then we choose M large enough. For each j , we now define the filtration j j Ft D X xk ;jM .s/W 0 s t; 1 k R
46
G. Maillard et al.
and the sub-martingale Z j .t/ WD 0 E@
n M
1 X
R X
1 X
j0 xk0 ;j 0 M
.s C .j 0 j // D X
1 ˇ ˇ j .s/ for some s 2 Œ0; t ˇˇ Ft A;
j xk ;jM
j 0 Dj C1 k;k 0 D1
with the stopping time ˚ j D inf t 0W Z j .t/ > : We freeze every random walk issuing from block j at time jM ^ j . Using (13) and the Doob’s inequality, we can see that ! P . jM / P j
sup
0t jM
j Zt
R2 M
Z1 tpt .0; 0/ dt :
(14)
M
Since, Z j is a continuous sub-martingale except at jump times of one of the random j walks X xk ;jM and when a jump occurs, the increment is at most n M
1 X
R
p.j 0 j /M .0; 0/ 2
j 0 Dj C1
if M is big enough. Therefore, for all 0 t j , we get Z j .t/ < C 2 2
P -a.s.:
(15)
Now we say that j is good if • j > jM j j • The R random walks X x1 ;jM ; : : : ; X xR ;jM do not meet j j0 • The random walks X xk ;jM do not hit any point xk 0 during interval Œ.j j 0 / M 1; .j j 0 /M for j 0 < j j0
j
• The random walks X xk ;jM do not meet X xk0 ;j
0M
for j 0 < j
By (14), we know that the probability that the first condition does not occur is j j smaller than . By definition of the sites x1 ; : : : ; xR , we know that the probability j that random walks issuing from the same block j at sites xk , k D 1; : : : ; R, hit each other is smaller than (recall (12)). Moreover, the probability that the third condition does not occur is bounded from above by
R
j 1 X j 0 D1
0 .j j Z /M
pt .0; 0/ dt; .j j 0 /M 1
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
47
which is as small as we want for M large because we are in a transient case. We still have to compute the probability that the fourth condition does not occur. Furthermore, we can see that two random walks issuing from the same block evolve independently until they meet, provided they do not meet a previous random walk. From the above consideration, we get j 1 X ˇ P j is not good ˇ G j 1 3 C
R X
ˇ j0 0 j 0 P X xk ;jM meets X xk0 ;j M ˇ G j ;
j 0 D1 k;k 0 D1
where
j0 xk ;j 0 M 0 0 j0 G D X : .s/W 1 k R; 1 j j; 0 s j M ^ j
j0
j
Here, we recall that X xk ;jM meets X xk0 ;j j0
j
X xk ;jM .s C .j j 0 /M / D X xk
0M
;j 0 M
(with j 0 < j ) if we have 0 .s/ for some s 2 0; j ^ j 0 M :
By (15), we have, for all j 0 fixed, n M
1 X
R X
P X
j
xk ;jM
meets X
ˇ ˇ j0 ˇ G 2: ˇ
j0
xk0 ;j 0 M
j Dj 0 C1 k;k 0 D1
Summing over all 1 j 0 n=M 2, we get n M
2 X
n M
1 X
j0 0 j P X xk ;jM meets X xk0 ;j M
R X
j 0 D1 j Dj 0 C1 k;k 0 D1
ˇ ˇ j0 n ˇ G 2; ˇ M
and then, interchanging the sums, we arrive at n M
1 j 1 X X
j0 0 j P X xk ;jM meets X xk0 ;j M
R X
j D2 j 0 D1 k;k 0 D1
Thus, there are at most j 1 X
n 2M
R X
j 0 D1 k;k 0 D1
˘
ˇ ˇ j0 n ˇ G 2: ˇ M
random positions j with the property
j0 0 j P X xk ;jM meets X xk0 ;j M
ˇ ˇ j0 ˇ G 4; ˇ
48
G. Maillard et al.
and so at least
˙
n 2M
j 1 X
2 random positions j have the property R X
j0 0 j P X xk ;jM meets X xk0 ;j M
j 0 D1 k;k 0 D1
ˇ ˇ j0 ˇ G < 4: ˇ
For these random positions j , we then have P j is good j G j 1 1 7: n Using an elementary coupling, we have at least 3M positions that are good with probability bounded by n 1 ec./n=M P Y 3M
for Y B
l n m 2; 1 7 2M
and c./ ! 1 as ! 0. Therefore, outside of a small probability ec./n=M , for j n xk ;jM at least 3M positions j , we have that the random walks X are disjoint and j
so the values 0 .X xk ;jM .s// are independent until time s jM . Then, using the fact that .0 .x//x2Zd are i.i.d. Bernoulli product with parameter , we have that j the number of positions j so that there exists .x; jM / 2 Byj with s .x/ D 0 and n s 2 ŒjM; jM C 1 is at least 4M outside the probability P Y0
n 12M
1 4K
n=M
n with Y 0 B 3M ; .1 e1 .1 //R , where and R are chosen small and large enough, respectively. t u The proof of the leftmost part of (6) is now completed.
2.3 The Bad Random Walk Set BW This section is devoted to the proof of the rightmost part of (6). We are now interested in the random walk X . We are going to prove that .X .s//0sn has an appropriate M -skeleton and touches enough zeros outside a probability event exponentially small in n (see Lemmas 2.4 and 2.5 below, respectively). To define the bad random set BW announced in (5), we are going to define BW D BW1 [ BW2 , where the bad sets BW1 and BW2 correspond, respectively, to random walk trajectories X which do not have appropriate M -skeleton and do
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
49
not touch enough sites occupied by a zero configuration of the VM. To be more precise, define ˚ BW1 D . .X / … A : In the next lemma, we prove that the probability of BW1 is exponentially small in n. Lemma 2.4. Take .X .s//0sn and .X / D .y0 ; : : : ; yn=M / the associated M skeleton. Then, there exists a constant K 0 not depending on n such that 0
P .BW1 / eK n : Proof. In order to have the random walk moving from one block of the skeleton to a nonadjacent one, the random walk has to make at least M steps in the same direction. Keeping that in mind, define Yj .s/ D X .jM C s/ X .jM / and let j
1 D inffsW kYj .s/k1 M g;
˚ j j j i D inf s > i 1 W kYj .s/ Yj .i 1 /k1 M :
Next, define j
Wi D 1fji <M g and use an elementary coupling to have P .W1 D 1/ ec=M j
and P .Wi D 1jWi 1 D 1/ ec.i /=M ec=M j
j
for some constants c and c.i / which verify c.i / c. Therefore, we have that j the number of jumps for the j th block is bounded above by the number of Wi that are equal to 1. Using a coupling we can see that this is bounded above by a geometric law with parameter ec=M . Now if we consider all the blocks, by elementary properties of geometric random variables, we have
for Y B is done.
n M
n 0 ec n P .BW1 / P Y Md 1 C d1 ; ec=M , some constant c 0 > 0, M being large and the proof t u
Lemma 2.4 proves the first part of the rightmost part of (6), namely the part concerned with bad set BW1 . Now we look at the number of times X stays on a site where the VM has zero value. For that, define ˚ i C1 D inf t > i C 1W 9x 2 Zd s.t. kx X .t/k1 2M; s .x/ D 0 8s 2 Œt; t C 1
50
G. Maillard et al.
with 0 D 0 and k.M / D e1=2
inf
kxk1 2M
P X .1=2/ D x j X .0/ D 0
(remark that k.M / does not depend on n and is strictly positive). Finally, we define BW2 D
8 < :
Zn .X ; /W b
n 2M
c n 1 and 0
9 =
k.M / s .X .s// ds n 1 8M ;
as being the bad set corresponding to random walk trajectories X which do not touch enough sites occupied by a zero configuration of the VM. In the next lemma, we prove that such a set has an exponentially small probability in n. Lemma 2.5. There exists a constant ı > 0 not depending on n, such that, for M big enough, we have P .BW2 / enı : Proof. Take any realization of and for each time i , define a random variable Yi which takes value 1 if X reaches a site with value zero at time i C 12 and stays at that point until time i C 1, and takes value 0 otherwise. Remark that after having fixed n, we can choose the state of t , t > n, as we want, for example, full of zeros. Continue until bn=.2M /c which is finite if is well chosen after time n. Using the strong Markov property, for every ki 2 f0; 1g, we see that P .Yi D 1jYj D kj ; j < i / D P .Yi D 1jYi 1 D ki 1 / k.M /: Pbn=.2M /c 0 Then, it follows that Y WD i D1 Yi is stochastically greater than Y the n binomial random variable B 2M ; k.M / . Moreover, if bn=.2M /c n 1, we have Zn s .X.s// ds n 0
1 Y: 2
Hence, we get
1 nk.M / P .BW2 / P b n c n 1 and n Y n 2M 2 8M
Y nk.M / P n n 2 8M
nk.M / DP Y 4M ecn
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
51
for n sufficiently large and c, a positive constant not depending on n. This result being shown for any realization of (up to time n), this ends the proof. t u Lemma 2.5 proves the second part of the rightmost part of (6), namely the part concerned with bad set BW2 . To complete the proof of (7), it suffices to use the definition of BE and BW D BW1 [ BW2 , and to remark that if BE and BW1 do not occur, then the first condition of BW2 , namely bn=2M c n 1, is satisfied and therefore the second must be violated.
2.4 Proof of Theorem 1.1 The proof of Theorem 1.1 can be deduced from the proof of Theorem 1.3. Without assuming that p.; / is symmetric, it is enough to see that R1 • 0 tpt .0; 0/ dt < 1, by local CLT • There is enough symmetry because there exists some C > 0 such that pt .x; 0/ Cpt .0; 0/ for all x 2 Zd and t 2 Œ0; 1/. Therefore, Lemma 2.2 can still be applied. From these two observations, the proof of Theorem 1.1 goes through the same lines as the one of Theorem 1.3.
3 Proof of Theorem 1.4 In this section we consider the Lyapunov exponents when the random walk kernel associated to the voter model noise is symmetric and also not strongly transient, that is Z1 tpt .0; 0/ dt D 1: 0
We want to show that when p.; / is symmetric and not strongly transient, then p ./
8 2 .0; 1/; 8p 1:
Since the result is easily seen for recurrent random walks, we can and will assume in the following that Z1 pt .0; 0/ dt < 1: 0
52
G. Maillard et al.
Given the reasoning of [6], Sect. 3.1, and [7], Sect. 5.1, this result will follow from Proposition 3.1. Consider, in the graphical representation associated to the VM , .t/ WD number of distinct coalescing random walks produced on f0g Œ0; t (This quantity is discussed in Bramson, Cox and Griffeath [1]). Proposition 3.1. Assume that p.; / is symmetric and not strongly transient, then for any > 0, we have that lim P .t/ t D 1: t !1
Before proving Proposition 3.1, we will first give the proof of Theorem 1.4. Proof. From the graphical representation of the VM and Proposition 3.1, we can see that for all ı > 0 and M < 1, P .x; s/ D 1 8kxk1 M; 8s 2 Œ0; t eıt for all t sufficiently large (see [7], proof of Lemma 5.1). Thus, just as in [7], Sect. 5.1, we have for all p 1, E.Œu.0; t/p / p ept P kX .s/k1 < M 8s 2 Œ0; t P .x; s/ D 1 8kxk1 < M; 8s 2 Œ0; t et .pıc.M /p/ for c.M / ! 0 as M ! 1. From this, it is immediate that 1 log E.Œu.0; t/p /1=p D : t !1 t lim
t u
To prove Proposition 3.1, we consider the following system of coalescing random walks: I D fX t W t 2 Pg for P a two sided, rate one Poisson process and X t a random walk defined on s 2 Œt; 1/, starting at 0 at time t (we could equally well consider a system of random walks indexed by hZ for some constant h). The coalescence is such that 0 0 for t < t 0 2 P, X t , X t evolve independently until T t;t D inffs > t 0 W X t .s/ D 0 0 0 X t .s/g, and then, for s T t;t , X t .s/ D X t .s/. We will be interested in the density or number of distinct random walks at certain times. To aid this line we will adopt a labeling procedure for the random walks,
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
53
whereby effectively when two random walks meet for the first time, one of them (chosen at random) dies; in this optic the number of distinct random walks will be the number still alive. Our labeling scheme involves defining for each t 2 P; the label process lst for s t (it will be helpful to be able to define ltt D t, though since at time t there may well be other random walks present at the origin, it will not necessarily be the case that ltt D t). These processes will be defined by the following properties: 0
0
• If for t ¤ t 0 2 P; X t .s/ ¤ X t .s/, then lst ¤ lst . • If t1 ; t2 ; : : : ; tr are elements of P, then at s maxft1 ; : : : ; tr g, if X t1 .s/ D X t2 .s/ D D X tr .s/, then lst1 D lst2 D D lstr D u for some u 2 P with X t1 .s/ D X u .s/. 0 • If for t ¤ t 0 2 P, X t meets X t for the first time at s, then independently of past 0 t0 and future random walks or labeling decisions lst D lst D ls with probability 12 0 t and with equal probability lst D lst D ls . t • The process ls can only change at moments where X t meets a distinct random walk for the first time. For t 2 P, s > t, we say that t is alive at time s, if lst D t; it dies at time s if D t; lst ¤ t. We say X t , X u coalesce at time s if this is the first time at which the two labels are equal. The following are easily seen: t ls
• The events Ats D flst D tg for t 2 P are decreasing in s. • Ats depends only on the random motions of the coalescing random walks and on the labeling choices involving X t . • For s > 0; the number of independent random walks X t .s/, t 2 P \ Œn; 0 is simply equal to the number of distinct labels lst , t 2 P \ Œn; 0. Let c0 D lim P t .Ats / 2 Œ0; 1;
(16)
s!1
according to palm measure, P t , for t 2 P. We obtain easily the following proposition. Proposition 3.2. lim
s!1
ˇ 1 ˇˇ˚ distinct random walks X t .0/W t 2 P \ Œs; 0/ ˇ D c0 s
a.s.
Proof. Using the definition of c0 in (16) and ergodicity of the system we see that the limit is greater than c0 . Then, Lemma 3.1 gives the result. Lemma 3.1. For c0 as defined in (16), for each > 0, there exists R < 1 so that if we consider the finite system of coalescing random walks .X t /t 2.R;0\P , then with probability at least 1 at time R there are less than .c0 C /R distinct random walks labels.
54
G. Maillard et al.
Proof. By definition of c0 , for all > 0 there exists a T0 so that P 0 label 0 is alive at time s < c0 C 100
8s T0 :
Now pick R1 so that P kX 0 .s/k1 R1 8s 2 .0; T0 / 1 : 100 Therefore, P 0 label 0 is not alive at time s T0 and kX 0 .s/k1 R1 8s 2 .0; T0 / 1 c0
2 : 100
We then pick T1 so that : P 9t 2 P \ ŒT1 ; T1 c W X t .s/1 R1 for some s 2 .0; T0 / < 100 Thus P 0 9t 2 P \ ŒT1 ; T1 n f0gW lR0 1 D t 1 c0 : 30 From the translation invariant property of the system and ergodicity if ˇn oˇ 0 ˇ ˇ s WDˇ t 2 Œs; s \PW X t loses its label to a random walk X t with jt t 0 j T1 ˇ; then lim inf s!1
s 1 c0 2s 30
a.s.
The result now follows easily.
t u
Proposition 3.1 will be proven by showing the following proposition. Proposition 3.3. If p.; / is symmetric and not strongly transient, then c0 D 0. The proof of Proposition 3.3 will work for any Poisson process rate, in particular for P having rate M 1. The distinct random walks treated in Proposition 3.1 can be divided into those coalesced with a random walk from the system derived from P (and so by Proposition 3.3 of small “density”) and those uncoalesced (also of small “density” if M is large). Thus Proposition 3.1 follows almost immediately from Proposition 3.3. The argument for Proposition 3.3 is low level and intuitive. We argue by contradiction and suppose that c0 > 0. From this we can deduce, loosely speaking,
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
55
that after a certain time either a random walk has lost its original label, or it will keep it forever. We then introduce coupling on these random walks so that we may regard these random walks as essentially independent random walks starting at 0 (at different times). We then introduce convenient comparison systems so that we can analyze subsequent coalescences. We will use automatically, without reference, the following “obvious” result. Lemma 3.2. Consider two collections of coalescing random walks fY i g and f.Y 0 /i g for i in some index set. If the coalescence rule is weaker for the f.Y 0 /i g system in that if two walks .Y 0 /i and .Y 0 /j are permitted to coalesce at time t, then so are Y i and Y j , then there is a coupling of the two systems so that the weaker contains the stronger. We now fix > 0 so that c0 (by hypothesis c0 > 0/. We choose R according to Lemma 3.1 and divide up time into intervals Ij D ŒjR; .j C 1/R/. 0 We first consider the coalescing system where random walks X t , X t , t; t 0 2 P, 0 0 can only “coalesce” (or destroy a label t or t ) if t; t are in the same Ij interval. Thus we have a system of random walks that is invariant to time shifts by integer t multiples of R. We now introduce n o a system of random walks Y , t 2 V WD [j ŒjR; .j C 1/R/ \ jR C c10 Z . The random walks Y t , t 2 jR; .j C 1/R are not permitted to coalesce up until time .j C 1/R (at least) and will evolve independently of the system .X t /t 2P until time .j C 1/R. We will match up the points in V \ Ij , with those in P \ Ij \ K in a maximal measurable way for K D ft 2 PW label t survives to time .j C 1/Rg. Lemma 3.3. Unmatched points in [j P \ Ij \ K and in V have density less than 2 for R fixed sufficiently large. Remark: the system is not translation invariant with respect to all shifts but it possesses enough invariance for us to speak of densities. We similarly have the following lemma. Lemma 3.4. Unmatched Y particles have density less than 2 for R fixed sufficiently large. It is elementary that two random walks X , Z can be coupled so that for t sufficiently large X.t/ D Z.t/. For given > 0 we choose M0 and then M1 so that
and
P sup kX.t/k1 M0 < 10 t R
(17)
sup P X0 ; Zz not coupled by time M1 < ; 10 jzj2M0
(18)
where X0 and Zz denote that the random walks X and Z start at point 0 and point z, respectively.
56
G. Maillard et al.
We then (on interval Ij ) couple systems Y and X by letting married pairs Y t , X , t 2 V , t 0 2 P \ K, evolve independently of other Y , X random walks so that 3 they couple by time M1 C .j C 1/R with probability at least 1 10 . t Thus we have two types of random walk labels, l , for the X system which are equal to t at time t C R C M1 : those for which the associated random walk was paired with a Y random walk and such that the random walks have coupled by time t C R C M1 said to be coupled and the others, said to be decoupled. This is similar for the points in V associated to Y random walks. We note that the foregoing implies that the density of uncoupled labels is bounded by 2 C 3 10 3. The point is that modulo this small density, we have an identification of the coalescing X random walks and the Y random walks. We now try to show that enough Y particles will coalesce in a subsequent time interval to imply that there will be a significant decrease in surviving labels for the X system. To do this we must bear in mind that, essentially, it will be sufficient to show a decrease in the density of Y random walk labels definitely greater than . Secondly, as already noted, we will adopt a coalescence scheme that is a little complicated 0 namely Y i ; Y i in V can only “coalesce” at time t maxfi; i 0 g if t0
• .t i 0 ; t i / are in time set to be specified 9some 0 11 • For i < i 0 , ti i 0 i 2 10 ; 10 We now begin to specify our coalescence rules for the random walk system fY i gi 2V . The objective here will be to facilitate the necessary calculations. A first objective 0 is to have coalescence of Y i ; Y i at times t > maxfi; i 0 g so that pt .0; 0/ is well 0 behaved around t i , t i . It follows from symmetry of the random walk that t 7! pt .0; 0/ is decreasing. The problem we address is that it is not immediate how to achieve bounds in the opposite direction. This is the purpose of the next result. P Lemma 3.5. Consider positive fan gn0 so that 1 nD0 an D 1. For all r 2 ZC , there exists a subsequence fa g so that n i 0 i P (i) ani D 1 (ii) ani > 12 ani r , 8i 0 Proof. If r > 1 we may consider the r subsequences fari Cj gi 0 for j 2 f0; P 1; : : : ; r 1g. At least one of these must satisfy ari Cj D 1, so, without loss of generality, we take r D 1. Now we classify i as good or bad according to whether ai > ai 1 =2 or not. This decomposes Z into intervals of bad sites, alternating with intervals of good sites. By geometric bounds, the sum of bad sites is bounded by the sum of the good ai for which i is the right end point of a good interval. Thus we have X
ai D 1;
i good
from which the result is immediate.
t u
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
57
Corollary 3.1. For our symmetric kernel pt .0; 0/ we can find ni " 1 so that P R 2ni C1 (i) tpt .0; 0/dt D 1 i 2ni (ii) p2ni 1 .0; 0/ 212 p2ni C3 .0; 0/ Proof. In Lemma 3.5 take 2ZnC4
an D
tpt .0; 0/dt 2nC3
and take r D 5. Then by the monotonicity of t ! pt .0; 0/, we have 22ni C7 p2ni C3 .0; 0/ ani
1 1 ani 5 22ni 4 p2ni 1 .0; 0/: 2 2 t u
We fix such a sequence fnj gj 1 once and for all. We assume, as we may, that nj < nj C1 4 for all j 1 and also assume again, as we may, that nj C1 2Z
tpt .0; 0/dt < 2nj
100
for all j 1. We are now ready to consider our coalescence rules. We choose ˛ 1 (we will fully specify ˛ later on but we feel it is more natural to defer the technical relations). We then choose k0 so that 2nk0 > R C M1 with R as in Lemmas 3.1 and 3.3 and M1 as in (18), and 8 9 nj C1 2Z ˆ > k < = X tpt .0; 0/ dt > ˛ : k1 WD inf k > k0 W ˆ > : ; j Dk0 nj
(19)
2
0
We have coalescence between Y i and Y i , for i < i 0 only at t 2 Œi 0 C2nj ; i 0 C2nj C1 , j 2 Œk0 ; k1 if (a) (b)
t i 0 i 0 i
2 .9=10; 11=10/ The interval of t 2 Œi 0 C 2nj ; i 0 C 2nj C1 satisfying (a) is of length at least 2
We say .i; i 0 / and .i 0 ; i / are in j and write .i; i 0 / 2 j if the above relations hold. To show that sufficient coalescence occurs, we essentially use Bonferroni inequalities (see, e.g., [4], p. 21). To aid our argument we introduce a family of independent (noncoalescing) random walks f.Z i .s//si gi 2V such that for each i 2 V , Y i .s/ D Z i .s/ for s i such that lsi D i . In the following we will deal with random walks Y 0 ; Z 0 , but lack of total translation invariance notwithstanding, it will be easy to see that all
58
G. Maillard et al.
bounds obtained for these random walks remain valid for more general random walks Y i ; Z i . For a given random walk Y 0 , say, the probability that Y 0 is killed by Y i (with i possible in the sense of the above rules) is in principle a complicated event given the whole system of coalescing random walks. Certainly the event ˚ 0 Z meets Z i in appropriate time interval after first having met Z k is easier to deal with than the corresponding Y event. From this point on we will shorten our phraseology by taking “Z i hits Z k ” to mean that Z i meets Z k at a time t satisfying the conditions (a) and (b) with respect to i , k. For .Z 0 .s//s0 and .Z i .s//si independent random walks each beginning at 0, we first estimate X P Z 0 hits Z i : i
This of course decomposes as X X j
P Z 0 hits Z i :
.0;i /2j
We fix j and consider i > 0 so that .0; i / 2 j (the case i < 0 is similar). That is the interval of times s with .s i /= i 2 .9=10; 11=10/; s 2 Œi C 2nj ; i C 2nj C1 is at least 2 in length: we note that for each i 2 54 2nj ; 74 2nj the relevant interval 19 21 5 nj 1 2nj 10 i s 10 i is an interval of length greater than 4 2 5 D 4 . Lemma 3.6. There exists c2 2 .0; 1/ so that for any interval I of length at least 1 contained in .1; 1/, 1 c2
Z
pt .0; 0/ dt P X 0 .t/ D 0 for some t 2 I c2
I
Z pt .0; 0/ dt I
Proof. Consider random variable W D
R bC1 a
1fX 0 .s/D0g ds for I D Œa; b. Then
Z ZbC1 ZbC1 0 P .X .s/ D 0/ ds D ps .0; 0/ ds 2 ps .0; 0/ ds; E.W / D a
a
I
by monotonicity of ps .0; 0/ and the fact that b a 1. But for WD inffs 2 I W X 0 .s/ D 0g we have E.W jF / e1 on f < 1g so Z P . < 1/ D P X 0 .t/ D 0 for some t 2 I E.W /e 2e ps .0; 0/ds: I
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
Equally for W 0 D
Rb a
59
1fX 0 .s/D0g ds, we have Z1
0
E.W j F / D
ps .0; 0/ ds
on f < 1g
0
and so P . < 1/
1 E.W 0 / D
Zb ps .0; 0/ ds: a
t u Proposition 3.4. For some universal c3 2 .0; 1/, c31 22nj p2nj .0; 0/
X
P Z 0 hits Z i c3 22nj p2nj .0; 0/:
.0;i /2j
Proof. We consider first the upper bound. There are less than 2nj relevant i . For such an i , P Z 0 hits Z i P X 0 .t/ hits 0 for some t 2 a C 2nj ; a C 3 2nj for some a 0. By monotonicity of t ! pt .0; 0/ and using Lemma 3.6, this is bounded by n 32 Z j
ps .0; 0/ ds c3 2nj p2nj .0; 0/
c2 2nj
for some c3 > 0. On the other side the number of i 2 54 2nj ; 74 2nj is greater 9 than c1 13 2nj if R was fixed sufficiently large and for each such i , . 10 i , 11 10 i / nj nj C1 Œ2 ; 2 . Moreover, we have 32
1 P Z 0 hits Z i c2
Z10 i ps .0; 0/ ds 28 10 i
1 4 1 nj 1 ip2nj C3 .0; 0/ 2 p2nj C3 .0; 0/ c2 10 c2
213 nj 2 p2nj 1 .0; 0/ c31 2nj p2nj .0; 0/; c2
because of Lemma 3.1, Corollary 3.1 (by our choice of j ), monotonicity of t ! u t pt .0; 0/ and possibly after increasing c3 .
60
G. Maillard et al.
Thus, using that j 2 Œk0 ; k1 (recall 19), we have a universal c4 such that c4 ˛
X X j
.0;i /2j
˛ P Z 0 hits Z i : c4
There are two issues to address to show that (a) P 9j; 9i so that .0; i / 2 j; Z 0 hits Z i (b)
is of the order ˛ (a) holds with Z 0 , Z i replaced by our coalescing random walks Y 0 , Y i
In fact both parts are resolved by the same calculation. We consider the probability that random walk Z 0 is involved in a “3-way” 0 collision with Z i and Z i either due to Z 0 hitting Z i in the appropriate time interval 0 i0 and then hitting Z , or Z 0 hitting Z i and, subsequently Z i hitting Z i . The first case is important to bound so that one can use simple Bonferroni bounds to get a lower bound on P .9i so that Z i hits Z 0 /. The second is to take account of the fact that we are interested in the future coalescence of a given random walk Y 0 . As already noted, we can couple the systems in the usual way so that for all t, [i fYti g [i fZti g. The problem is that if for some i , Z i hits Z 0 due to coalescence 0 this need not imply that Y i hits Y 0 : if the Y i particles coalesced with a Y i before i 0 Z hits Z . Fortunately this event is contained in the union of events above over i , i 0 . Proposition 3.5. There exists universal constant K so that for all i and i 0 with .0; i 0 / 2 j 0 0 P Z 0 hits Z i and then Z i K2nj 0 p2nj 0 .0; 0/P Z 0 hits Z i : Proof. There are several cases to consider: i < 0 < i 0 , i < i 0 < 0, i 0 < i < 0, i 0 < 0 < i , 0 < i < i 0 and 0 < i 0 < i . All are essentially the same so we consider explicitly 0 < i < i 0 . We leave the reader to verify that the other cases are analogous. We choose j , j 0 so that .0; i / 2 j and .0; i 0 / 2 j 0 (so necessarily j 0 j ). We condition on Tj , Z i .Tj /.D Z 0 .Tj //, for h
i 19i 21i ; \ i C 2nj ; i C 2nj C1 W Z i .s/ D Z 0 .s/ < 1: Tj WD inf s 2 10 10 With x D Z 0 .Tj / we have h
ˇ i 19i 0 21i 0 nj 0 0 nj 0 C1 0 0 i0 0 0 0 ˇ 0;i ; \ i C 2 ;i C 2 W Z .s / D Z .s / ˇ G P 9s Tj 2 10 10 D P Z 0 .t/ D x for some t 2 Ij ;
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
61
where Ij is the image of the interval
.i 0 C 2nj 0 / _ Tj _
19i 0 0 21i 0 ; i C 2nj 0 C1 ^ ; 10 10
by the function t 7! 2t Tj i 0 , for G 0;i D .Z 0 .s/; Z i .s/W s Tj /. By elementary algebra this is less than
0 9i 16i 0 ; ; P Z 0 .t/ D x for t 2 10 5 but by arguing as in Lemma 3.6, this is bounded by 16i 0
16 0
Z5
Z5 i ps .0; x/ ds c2
c2 9i 0 10
ps .0; 0/ ds c2 9 0 10 i
c2
23 0 i p2nj 0 1 .0; 0/ 10
23 13 nj 0 2 2 p2nj 0 C3 .0; 0/ c 0 2nj 0 p2nj 0 .0; 0/ 9
for some universal constant c 0 , where we use symmetry and monotonicity of ps .; / and Corollary 3.1, by the choice of our nj 0 . So given that P .Ti < 1/ D P Z 0 hits Z i ; the desired bound is achieved.
t u
Corollary 3.2. For ˛ sufficiently small ˛ P 9i W Z 0 hits Z i : 2 Proof. By Bonferroni, the desired probability is superior to X X 0 ˛ 0 P Z 0 hits Z i P Z hits Z i and then Z i ˛ Kc32 ˛ 2 2 0 i i;i
if ˛ 1=.2Kc32/.
t u
We similarly show the following proposition. Proposition 3.6. There exists universal constant K so that for all i 0 and i with .0; i / 2 j , 0 0 P Z 0 hits Z i after Z i hits Z i K2nj p2nj .0; 0/P Z i hits Z i : This gives the following corollary.
62
G. Maillard et al.
Corollary 3.3. For the coalescing system fY i gi 2V provided ˛ is sufficiently small, ˛ P Y i dies after time R : 5 Proof. We have of course from the labeling scheme P Y i dies after time R 1 i 0 P Y hits Y i in appropriate time interval for some i 0 2 1 0 P Z i hits Z i in appropriate time interval for some i 0 2 1 0 P Z i hits Z i in appropriate time interval for some i 0 so that 2 0 00 Z i hits some Z i previously
˛ ˛ Kc32 ˛ 2 4 5
for ˛ 1=.20Kc32/.
t u
We can now complete the proof of Proposition 3.3 and hence that of Proposition 3.1. If we have c0 > 0, then we can find 0 < < ˛=200 and ˛ so small that the relevant results above hold, in particular Corollary 3.3. Thus the density of Y’s is reduced by at least ˛=5. But by our choice of and Lemma 3.3, the density of X ’s is reduced by at least ˛=5 6 ˛=6 3 which is a contradiction with Proposition 3.2, because it would entail the density falling strictly below c0 .
4 Proof of Theorem 1.4 In what follows we assume, as in Sect. 2, that p D 1, the extension to arbitrary p 1 being straightforward. We begin by specifying the random walk .X.t//t 0 on Z4 defined by X.t/ D S.t/ C e1 N.t/ with .S.t//t 0 denoting a simple random walk on Z4 , .N.t//t 0 a rate 1 Poisson process and e1 D .1; 0; 0; 0/ the first unit vector in Z4 . Thus our random walk .X.t//t 0 is highly transient but its symmetrization is a mean zero random walk and by the local central limit theorem, we have Z1
.s/
tpt .0; 0/ dt D 1; 0
where pt .; / is the semigroup associated to .X.t//t 0 .
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
63
It remains to show that p ./ < for all 2 Œ0; 1/. Our approach is modeled on the proof of the first part of Theorem 1.3. We wish again to pick bad environment set BE associated to the -process and bad random walk set BW associated to the random walk X so that 0 31 2 n Z E @exp 4 s .X .s// ds 5A (20) 0
2
.P .BE / C P .BW // e n C E 11BEc \BWc exp 4
Zn
#1 s .X .s// ds A
0
(21) with, for some 0 < ı < 1, P .BE / eın ;
P .BW / eın ;
(22)
and, automatically from the definition of BE and BW , Zn s .X .s// ds n.1 ı/
on BEc \ BWc
(23)
0
(as in the proof of Theorem 1.3). Since, combining (20)–(23), we obtain 0 2 n 31 Z 1 lim log E @exp4 s .X .s// ds 5A < ; n!1 n 0
it is enough to prove (22). All of this has been done in the proof of Theorem 1.3 in a different situation. The major difference is that we need to modify the collection of skeletons used. Lemma 4.1. Let X ./ be a speed simple random walk in four dimensions. Fix M 2 N n f1g. There exists c > 0 so that for M large and all n, outside of an ecn probability event, there exists 0 i1 < i2 < < in=2M n so that X.1/ .ij M C kM / X.1/ .ij M / >
kM ; 2
j 2 f1; : : : ; n=.2M /g; k 0;
where .X.1/ .t//t 0 denotes the first coordinate of .X .t//t 0 .
Proof. Define ˚ 1 D inf kM > 0W X.1/ .kM / kM=2
(24)
64
G. Maillard et al.
and recursively ˚ i C1 D inf kM > i W X.1/ .kM / X.1/ .i / .kM i /=2 : Since the event ˚ frM 1 < 1g [1 kDr X.1/ .kM / kM=2 ; we have easily that, for all r, P .rM 1 < 1/ erM c for c > 0 not depending on n or M . If we now define ˚ .jM / X.1/ .kM / > .j k/M=2 8j > k 1 D inf kM > 0W X.1/ and recursively ˚ i C1 D inf kM > i W X.1/ .jM / X.1/ .kM / > .j k/M=2 8j > k ; it is easily seen that P .1 rM / P .91 k rW rM k < 1/
r1 X
X
P i D xi M 8i k; rM kC1 < 1
kD1 0<x1 <<xk
r1 X
X
erM c erM c 2r
kD1 0<x1 <<xk
which is less than erM c=2 if M is fixed sufficiently large. We have • .i C1 i /i 1 are i.i.d. (this follows from Kuczek’s argument (see [9])). • Provided M has been fixed sufficiently large for each integer r 1, P .i C1 i rM / erM c=4 . This follows from the fact that random variable i C1 i is simply the random variable 1 conditioned on an event of probability at least 1=2 (provided M was fixed large). Thus by elementary properties of geometric random variables we have n ecn P .n=2M > n/ P Y 2M for Y B lemma.
n M
; ecM=4 , c > 0, and M large. This completes the proof of the t u
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
65
Given that the path of the random walk satisfies the condition of this lemma, we call the (not uniquely defined) points i1 ; i2 ; : : : regular points. Given this result, we consider the M -skeleton induced by the values fX .jM /, 0 j n=M g, discretized via spatial cubes of length M=8 (rather than 2M as in the proof of Theorem 1.3). It is to be noted that if .X .t//0t n satisfies the claim for Lemma 4.1 and y0 WD 0; y1 ; y2 ; : : : ; yn=M with yk 2 Z4 , 0 k n=M , is its M -skeleton, namely, X .kM / 2 Cyk WD
4 Y M .j / M .j / ; ; .yk C 1/ yk 8 8 j D1
0 k n=M;
(25)
.j /
where yk denotes the j th coordinate of yk (we suppose without loss of generality that M is a multiple of 8), then, by (24) and (25), we must have .1/
.1/
yij 4k yij Ck C 1: In particular, we must have .1/
.1/
yij 0 4.ij ij 0 / yij C 1
8ij 0 < ij :
(26)
In the following we modify the definition of appropriate skeletons by adding in the requirement that the skeleton must possess at least n=2M indices i1 ; i2 ; : : : ; in=2M with the corresponding yij satisfying (26). We note that the resizing of the cubes makes the notion of acceptability a little more stringent but does not change the essentials. Remark first that Lemma 2.5 is still valid in our new setting. Lemma 4.1 immediately gives that with this new definition, Lemma 2.4 remains true. Of course since this definition is more restrictive we have j A j K n=M for K as in Lemma 2.1. In fact in our program all that remains to do, i.e., in any substantive way different from the proof of Theorem 1.3, is to give a bound on the probability of BE for appropriate BE . This is the content of the lemma below (analogous to Lemma 2.2). Given this lemma, we can then proceed exactly as with the proof of Theorem 1.3. Lemma 4.2. For any skeleton .yk /0kn=M in A , the probability that is not good for .yk /0kn=M , i.e., 69
n n indices 1 j W s .z/ D 0 8s 2 ŒjM; jM C 1 for some z 2 Cyj ; 4M M
is less than .4K/n=M .
66
G. Maillard et al.
Proof. We note that proving the analogous result for Theorem 1.3, we did not need our skeleton to be in A , the proof worked over any skeleton. For us however it is vital that our skeleton satisfies (26). We consider a skeleton in A . Let the first n=2M regular points of our skeleton be i1 ; i2 ; : : : ; in=2M . For each 1 ij n=2M , we choose R points i
i
x1j ; : : : ; xRj 2 Cyij i
so spread out that for random walks .X.t//t 0 as in (4) beginning at the points xkj , k D 1; : : : ; R, the chance that two of them meet is less than 0 < 1. Now, consider ij 0 < ij and the probability that a random walk starting at i
i
0
.xkj ; ij M / meets a random walk starting at .xkj0 ; ij 0 M / satisfies the following lemma. Lemma 4.3. For ij 0 < ij , there exits K > 0 such that
i ij 0 j P X xk ;ij M meets X xk0 ;ij 0 M
M 2 .i
K : 2 j ij 0 /
Proof. The important point is that since our skeleton is in A ,
i
xkj0
0
.1/
.1/ M M i C ; xkj C .ij ij 0 / 2 4
(27)
and so we have
i ij 0 j xk0 ;ij 0 M xk ;ij M P X meets X P
i .1/ j i .1/ 3M X xk ;ij M ; .ij ij 0 /M xkj C .ij ij 0 / 4 ij 0 ij xk0 ;ij 0 M xk ;ij M X meets X
i .1/ j ij .1/ 3M xk ;ij M 0 0 CP X : .ij ij /M xk C .ij ij / 4 By standard large deviation bounds,
i .1/ j ij .1/ 3M xk ;ij M P X eCM.ij ij 0 / ; .ij ij 0 /M xk C .ij ij 0 / 4 for some universal C 2 .0; 1/. For the other term, we have the following lemma.
Parabolic Anderson Model with Voter Catalysts: Dichotomy in the Behavior
67
Lemma 4.4. For two independent processes X D .X.t//t 0 and Y D .Y .t//t 0 with X.0/ D x 2 Z4 and Y .0/ D y 2 Z4 , the probability that X ever meets Y is bounded by K=kx yk21 . Proof. X Y is not exactly a simple random walk, but it is a symmetric random walk and so local CLT gives appropriate random walks bounds (see, e.g., [10]). u t From this and inequality (27), we have
i ˇ ij .1/ ij 0 j ˇ P X xk ;ij M meets X xk0 ;ij 0 M ˇ X xk ;ij M .ij ij 0 /M i .1/ 3M C .ij ij 0 / xkj 4
K : M 2 .ij ij 0 /2 t u
Thus, for any R large but fixed, we can choose M so that for all skeletons in A and each ij 0 , we have C1 ij 0 X X ij R2 K X 1 xk0 ;ij 0 M xk ;ij M P X meets X M 2 rD1 r 2 0 i
j0
k;k
R2 K 0 < 2 M2
with M chosen sufficiently large, which is analogous to (13). From this point on, the rest follows as for the proof of Lemma 2.2. u t
References 1. Bramson, M., Cox, J.T., Griffeath D.: Occupation time large deviations of the voter model. Probab. Theory Relat. Fields 77, 401–413 (1988) 2. Carmona, R.A., Molchanov, S.A.: Parabolic Anderson Problem and Intermittency. AMS Memoir 518. American Mathematical Society, Providence, RI (1994) 3. Clifford, P., Sudbury, A.: A model for spatial conflict. Biometrika 60, 581–588 (1973) 4. Durrett, R.: Probability: Theory and Examples, 3rd edn. Thomson, Brooks/Cole, Duxbury Advanced Series (2005) 5. G¨artner, J., den Hollander, F.: Intermittency in a catalytic random medium. Ann. Probab. 34, 2219–2287 (2006) 6. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts: Symmetric exclusion. Electron. J. Probab. 12, 516–573 (2007) 7. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts: Voter model. Ann. Probab. 38, 2066–2102 (2010) 8. Holley, R.A., Liggett, T.M.: Ergodic theorems for weakly interacting infinte systems and the voter model. Ann. Probab. 3, 643–663 (1975)
68
G. Maillard et al.
9. Kuczek, T.: The central limit theorem for the right edge of supercritical oriented percolation. Ann. Probab. 17, 1322–1332 (1989) 10. Lawler, G.F., Limic, V.: Random Walk: A Modern Introduction. Cambridge Studies in Advanced Math., vol. 123. Cambridge University Press, Cambridge (2010) 11. Liggett, T.M.: Interacting Particle Systems. Grundlehren der Mathematischen Wissenschaften, vol. 276. Springer, New York (1985) 12. Spitzer, F.: Principles of Random Walk, 2nd edn. Springer, Berlin (1976)
Precise Asymptotics for the Parabolic Anderson Model with a Moving Catalyst or Trap Adrian Schnitzler and Tilman Wolff
Abstract We consider the solution uW Œ0; 1/ Zd ! Œ0; 1/ to the parabolic Anderson model, where the potential is given by .t; x/ 7! ıYt .x/ with Y a simple symmetric random walk on Zd . Depending on the parameter 2 Œ1; 1/, the potential is interpreted as a randomly moving catalyst or trap. In the trap case, i.e., < 0, we look at the annealed time asymptotics in terms of the first moment of u. Given a localized initial condition, we derive the asymptotic rate of decay to zero in dimensions 1 and 2 up to equivalence and characterize the limit in dimensions 3 and higher in terms of the Green’s function of a random walk. For a homogeneous initial condition, we give a characterisation of the limit in dimension 1 and show that the moments remain constant for all time in dimensions 2 and higher. In the case of a moving catalyst ( > 0), we consider the solution u from the perspective of the catalyst, i.e., the expression u.t; Yt C x/. Focusing on the cases where moments grow exponentially fast (that is, sufficiently large), we describe the moment asymptotics of the expression above up to equivalence. Here, it is crucial to prove the existence of a principal eigenfunction of the corresponding Hamilton operator. While this is well-established for the first moment, we have found an extension to higher moments. AMS 2010 Subject Classification. Primary 60K37, 82C44; Secondary 60H25.
A. Schnitzler () Technische Universit¨at Berlin, Institut f¨ur Mathematik, Straße des 17. Juni 136, 10623 Berlin, Germany e-mail:
[email protected] T. Wolff Weierstrass Institute for Applied Analysis and Stochastics, Mohrenstraße 39, 10117 Berlin, Germany e-mail:
[email protected] J.-D. Deuschel et al. (eds.), Probability in Complex Physical Systems, Springer Proceedings in Mathematics 11, DOI 10.1007/978-3-642-23811-6 4, © Springer-Verlag Berlin Heidelberg 2012
69
70
A. Schnitzler and T. Wolff
1 Introduction The parabolic Anderson model (PAM) is the heat equation on the lattice with a random potential, given by (
@ u.t; x/ @t
D u.t; x/ C .t; x/u.t; x/;
.t; x/ 2 .0; 1/ Zd ; x 2 Zd ;
u.0; x/ D u0 .x/;
(1)
where > 0 denotes a diffusion constant, u0 a nonnegative function and the discrete Laplacian, defined by f .x/ WD
X
Œf .y/ f .x/ ;
x 2 Zd ; f W Zd ! R:
y2Zd W jxyjD1
Furthermore, W Œ0; 1/ Zd ! R is a space- and time-dependent random potential. We deal with the special case that the potential is given by .t; x/ D ıYt .x/;
.t; x/ 2 Œ0; 1/ Zd ;
with a simple symmetric random walk Y with generator that starts in the origin and a parameter 2 Œ1; 1/ called coupling constant. In this paper, we analyse the large time asymptotics after averaging over the potential which is usually referred to as annealed asymptotics. We denote expectation with respect to the potential by hi. One possible interpretation of this system arises from chemistry. Here, u.t; x/ describes the concentration of reactant particles in a point x at time t in the presence of a randomly moving particle. In the case < 0, the particle acts as a decatalyst (or trap) that kills reactant particles with rate at its position. In the case of positive , we consider a catalyst particle that causes reactants to multiply with rate . In both cases, hu.t; x/i is interpreted as the averaged concentration. For further interpretations and an overview over the PAM, see, for instance [2, 13, 18] and [12]. Annealed asymptotics in the case of a positive coupling constant have already been investigated in [5]. In the present work, we derive similar results with regard to the expression uQ .t; x/ WD u .t; Yt C x/, which can be interpreted as the particle concentration in a neighbourhood of the catalyst. In addition to logarithmic asymptotics in terms of Lyapunov exponents, we derive asymptotics up to equivalence for most of the parameter choices where exponential growth is observed. The case that is negative has to the best of our knowledge not been investigated so far. Its analysis relies on techniques quite different from those in the catalyst case as a functional analytic approach proves unfeasible here. We calculate moment limits dependent on the model parameters and, in the case of moment convergence towards zero, specify the convergence speed up to equivalence.
Parabolic Anderson Model
71
Whereas the PAM with time-independent potential or white-noise potential is well understood, some other time-dependent potentials have just been examined recently. In [6, 11], and [14], for instance, the authors investigate the case of infinitely many randomly moving catalysts. In [3], the authors deal with the case of finitely many catalysts, whereas the article [4] is dedicated to a model similar to the case of infinitely many moving traps. Further examples of time-dependent potentials can be found in [7, 8, 10, 17], and the recent survey [9]. Within these proceedings, [15, 16] and [19] deal with the parabolic Anderson model with time-independent potential. In Sect. 2.1, we analyze the PAM with localized initial condition u0 D ız and < 0. Let D X E Mz .t/ WD u.t; x/ ; .t; z/ 2 Œ0; 1/ Zd ; x2Zd
denote the expected total mass of the system at time t if the solution is initially localized in z and the trap starts in the origin. We find Theorem 1. For d D 1; 2 and every z 2 Zd , .i / .i i /
Mz .t/
p2
p
C 1 2; t
1 ; Mz .t/ 4 C .log t/
t !1
for
d D 1I
t !1
for
d D 2;
and Theorem 2. For d 3 and every z 2 Zd , lim Mz .t/ D 1 C
t !1
G1 .z/; C G1 .0/
where G denotes the Green’s function of a random walk with generator . Remark 1. Theorems 1 and 2 can be generalized to all initial conditions with compact support without much effort. In Sect. 2.2, we analyze the case of a homogeneous initial condition u0 1. We find that in dimensions 2 and higher, the average total mass in each point remains constant for all t. This seems surprising since a symmetric random walk is recurrent in dimensions 1 and 2, but it follows by a rescaling argument and the fact that a Brownian motion is point recurrent only in dimension 1. In dimension 1, we give a representation of the asymptotic mass that depends on a WD =; but not on the strength of the potential . Let mx .t/ WD hu.t; x/i ;
.t; x/ 2 Œ0; 1/ Zd ;
72
A. Schnitzler and T. Wolff
denote the expected mass at time t in the lattice point x. The main results of this section are for d D 1, Theorem 3. For all x 2 Z, lim mx .t/ D 1
t !1
1
q
Z1
2
as .1 C a/.1 s/s C 1Ca ; 1 C s as 2 1 C .1Ca/ 2
ds 0
and for higher dimensions Theorem 4. For d 2 and all x 2 Zd , lim mx .t/ D 1:
t !1
Remark 2. Even though the formula in Theorem 3 looks quite clumsy, we find that limt !1 mx .t/ is decreasing in a. It tends to 1=2 as a tends to zero and it tends to zero as a tends to infinity. The third section is dedicated to analysing the leading order asymptotics of moments of the PAM solution from the perspective of the catalyst, i.e., we consider > 0 and the expression uQ .t; x/ WD u .t; Yt C x/. For p 2 N and x D .x1 ; : : : ; xp / 2 Zpd , we denote by Y p p m Q x .t/ WD uQ .t; xi / i D1
the p-thmixed moment at x. Moreover, introduce the p-th Hamilton operator on l 1 Zpd by H p WD A p C V p ; Pp where the potential V p is defined as .V p f /.x/ D i D1 ı0 .xi /f .x/, and A p acts on l 1 Zpd as A p f .x/ D
X e2Zpd
jejD1
.f .x C e/ f .x// C
X f .x1 C e; : : : ; xp C e/ f .x/ : e2Zd
jejD1
Here, the first term represents the random movement of a collection of p independent random walks accounting for particle diffusion, and the second term arises from the shift by the position of the catalyst. By application of the well-established Feynman–Kac formula and calculating the generator of the resulting semigroup, we obtain the operator representation p m Q px .t/ D et H 1 .x/;
x 2 Zpd :
(2)
Parabolic Anderson Model
73
This gives the connection between large time moment asymptotics and spectral analysis of the above Hamiltonian. Let us denote by p the supremum of the l 2 spectrum of H p . G¨artner and Heydenreich [5] have shown that, for all p 2 N and independently of x 2 Zd , lim .1=t/ loghu.t; x/p i D p :
t !1
This limit is called p-th Lyapunov exponent. It can be shown by similar methods that just as well lim .1=t/ log m Q px .t/ D p ; x 2 Zpd : t !1
However, this does not enable us to derive large time asymptotics up to equivalence. Assuming the existence of an eigenfunction .vp / corresponding to p with certain properties, we could on a heuristic level decompose the right hand side of (2) as m Q px .t/ D et p .1; vp /l 2 vp .x/ C o.et p /;
x 2 Zpd :
Our next main result contains criteria under which this is indeed possible. Theorem 5. Fix > 0, > 0, and let one of the following conditions be satisfied: (i) p D 1 or p D 2, large enough to ensure p > 0, (ii) p 2 N, > 4d .p C /. vp of H p Then, there exists a strictly positive and summable l 2 -eigenfunction pd 2 corresponding to p > 0. Assuming vp to be normed in l Z , the large time asymptotics of the p-th moment are given by m Q px .t/ e p t vp .x/ vp 1 ; where kk1 denotes the norm in l 1 Zpd .
t ! 1;
(3)
Remark 3. In the case p D 1, p is strictly positive if and only if 1= < GC .0/. In this case, the existence of a suitable eigenfunction has been known for quite a while, see e.g. [2] or [6]. Remark 4. For the cases p 2, the condition 1= < pGC .0/ is sufficient to have positive exponential growth (i.e., p > 0). The condition > 4d .p C / also implies exponential growth of the p-th moment.
2 Moving Trap This section is devoted to the case < 0. Our main proof tool is the Feynman–Kac representation of the solution u given by
74
A. Schnitzler and T. Wolff
u.t; x/ D
EX x
( Zt ) exp ıYt s .Xs / ds u0 .Xt /;
.t; x/ 2 Œ0; 1/ Zd :
0 Y Z EX z , Ez and Ez denote the expectation of a random walk with generator , and . C /, respectively. The subscript z indicates the starting point and the corresponding probability measures will be denoted by Pz . By
pt .z/ D P0X Xt = D z D PzX Xt = D 0 ; we denote the transition probability of a random walk with generator .
2.1 Localized Initial Condition In this section, we prove Theorems 1 and 2. With the help of the Feynman–Kac representation and a time reversal we find that, for all t 0 and z 2 Zd , Mz .t/ D
Y EX z E0
( Zt ) ( Zt ) Z exp ı0 .Xs Ys / ds D Ez exp ı0 .Zs / ds : 0
0
2.1.1 Dimensions 1 and 2 We start with the dimensions where the random walk is recurrent. Proof (Theorem 1). Using the semi-group representation of the resolvent . . C //1 , we find that C r .z/
Z1 WD
dt e
t
EZ z
( Zt ) exp ı0 .Zs / ds
0
1 D C
0
!
Z1 dt e
t
C
p.C/t .z/ r
.0/:
0
This implies, for all > 0, Z1 dt e 0
t
! Z1 1 t M0 .t/ D 1 dt e p.C/t .0/ : 0
Parabolic Anderson Model
75
Now, the claim for z D 0 follows by a standard Tauberian theorem. The case z ¤ 0 follows due to the recurrence of Z. t u
2.1.2 Dimensions 3 and Higher A Tauberian theorem is not applicable in transient dimensions because here the expected number of particles does not converge to zero. Proof (Theorem 2). Let v.z/ WD lim Mz .t/ D t !1
EZ z
( Z1 ) exp ı0 .Zs / ds ;
z 2 Zd :
0
Notice that the Green’s function GC is finite in transient dimensions and admits the following probabilistic representation. Z1 GC .z/ D
EZ z
ı0 .Zs / ds;
z 2 Zd :
0
That implies v.z/ 2 .0; 1/ for all z 2 Zd . Furthermore, we find that v is the unique solution to the following boundary problem (
. C /v.z/ C ı0 .z/v.z/ D 0; z 2 Zd ; limjzj!1 v.z/ D 1:
Hence, for all z 2 Zd , v.z/ D 1 C
G1 .z/: C G1 .0/ t u
2.2 Homogeneous Initial Condition In this section, we prove Theorems 3 and 4. For a homogeneous initial condition the Feynman–Kac representation yields, for all t 0 and x 2 Zd , mx .t/ D
X y2Zd
( Zt ) Y EX ı0 .Xs Ys / ds ı0 .Yt / : x Ey exp 0
76
A. Schnitzler and T. Wolff
2.2.1 Dimension 1 Let WD inf ft 0W Xt D Yt g D inf ft 0W Zt D 0g be the first hitting time of X and Y . The density of with respect to PzZ , z ¤ 0, will be denoted by f z . To prove Theorem 3, we split mx .t/ into two parts m ex .t/ WD
X
Y EX x Ey 1 >t ı0 .Yt /;
y2Zd
where X and Y have not met up to time t, and X
m bx .t/ WD
Y EX x Ey 1 t
( Zt ) exp ı0 .Xs Ys / ds ı0 .Yt / ;
y2Zd
0
where they have already met by time t. The next proposition shows that m bx is asymptotically negligible. Notice that this implies that there is no difference between the hard trap ( D 1) and the soft trap ( 2 .1; 0/) case because m ex does not depend on . Proposition 1. For all x 2 Z, lim m bx .t/ D 0:
t !1
Proof. We can assume without loss of generality that x D 0 since Z is recurrent. Let WD inf ft 0W Zt ¤ Z0 g be the the first jumping time of Z. Furthermore, for t 0 let ( Zt ) Z w .t/ WD E0 exp ı0 .Zs / ds ı0 .Zt / : 0
In a first step, we give an upper bound for the rate of decay of w. Let us abbreviate ˛ WD 2. C /. Using the strong Markov property of Z, we find (
" w .t/ D
t EZ 0 1 >t e
C EZ 0 1 t e
EZ Z
) # Zt s exp ı0 .Zu / du ı0 .Zt s / sD
0 . ˛/t
De
Zt C˛
. ˛/s
ds e
EZ 1 1 t
0
D 1 E .t/ C
(
"
˛ ˛
EZ 0
t sr Z
exp
)
#
ı0 .Zu / du ı0 .Zt sr / 0
rD
f 1 w .t/ :
Here, E denotes the distribution function of an exponentially distributed random variable with parameter ˛ and denotes the corresponding density. By iteration
Parabolic Anderson Model
77
we find that, for any k 1, w D .1 E/
k X nD0
˛ ˛
n
n
f 1n C
˛ ˛
.kC1/
.kC1/
f 1.kC1/ w:
Since there exists C1 > 0 such that f z .t/ C1 .1 C t/3=2 for all z ¤ 0 and t > 0, we see that asymptotically !
n 1 X ˛ n f 1n .t/ w .t/ .1 E/ ˛ nD0 t ! 1; .1 E.t// C1 .1 C t/3=2 D C2 .1 C t/3=2 ; where C2 is a positive constant. Let Z .1/ WD X Y and Z .2/ WD X C Y . Then it follows by H¨older’s inequality that X
m b0 .t/ D
( .1/ Z .2/ EZ y ; Ey 1 t
exp
Zt
z;y2Z
X
) .1/ .1/ .2/ ı0 Zs ds ız Zt ız Zt
0
( .1/ EZ y 1 t
exp
z;y2Z
3 2
.2/ 1=3 Z .2/ Ey ız Zt :
Zt
ı0 Zs.1/
)
.1/ ds ız Zt
!2=3
0
For t 0 let ( h .t/ WD
.1/ EZ 0
exp
3 2
Zt
) .1/ .1/ ı0 Zs ds ı0 Zt :
0
Obviously h admits the same asymptotic behaviour as w. Fix K > 0. The strong Markov property and the central limit theorem yield m b0 .t/
h .1/ h i X .1/ Z EZ E h.t s r/ 1 1
t
Q t s y z z;y2Z
X p z;yjKj t
i
2=3 .p2.C/t .y; z//1=3
rDQ sD
.1/ h .1/ h i Z EZ E h .t s r/ 1 1
t
Q t s y z
i
2=3
rDQ sD
1=3 t !1 p2.C/t .y; z/ CK 2 t 1=6 ! 0: Here, C is a positive constant. This proves the claim .
t u
78
A. Schnitzler and T. Wolff
Now we show what m ex asymptotically looks like. Recall that a D =. Proposition 2. For all x 2 Z, 1 lim m ex .t/ D 1 t !1
q
Z1 ds 0
2
as .1 C a/.1 s/s C 1Ca : 1 Cs as 2 1 C .1Ca/ 2
Proof. Because of the strong Markov property of X and Y , we find m ex .t/ D
X y2Z
D 1
Y EX x Ey ı0 .Yt /
X
X
Y EX x Ey 1 t ı0 .Yt /
y2Z Y X Y EX x Ey 1 t ŒEY EY ı0 .Yt s /sD
y2Z
D 1
X
Y EX x Ey 1 t p.t / .Y /:
y2Z
It follows by Donsker’s invariance principle that
lim
t !1
X
Z1 Y EX x Ey 1 t p.t / .Y /
y2Z
D
.1/
.2/
dy EW EW 1 .W / 1 p 0 0 y
1
.G/ .W /
.1 y
/
.2/ W .W / :
y
Here W .1/ and W .2/ denote two independent Brownian motions that start in the origin with variance 2 and 2, respectively. Their expectations are denoted by .1/ .2/ .W / .1/ .2/ and EW , respectively. Moreover, y WD infft > 0W Wt Wt D yg EW 0 0 .G/ and ps denotes a Gaussian density with variance 2s. Indeed, the application of Donsker’s invariance principle is not trivial because we have to sum over all x 2 Z, where it cannot be applied uniformly. ./ Let W ./ WD W .1/ W .2/ , W .C/ WD W .1/ C W .2/ and y WD infft 0W Wt
./
D yg. Notice that W ./ and W .C/ are independent. It follows that Z1
.1/
.2/
dy EW EW 1 .W / 1 p 0 0 y
1
Z1 D
dy
.G/ .W / 1 y
./ W .C/ EW Ey 1 ./ 1 0 y
1
Z1 D
dy EW 0 1
./
1 ./ 1 p y
.2/ W .W /
y
.G/ p ./ 1 y
.G/ 2 ./ ./ y 1 y C 2 .C/
.C/ W C y./
.y/
Parabolic Anderson Model
79
n o y2 2 exp Z1 Z1 jyj exp y 22 s 2.1s/C 2.C/s .C/2 D dy ds p r h i s 2. C /s 22 s 2 2.1 s/ C .C/ 1 0 2 1 D
q
Z1 ds
. C /.1 s/s C 2 s 2 C s C
0
2 s 2 .C/
2 s 2 .C/2
: t u
Now the claim follows by substituting a. Theorem 3 follows immediately from Propositions 1 and 2.
2.2.2 Dimensions 2 and Higher In dimensions 2 and higher, we find that asymptotically the expected mass remains constant because a Brownian motion is point recurrent only in dimension 1. .Z/
Proof (Theorem 4). Let " WD inf ft 0W Zt 2 B" .0/g be the first time that the process Z hits the centered ball B" .0/ with radius " > 0, and let mx .t/ WD
X
Y EX ı .Yt /: x Ey 1 .Z/ p >t 0 "
y2Zd
t
Similarly as in the case d D 1 we find with the help of Donsker’s invariance principle that
Z 1 : lim 1 m0 .t/ D lim dx PxW ".W / t !1 "!0 2 Rd
However, for d 2 and x ¤ 0, lim
"!0
PxW
1 D PxW
".W / 2
\ ">0
".W /
1 2
! D PxW
1 .W / D 0:
0C 2
Hence, it follows by monotone convergence that limt !1 m0 .t/ D 1 which implies that limt !1 mx .t/ D 1 for all x 2 Zd . t u
3 Moving Catalyst In this section, we stick to the homogeneous initial condition u0 1 and examine the case of a randomly moving catalyst, i.e., we consider > 0.
80
A. Schnitzler and T. Wolff
3.1 Spectral Properties of Higher-Order Anderson Hamiltonians Throughout this section, we write p WD sup .H p / for all p 2 N. Considering the first Hamilton operator H 1 given by H 1 WD . C / C ı0 ; the existence of an eigenfunction v1 2 l 2 Zd corresponding to its largest spectral value, provided that this value is greater than zero, has been widely known for some time. The following theorem extends this to the case p D 2 and constitutes the main statement of this section: Theorem 6. Assume 2 > 0. Then, 2 is isolated in the point spectrum of H 2 with one-dimensional eigenspace. The corresponding eigenfunction may be chosen strictly positive. For a start, we restrict the operator to the subspace of component-wise symmetric functions ˚ S2 WD f 2 l 2 Z2d jf .x; y/ D f .y; x/
8x; y 2 Z2d ;
which is obviously closed in l 2 Z2d . Recall the definition of the operators A 2 and V 2 from Sect. 1 and define AQ2 and VQ 2 as their restrictions on the set S2 above. In the same manner, we denote by HQ 2 the restricted second-order Hamilton operator. The reader may easily retrace these operators are endomorphisms on S2 . In particular, HQ 2 is a self-adjoint operator on the Hilbert space S2 , and it is essential that the supremum of its spectrum coincides with 2 , which can be shown elementarily. Each eigenfunction of HQ 2 corresponding to 2 is an eigenfunction of H 2 as well. Moreover, we expect that an eigenfunction of H 2 is, or at least could be chosen as, an element of S2 . In view of that, passing over to S2 is just a natural approach. In the next step, we write AQ2 C VQ 2 rather than HQ 2 in order to emphasize the dependence on the potential parameter , and we establish a further translation of the main task: Lemma 1. Suppose > 0. Then, the resolvent operator RQ WD . AQ2 /1 exists on S2 , and for all > 0, we have (i)
(ii)
2 AQ2 C VQ 2
”
1 2 RQ VQ 2 ;
D sup AQ2 C VQ 2
H)
1 D sup RQ VQ 2 :
Moreover, for v 2 S2 and > 0, (iii)
AQ2 C VQ 2 v D v
”
1 RQ VQ 2 v D v:
Parabolic Anderson Model
81
2 Proof. A Fourier transform reveals that the spectrum 2d of A is concentrated on the 2 1 2 for all > 0. In particular, negative half-axis, thus . A / exists on l Z 2 2 1 Q it exists on S , and then it coincides with . A / as AQ2 is an endomorphism on S2 . Assertions (i) and (iii) follow by rearranging the equations considered and applying the resolvent operator. The second relation is shown using the RayleighRitz formula. t u d 2 As a next step, we introduce an operator TQ on l Z having the same spectrum and the same point spectrum as RQ VQ 2 and that admits the decomposition TQ D TQ .1/ C TQ .2/ . Here, TQ .1/ is compact and the supremum of .TQ .2/ / is strictly smaller than the supremum of .TQ /. Then, we use Weyl’s theorem to obtain that the largest value in .TQ / belongs to the point spectrum p .TQ /. The resolvent R WD 1 A2 admits the representation
.R f / .x1 ; x2 / D
X
.2/
r .y1 x1 ; y2 x2 /f .y1 ; y2 /;
x1 ; x2 2 Zd ;
y1 ;y2 2Zd .2/
where the resolvent kernel r W Z2d ! .0; 1/ is defined as Z 1 .2/ r .x1 ; x2 / WD dt e t P0 .Zt D .x1 ; x2 // ; x1 ; x2 2 Zd : 0
Here, Z is a random walk on Z2d with generator A 2 . Then, we obtain
R V 2 f .x1 ; x2 / D
X
.2/
r .y1 x1 ; y2 x2 / Œı0 .y1 / C ı0 .y2 / f .y1 ; y2 /:
y1 ;y2 2Zd
(4) If we assume f 2 S2 , we get i X h .2/ .2/ RQ VQ 2 f .x1 ; x2 / D r .y x1 ; x2 / C r .x1 ; y x2 / f .y; 0/; y2Zd
for x1 ; x2 2 Zd , and in particular i X h .2/ .2/ r .y x; 0/ C r .x; y/ f .y; 0/; RQ VQ 2 f .x; 0/ D y2Zd
for x 2 Zd . Let us therefore introduce the operator TQ D TQ .1/ C TQ .2/ on l 2 Zd with X .2/ X .2/ TQ .1/ fQ.x/ WD r .x; y/fQ.y/; TQ .2/ fQ.x/ WD r .yx; 0/fQ.y/; x 2 Zd : y2Zd
y2Zd
82
A. Schnitzler and T. Wolff
Both operators are apparently self-adjoint. The lemma below identifies the spectra and point spectra of TQ and RQ VQ 2 : Lemma 2. For all > 0, TQ D RQ VQ 2 ;
p TQ D p RQ VQ 2 :
Proof. The crucial and least intuitive part is to show that TQ surjective ) RQ VQ 2 surjective.
(5)
All other implications are rather straightforward and we omit them for the sake of 2 Q WD g conciseness. Assume TQ is surjective dand choose g 2 S . Define g.x/ d 2 .x; 0/ for x 2 Z . There exists fQ 2 l Z with TQ fQ D gQ by assumption. We define f .x1 ; x2 / WD f .x1 /ı0 .x2 / C f .x2 /ı0 .x1 / ı0 .x1 /ı0 .x2 /f .0/;
x1 ; x2 2 Zd
and then, for x1 ; x2 2 Zd , ( F .x1 ; x2 / WD
x1 D 0 or x2 D 0I f .x1 ; x2 /; 1 Q Q 2 R V f .x1 ; x2 / C g.x1 ; x2 / ; else.
We realize that F 2 S2 and proceed by showing that F is the desired function satisfying RQ VQ 2 F D g. Note that RQ VQ 2 F .x1 ; x2 / D RQ VQ 2 f .x1 ; x2 / for all x1 ; x2 2 Zd . In the first place, we have RQ VQ 2 F .x1 ; 0/ D
X h
i .2/ .2/ r .y x1 ; 0/ C r .x1 ; y/ f .y; 0/
y2Zd
D TQ fQ.x1 / D fQ.x1 / g.x Q 1/ D F .x1 ; 0/ g.x1 ; 0/;
x1 2 Zd ;
(6)
and by symmetry RQ VQ 2 F .0; x2 / D F .0; x2 / g.0; x2 / for x2 2 Zd . Moreover, F .x1 ; x2 / RQ VQ 2 F .x1 ; x2 / D RQ VQ 2 f .x1 ; x2 / C g.x1 ; x2 / RQ VQ 2 f .x1 ; x2 / D
g.x1 ; x2 /;
x1 ; x2 2 Zd ; x1 ; x2 ¤ 0:
(7)
Equations (6) and (7) yield the desired result . RQ VQ 2 /F D g. Thus, we have shown (5). t u
Parabolic Anderson Model
83
In the next step, we are able to calculate the supremum of the spectrum of TQ .2/ . Its value is given in terms of the Laplace resolvent kernel r defined by Z 1 r .x/ WD dt e t P0 .Xt D x/ ; x 2 Zd ; (8) 0
with X a random walk on Z with generator . d
C Lemma 3. We have sup .TQ .2/ / D kTQ .2/ k2 D r .0/.
Proof. It will be sufficient to show that ˚
C sup j j W 2 .TQ .2/ / D r .0/:
(9)
The proof involves a Fourier transform (which we denote by F ) of the operator TQ .2/ . For fO 2 L2 Œ; /d , the transformed operator reads TO .2/ fO.l/ D .2/d
X x2Zd
D .2/d
X y2Zd
X
ei.l;x/
Z
dk ei.k;y/ fO.k/
.2/
r .y x; 0/
y2Zd
Z
.Œ;/d /
dk ei.k;y/ fO.k/
ei.l;y/ .Œ;/d / 0
1
X .2/ D F F 1 fO .l/ @ ei.l;z/ r .z; 0/A ;
X
.2/
ei.l;xy/ r .x y; 0/
y2Zd
l 2 Œ; /d :
z2Zd
Thus, TO .2/ is a multiplication operator and the multiplier X .2/ rO .l/ WD ei.l;z/ r .z; 0/; l 2 Œ; /d z2Zd
is obviously continuous. Hence, its spectrum is just the closure of the range of that multiplier. As each of the two components of a random walk on Z2d with generator A 2 is just a random walk on Zd with generator . C /, we have X .2/ C sup jOr .l/j D rO .0/ D r .z; 0/ D r .0/; l2Œ;/d
z2Zd
and equation (9) follows by taking into account that the Fourier transform is an isometry. t u 2 .1/ .2/ Lemma 4. Suppose 2 D sup H . Then, the operator TQ 2 D TQ C TQ has a strictly positive eigenfunction vQ corresponding to its largest spectral value 1= . This value is isolated in the spectrum.
84
A. Schnitzler and T. Wolff
Proof. At first, we realize that TQ .1/ belongs to the trace class as X
TQ .1/ ıx ; ıx <
Z
1
dt e 2 t < 1;
0
x2Zd
and therefore TQ .1/ is compact. Then, we explain why sup .TQ .1/ C TQ .2/ / > sup .TQ .2/ /, which together with Weyl’s theorem (see e.g., [20]) yields the existence of an eigenfunction. In the end, it remains to show that we may choose this eigenfunction strictly positive. In order to show that sup .TQ .1/ C TQ .2/ / > sup .TQ .2/ /, we recall that 1 sup TQ 2 D sup RQ 2 VQ 2 D by Lemmas 1 and 2, and the supremum of .TQ .2/ / is equal to r 2 .0/ by Lemma 3. Therefore, it suffices to show that C
1 C > r 2 .0/:
(10)
Let 1 WD sup H 1 . In case 1 > 0, it is well-known that 1 C D r 1 .0/; compare, e.g., Carmona and Molchanov [2]. Moreover, as 1 and 2 are the exponential growth rates of the first and second moment of uQ .t; x/, H¨older’s inequality yields 1 C
thus a fortiori 1 < 2 . As 7! r
1 2 ; 2
.0/ is strictly decreasing (see e.g., (8)),
1 C C D r 1 .0/ > r 2 .0/ and we have shown (10) for the case 1 > 0. In case 1 D 0, we have 1 GC .0/; C
and we arrive at (10) as GC .0/ > r .0/ for all > 0. Weyl’s theorem now states that 1= belongs to the discrete spectrum of TQ 2 since TQ .1/ is compact. Consequently, the value 1= is isolated in the point spectrum. Finally, we show that a corresponding eigenfunction vQ may be chosen strictly positive. It suffices to show that TQ 2 is positive in the sense that it maps nonnegative, non-zero functions
Parabolic Anderson Model
85
to positive functions. Choose a nonnegative function f arbitrarily and assume f .y1 / > 0 for some y1 2 Zd . Then, for all x 2 Zd , h i .2/ .2/ TQ 2 f .x/ r 2 .y1 x; 0/ C r 2 .x; y1 / f .y1 / > 0: Consequently, we may choose vQ strictly positive, and the proof is complete.
t u
Let us now prove the main result of this section: Proof (Theorem 6). Let 2 D sup H 2 . The preceding lemma states that there exists a strictly positive function vQ 2 l 2 Zd with T 2 vQ D .1= /Qv. By Lemma 2, there exists v2 2 S2 with RQ 2 VQ 2 v2 D .1= /v2 , as point spectra of both operators coincide. Naturally, v2 is also an eigenfunction of R 2 V p on l 2 Z2d . We easily verify that R 2 V p f > 0 for all nonnegative, non-zero f 2 l 2 Z2d , thus v2 may be chosen strictly positive. Now Lemma 1 yields that v2 is an eigenfunction of HQ 2 and H 2 corresponding to 2 . In order to show that its corresponding eigenspace is one-dimensional, let .wi /i 2I represent an orthonormal basis of this eigenspace. The wi are principal eigenfunctions of R 2 V p that maps nonnegative, non-zero functions to positive functions. Hence we may choose all wi strictly positive. As two strictly positive functions in l 2 Zpd cannot be orthogonal, it follows that jI j D 1, i.e., the eigenspace corresponding to 2 is one-dimensional. t u We will additionally need that the largest eigenvalue 2 is isolated in the spectrum of HQ 2 in order to describe the asymptotic moment behaviour: Lemma 5. The value 2 is isolated in .HQ 2 /. Proof. We know by Lemma 4 that 1 D sup .TQ 2 / is an isolated eigenvalue, so there exists ıQ > 0 with h i
˚ Q 1 C ıQ \ TQ D 1 : 1 ı; 2
Define now ı1 small enough to ensure Q for all " with 0 < " ı1 : TQ " TQ < ı=2 2 2 2 It is quickly verified that this is always possible (e.g., by the mean value theorem). We can show with a similar argument that sup .TQ / depends continuously on , making it possible to find ı2 small enough to satisfy Q for all " with 0 < " ı2 : sup TQ 2 " sup TQ 2 ı=2 If we choose now " < ı1 ^ ı2 , it follows i h Q Q 1 ¤ sup TQ 2 " 2 1 ı=2; 1 C ı=2 ;
86
A. Schnitzler and T. Wolff
Q Q and by Theorem 8 below, the interval Œ 1 ı=2; 1 C ı=2 contains exactly one Q Q Q Q element of the spectrum of T 2 C .T 2 " T 2 / D T 2 " . Therefore, 1 2 .TQ 2 " / and it follows that 2 " 2 .HQ 2 / in the usual way by Lemmas 1 and 2. Thus, 2 is isolated in .HQ 2 /. t u Let us in the following present a sufficient condition for the existence of an eigenfunction with the desired properties that holds for general p 2 N: Theorem 7. Suppose p 2 N and > 4d .p C /. Then, p D sup .H p / is positive, isolated in the spectrum and belongs to the point spectrum with onedimensional eigenspace. The corresponding eigenfunction may be chosen strictly positive. The proof relies on the following theorem from perturbation theory of bounded operators. It describes the behaviour of an isolated eigenvalue under a bounded perturbation that is sufficiently small in a certain sense, see Birman and Solomjak [1], Chap. 9.4 for a proof. Theorem 8. Let T; S denote two self-adjoint operators on a Hilbert space. Suppose 2 p .T / with multiplicity r and Œ "; C " \ .T / D f g ; for some " > 0. Moreover, assume .S / Œı1 ; ı2 for some ı1 < ı2 2 R with ı2 ı1 < ". Then, the set Œ C ı1 ; C ı2 \ .T C S / ; contains only isolated eigenvalues of T C S whose sum of multiplicities equals r. Proof (Theorem 7). We have H p D A p C V p , and the idea is to understand the generator A p as a perturbation of the potential V p . With increasing , the perturbation A p remains relatively small, which allows an application of Lemma 8. As V p is a multiplication, its spectrum coincides with the essential range of the multiplier and we easily verify that p is the largest eigenvalue of V p and has one-dimensional eigenspace. Moreover, .V p / \ Œp ; p C D fpg ; and we may show by a Fourier transform that .A p / Œ4d .p C / ; 0 : Theorem 8 now yields that the set .H p / \ Œp ; p
Parabolic Anderson Model
87
contains exactly one element, which is an eigenvalue with multiplicity one. This element must be p D sup .H p / due to the nonpositive definiteness of A p . It remains to show that the corresponding eigenfunction may be chosen strictly p positive. To that purpose, we consider that vp is also an eigenfunction of eH corresponding to its largest eigenvalue e p . Employing the Feynman–Kac representation of this operator, we see that it maps nonnegative, non-zero functions to strictly positive functions. This means that all principal eigenfunctions are either strictly positive or strictly negative. t u
3.2 Application to Annealed Higher Moment Asymptotics A natural approach to more exact asymptotics of mixed moments, and the main idea proving Theorem 5, is to decompose the semigroup representation p m Q px .t/ D et H 1 .x/: Certainly we must consider the initial condition 1 as ˚an appropriate limit of
l 2 -functions when attempting a rigorous proof. With E j 2 R , the family of spectral projectors associated with H p , the spectral theorem for self-adjoint operators yields m Q px .t/ D e p t 1; vp vp .x/ C
Z
p " 1
e t dE .1/ .x/;
(11)
for some " > 0 small enough. Here, p D sup .H p / must be a positive eigenvalue with multiplicity one that is isolated in .H p /, and vp is a strictly 2 positive l -normed eigenfunction corresponding to p . Beyond that, we need and that 1; vp < 1. If these requirements are met, we may asymptotically neglect the last term in (11). In order to prove Theorem 5, we need the following two auxiliary lemmas that are of pure technical nature and thus given without a proof. The first one enables us to approximate the homogeneous initial condition with l 2 -functions. p Let Qt WD Zpd \ Œt; tpd for t > 0. Lemma 6. For all x 2 Zpd , p Q px .t/ ; et H 1Qp .x/ m t2
t ! 1:
The second auxiliary lemma ensures that the considered principal eigenfunctions are summable: p Lemma 7. Suppose p D sup .H /1 > pd0 and there exists a corresponding 2 pd eigenfunction vp 2 l Z . Then, vp 2 l Z .
Let us now give a concise proof of the main statement:
88
A. Schnitzler and T. Wolff
Proof (Theorem 5). It suffices to show that, for all x 2 Zpd , Q px .t/ ! vp 1 vp .x/ e p t m
(12)
as t approaches infinity. The spectral representation of et H yields p
e
t p Ct H p
1
p Q2 t
Z p D 1 Q ; vp vp C t2
p " 1
et . p / dE 1Qp ; t2
for some " > 0 as p is isolated in the spectrum. For t large enough, the l 2 -norm of the integral is roughly estimated from above by Z p " pd et t p dE 1Qp et " 1Qp 2t 2 2 et " ; 1 t2 t2 2 2
which means we may neglect this term and have l2 p et p Ct H 1Qp ! vp 1 vp ; t2
t ! 1:
(13)
The limit (12) now follows by equation (13), Lemma 6 and the triangle inequality. This completes the proof. t u Acknowledgement The results of this paper have been derived in two theses under the supervision of J¨urgen G¨artner whom we would like to thank for his invaluable support.
References 1. Birman, M.S., Solomjak, M.Z.: Spectral Theory of Selfadjoint Operators in Hilbert Space, Reidel, Dordrecht (1980) 2. Carmona, C., Molchanov, S.A.: Parabolic Anderson problem and intermittency. Mem. Amer. Math. Soc. 108(3), (1994) 3. Castell, F., G¨un, O., Maillard, G.: Parabolic Anderson model with a finite number of moving catalysts. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U. (eds.) Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11. Springer, Heidelberg (2012) 4. Drewitz, A., G¨artner, J., Ram´ırez, A., Sun, R.: Survival probability of a random walk among a Poisson system of moving traps. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U. (eds.) Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11. Springer, Heidelberg (2012) 5. G¨artner, J., Heydenreich, M.: Annealed asymptotics for the parabolic Anderson model with a moving catalyst. Stoch. Process. Appl. 116(11), 1511–1529 (2006) 6. G¨artner, J., den Hollander, F.: Intermittency in a catalytic random medium. Ann. Probab. 34(6), 2219–2287 (2006) 7. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts: Symmetric exclusion. Elec. J. Prob. 12, 516–573 (2007)
Parabolic Anderson Model
89
8. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts: three-dimensional simple symmetric exclusion. Elec. J. Prob. 14, 2091–2129 (2009) 9. G¨artner, J., den Hollander F., Maillard, G.: Intermittency on catalysts. In: Blath, J., M¨orters, P., Scheutzow, M. (eds.) Trends in Stochastic Analysis, London Mathematical Society Lecture Note Series 353. pp. 235–248. Cambridge University Press, Cambridge (2009) 10. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts: voter model. Ann. Probab. 38(5), 2066–2102 (2010) 11. G¨artner, J., den Hollander, F., Maillard, G.: Quenched Lyapunov exponent for the parabolic Anderson model in a dynamic random environment. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U. (eds.) Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11. Springer, Heidelberg (2012) 12. G¨artner, J., K¨onig, W.: The parabolic Anderson model. In: Deuschel, J.-D., Greven, A. (eds.) Interacting Stochastic Systems. pp. 153–179. Springer (2005) 13. G¨artner, J., Molchanov, S.A.: Parabolic problems for the Anderson model: I. Intermittency and related topics. Commun. Math. Phys. 132(3), 613–655 (1990) 14. Kesten, H., Sidoravicius, V.: Branching random walk with catalysts. Elec. J. Prob. 8, 1–51 (2003) 15. K¨onig, W., Schmidt, S.: The parabolic Anderson model with acceleration and deceleration. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U. (eds.) Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11. Springer, Heidelberg (2012) 16. Lacoin, H., M¨orters, P.: A scaling limit theorem for the parabolic Anderson model with exponential potential. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U. (eds.) Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11. Springer, Heidelberg (2012) 17. Maillard, G., Mountford, T., Sch¨opfer, S.: Parabolic Anderson model with voter catalysts: Dichotomy in the behavior of Lyapunov exponents. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U. (eds.) Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11. Springer, Heidelberg (2012) 18. Molchanov, S.A.: Lectures on random media, Lecture Notes in Math. 1581, 242–411 (1994) 19. Molchanov, S., Zhang, H.: Parabolic Anderson model with the long range basic Hamiltonian and Weibull type random potential. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U. (eds.) Probability in Complex Physical Systems, Springer Proceedings in Mathematics, Vol. 11. Springer, Heidelberg (2012) 20. Reed, M., Simon, B.: Methods of Modern Mathematical Physics. I. Functional Analysis. Academic Press, New York (1972)
Parabolic Anderson Model with a Finite Number of Moving Catalysts Fabienne Castell, Onur Gun, ¨ and Gr´egory Maillard
Abstract We consider the parabolic Anderson model (PAM) which is given by the equation @u=@t D u C u with uW Zd Œ0; 1/ ! R, where 2 Œ0; 1/ is the diffusion constant, is the discrete Laplacian, and W Zd Œ0; 1/ ! R is a space– time random environment. The solution of this equation describes the evolution of a “reactant” u under the influence of a “catalyst” . In the present paper, we focus on the case where is a system of n independent simple random walks each with step rate 2d and starting from the origin. We study the annealed Lyapunov exponents, i.e., the exponential growth rates of the successive moments of u w.r.t. and show that these exponents, as a function of the diffusion constant and the rate constant , behave differently depending on the dimension d . In particular, we give a description of the intermittent behavior of the system in terms of the annealed Lyapunov exponents, depicting how the total mass of u concentrates as t ! 1. Our results are both a generalization and an extension of the work of G¨artner and Heydenreich [3], where only the case n D 1 was investigated.
F. Castell () CMI-LATP, Universit´e de Provence, 39 rue F. Joliot-Curie, 13453 Marseille Cedex 13, France e-mail:
[email protected] O. G¨un CMI-LATP, Universit´e de Provence, 39 rue F. Joliot-Curie, 13453 Marseille Cedex 13, France e-mail:
[email protected] G. Maillard CMI-LATP, Universit´e de Provence, 39 rue F. Joliot-Curie, 13453 Marseille Cedex 13, France EURANDOM, P.O. Box 513, 5600 MB Eindhoven, The Netherlands e-mail:
[email protected] J.-D. Deuschel et al. (eds.), Probability in Complex Physical Systems, Springer Proceedings in Mathematics 11, DOI 10.1007/978-3-642-23811-6 5, © Springer-Verlag Berlin Heidelberg 2012
91
92
F. Castell et al.
1 Introduction 1.1 Model The parabolic Anderson model (PAM) is the partial differential equation 8 < @ u.x; t/ D u.x; t/ C .x; t/u.x; t/; @t : u.x; 0/ D 1;
x 2 Zd ; t 0:
(1)
Here, the u-field is R-valued, 2 Œ0; 1/ is the diffusion constant, is the discrete Laplacian acting on u as u.x; t/ D
X
Œu.y; t/ u.x; t/;
y2Zd yx
(y x meaning that y is nearest neighbor of x), and D .t /t 0
with
t D f.x; t/W x 2 Zd g;
is an R-valued random field that evolves with time and that drives the equation. One interpretation of (1) comes from population dynamics by considering a system of two types of particles A and B. A-particles represent “catalysts,” B-particles represent “reactants” and the dynamics is subject to the following rules: • A-particles evolve independently of B-particles according to a prescribed dynamics with .x; t/ denoting the number of A-particles at site x at time t; • B-particles perform independent simple random walks at rate 2d and split into two at a rate that is equal to the number of A-particles present at the same location; • The initial configuration of B-particles is that there is exactly one particle at each lattice site. Then, under the above rules, u.x; t/ represents the average number of B-particles at site x at time t conditioned on the evolution of the A-particles. It is possible to add that B-particles die at rate ı 2 Œ0; 1/. This leads to the trivial transformation u.x; t/ ! u.x; t/e ıt . We will hereafter assume that ı D 0. It is also possible to add a coupling constant 2 .0; 1/ in front of the -term in (1), but this can be reduced to D 1 by a scaling argument. In what follows, we focus on the case where .x; t/ D
n X kD1
ıx Yk .t/ ;
(2)
Parabolic Anderson Model with a Finite Number of Moving Catalysts
93
with fYk W 1 k ng a family of n independent simple random walks, where for each k 2 f1; : : : ; ng, Yk D .Yk .t//t 0 is a simple random walk with step to denote respectively rate 2d starting from the origin. We write P0˝n and E˝n 0 the law and the expectation of the family of n independent simple random walks fYk W 1 k ng where initially all of the walkers are located at 0. The rest of the section is organized as follows. In Sect. 1.2, we define the annealed Lyapunov exponents and introduce the intermittency phenomenon. In Sect. 1.3, we review some related models from the literature. In Sect. 1.4, we state our main results, and finally, in Sect. 1.5, we give some further comments and add few results and conjectures.
1.2 Lyapunov Exponents and Intermittency Our focus will be on the annealed Lyapunov exponents that describe the exponential growth rate of the successive moments of the solution of (1). By the Feynman–Kac formula, the solution of (1) reads 0
2
u.x; t/ D Ex @exp 4
Zt
31 .X .s/; t s/ ds 5A ;
(3)
0
where X D .X .t//t 0 is the simple random walk on Zd with step rate 2d and Ex denotes expectation with respect to X given X .0/ D x. The connection between the parabolic Anderson equation (1) with random time-independent potential and the Feyman–Kac functional (3) is well understood (see e.g. G¨artner and Molchanov [10]) and can be easily extended to the time-dependent potential setting. Taking into account our choice of catalytic medium in (2) we define p .t/ as p .t/ D
1 p 1=p log E˝n 0 Œu.x; t/ t
" p n Zt #! XX ˝n 1 ˝p log E 0 ˝ Ex exp D ı0 Xj .s/ Yk .t s/ ds ; pt j D1 kD1 0
(4) ˝p
where fXj W 1 j pg is a family of p independent copies of X and Ex for the expectation of this family with Xj .0/ D x for all j . If the last quantity admits a limit as t ! 1, we define p WD lim p .t/; t !1
stands
(5)
94
F. Castell et al.
to be the p-th (annealed) Lyapunov exponent of the solution u of the PAM (1). We will see in Theorem 1.1 that the limit in (5) exists and is independent of x. Hence, we suppress x in the notation. However, p is clearly a function of n, d , and . In what follows, our main focus will be to analyze the dependence of p on .n/ the parameters n, p, and , therefore we will often write p .; /. In particular, our main subject of interest will be to draw the qualitative picture of intermittency for these systems. First, note that by the moment inequality we have .n/
.n/ p p1 ;
(6)
for all p 2 N n f1g. The system (or the solution of the system) (1) is said to be p-intermittent if the above inequality is strict, namely, .n/
.n/ p > p1 :
(7)
The system is fully intermittent if (7) holds for all p 2 N n f1g. We will sometimes say that the system is partially intermittent if it is p-intermittent for some p 2 N n f1g. Also note that, using H¨older’s inequality, p-intermittency implies q-intermittency for all q p (see e.g. [3], Lemma 3.1). Thus, for any fixed n 2 N, p-intermittency in fact implies that .n/
.n/ q > q1
8q p ;
and 2-intermittency means full intermittency. Geometrically, intermittency corresponds to the solution being asymptotically concentrated on a thin set, which is expected to consist of “islands” located far from each other (see [9], Sect. 1 and references therein for more details). Here, due to the lack of ergodicity, such a geometric picture of intermittency is not available. Nevertheless, (7) can still be interpreted as the p-th moment of u being generated by some exponentially rare event (see [3], Sect. 1.2 for a more detailed analysis).
1.3 Literature The behavior of the annealed Lyapunov exponents and particularly the problem of intermittency for the PAM in a space–time random environment was subject to various studies. Carmona and Molchanov [2] obtained an essentially complete qualitative description of the annealed Lyapunov exponents and intermittency when is white noise, i.e., .x; t/ D
@ W .x; t/ ; @t
Parabolic Anderson Model with a Finite Number of Moving Catalysts
95
where W D .Wt /t 0 with Wt D fW .x; t/W x 2 Zd g is a field of independent Brownian motions. In particular, it was shown that 1 D 1=2 for all d 1 and, p > 1=2 for p 2 N n f1g in d D 1; 2. It is also proved that for d 3, there exist 0 < 2 3 : : : satisfying 1 p ./ 2
(
> 0; for 2 0; p ; D 0; for 2 p ; 1 ;
p 2 N n f1g :
Further refinements on the behavior of the Lyapunov exponents were obtained in Greven and den Hollander [11]. Upper and lower bounds on p were derived, and the asymptotics of p as p ! 1 was computed. In addition, it was proved that the p ’s are distinct for d large enough. More recently various models where is non-Gaussian were investigated. Kesten and Sidoravicius [13] and G¨artner and den Hollander [4] considered the case where is given by a Poisson field of independent simple random walks. In [13], the survival versus extinction of the system is studied. In [4], the moment asymptotics were studied and a partial picture of intermittency, depending on the parameters d and , was obtained. The case where is a single random walk – corresponding to n D 1 case in our setting – was studied by G¨artner and Heydenreich [3]. Analogous results to those contained in Theorems 1.1, 1.2 and Corollary 1.1(i) were obtained. The investigation of annealed Lyapunov behavior and intermittency was extented to non-Gaussian and space correlated potentials in G¨artner, den Hollander and Maillard, in [5] and [7], for the case where is an exclusion process with symmetric random walk transition kernel, starting form a Bernoulli product measure. Later G¨artner, den Hollander and Maillard [8], and Maillard, Mountford and Sch¨opfer [14], studied the case where is a voter model starting either from Bernoulli product measure or from equilibrium (see G¨artner, den Hollander and Maillard [6], for an overview).
1.4 Main Results Our first theorem states that the Lyapunov exponents exist and behave nicely as a function of and . It will be proved in Sect. 2. Theorem 1.1 (Existence and first properties). Let d 1 and n; p 2 N. (i) For all ; 2 Œ0; 1/, the limit in (5) exists, is finite, and is independent of x if .; / ¤ .0; 0/. .n/ (ii) On Œ0; 1/2 , .; / 7! p .; / is continuous, convex and non-increasing in both and .
96
F. Castell et al.
Let Gd .x/ be the Green function at lattice site x of simple random walk stepping at rate 2d and
./ D sup Sp. C ı0 /; (8) be the supremum of the spectrum of the operator Cı0 in l 2 .Zd /. It is well-known that (see, e.g., [4], Lemma 1.3) Sp. C ı0 / D Œ4d ; 0 [ f ./g with D 0; if Gd .0/; (9)
./ > 0; if < Gd .0/: Furthermore, 7! ./ is continuous, non-increasing and convex on Œ0; 1/, and strictly decreasing on Œ0; Gd .0/. .n/ The next theorem gives the limiting behavior of p as # 0 and ! 1, and .n/ .n/ describes a region of where p D 0. Note that by symmetry, p .; / D n .p/ .; /, for all n; p 2 N and ; 2 Œ0; 1/. Therefore, the -dependence p n described below can be transcribed in terms of -dependence. Theorem 1.2 (- -dependence). Let n; p 2 N and 2 Œ0; 1/. .n/
.n/
(i) For all d 1, lim#0 p .; / D p .0; / D n .=p/. .n/ .n/ (ii) If 1 d 2, then p .; / > 0 for all 2 Œ0; 1/. Moreover, 7! p .; / .n/ is strictly decreasing with lim!1 p .; / D 0 (see Fig. 1). .n/ (iii) If d 3, then p .; / D 0 for all 2 ŒnGd .0/; 1/ (see Fig. 2). .n/
Our next result describes the limiting behavior of p as p ! 1 and n ! 1. Theorem 1.3 (n- p-dependence). Let d 1 and ; 2 Œ0; 1/. .n/
(i) For all n 2 N, limp!1 p .; / D n .=n/ (see Fig. 1–2); .n/ (ii) For all p > =Gd .0/, limn!1 p .; / D C1; .n/
(iii) For all p =Gd .0/ and n 2 N, p .; / D 0. (n)
l p (k, r)
p=∞
1 ≤d≤2
p=3 p=2
Fig. 1 For 1 d 2, the system is partially intermittent. Full intermittency is conjectured, and proved for n D 1; 2
p=1
0
k
Parabolic Anderson Model with a Finite Number of Moving Catalysts Fig. 2 For d 3 and < Gd .0/, the system is partially intermittent on A [ B and not intermittent on C . Full intermittency on A is conjectured, and proved for n D 1; 2
97
(n)
l p (k, r) d ≥ 3, r < Gd (0)
p=∞
p=3 p=2 p=1 0
k1(n) k2(n) k3(n)
B
A
k
nGd (0)
C
.n/
By part (ii) of Theorem 1.1, p .; / is non-increasing in . Hence, we can ˚ .n/ define p ./W p 2 N as the non-decreasing sequence of critical ’s for which ( .n/ p .; /
.n/ > 0; for 2 0; p ./ ; .n/ D 0; for 2 p ./; 1 ;
p 2 N:
(10)
As a consequence of Theorems 1.1 and 1.2 we have, 8 .n/ ˆ if 1 d 2; ˆ < p ./ D 1; .n/ 0 < p ./ < 1; if d 3 and p > =Gd .0/; ˆ ˆ : .n/ ./ D 0; if d 3 and p =Gd .0/: p
(11)
.n/
Our fourth theorem, which gives bounds on p ./ for d 3, will be proved in Sect. 4. For this theorem, we need to define the inverse of the function ./. Note that by (8) and (9), we have .0/ D 1 and .Gd .0// D 0. It is easy to see that ./ restricted to the domain Œ0; Gd .0/ is invertible with an inverse function
1 W Œ0; 1 ! Œ0; Gd .0/. We extend 1 to Œ0; 1/ by declaring 1 .t/ D 0 for t > 1. Denote ˛d D
Gd .0/ 2 Œ0; 1/ ; 2d kGd k22
(12)
where kGd k2 is the l2 norm of Gd . Since kGd k2 < 1 if and only if d 5, ˛d D 0 for d 2 f3; 4g. Theorem 1.4 (Critical ’s). Let n; p 2 N. .n/
(i) If d 3, then 2 Œ0; 1/ 7! p ./ is a continuous, non-increasing and convex function such that
98
F. Castell et al.
n 1 .n/
.=p/; n .4d=p/ p ./ nGd .0/ 1 max : 4d pGd .0/ C (13) (ii) If d 5, then n .n/ : (14) p ./ nGd .0/ p˛d C
p1 p ,
(iii) If d 5 and p 2 N n f1g are such that ˛d > .n/
then
8 2 .0; pGd .0//:
p1 ./ < p.n/ ./
(15)
Note that the condition ˛d > p1 p is always true if d is large enough by the following lemma, whose proof is given in the appendix. Lemma 1.1. If d 3, then ˛d 1 and limd !1 ˛d D 1. As a consequence of the previous statements, our next result gives some general intermittency properties for all dimensions, and describes several regimes in the intermittent behavior of the system. Corollary 1.1 (Intermittency). Let n 2 N. (i) If d 1, then (see Fig. 2) – For 2 Œ0; nGd .0// there exists p 2 such that the system is p-intermittent; – For 2 ŒnGd .0/; 1/ the system is not intermittent. (ii) Fix p 2 N n f1g. If d is large enough (such that ˛d > .p 1/=p ), then for .n/ .n/ all q 2 f2; : : : ; pg, 2 Œ0; qGd .0// and 2 .q1 ./; q .//, the system is q-intermittent (see Fig. 3). Note that since Gd .0/ D 1 for d D 1; 2, Corollary 1.1(i) implies that for dimensions 1 and 2 the system is always p-intermittent for some p. Some other partial results about intermittency are given in sect. 1.4 (see also figures). k no intermittency
nGd (0)
Fig. 3 Phase diagram of intermittency when d is large enough. The bold curves represent 2 Œ0; 1/ 7! .n/ q ./, q D 1; : : : ; p. In the “?” region, full intermittency is proved in a small neighborhood of 0
? 0
2-int.
···
p-int.
··· r
Gd (0) 2Gd (0)
··· (p − 1)Gd (0)
pGd (0)
Parabolic Anderson Model with a Finite Number of Moving Catalysts
99
1.5 Discussion Our results can be extended to various different random medium. For example, consider the system of catalysts given by a collection of independent random walks where there is one walker starting from each site of a large box. More precisely, let DR denote the box in Zd with side length R. Consider the random medium X ıx .Yk .t//; .x; t/ D k2DR
with fYk W k 2 DR g a family of Rd simple random walks, where for each k 2 DR , Yk is a simple random walk with step rate 2d starting from Yk .0/ D k. For a fixed size box, there is a positive probability that all the random walks meet at the origin in finite time. Then, it is easy to see that the Lyapunov exponents are the same as in the case of n independent random walks starting from the origin where n D Rd . An interesting set up would be case where the length of the initial box grows with time. A natural question arises as whether the large time limit would be related to the case of Poisson field of simple random walks, considered in [4], or it would have different behaviour depending on how fast the size of the box grows with time. Let us now discuss some facts about the intermittent picture. First of all, as one .n/ can easily guess from (4), p .; / is the top of the spectrum of the operator Lp where for f .x1 ; ; xp ; y1 ; ; yn / in l2 .Zd.pCn/ / Lp , is defined by: Lp .f / D
p X
xk f C
kD1
n X
yj f C Ip f:
(16)
j D1
Here, Ip f .x1 ; ; xp ; y1 ; ; yn / D
p n X X
ı0 .xj yk /f .x1 ; ; xp ; y1 ; ; yn /:
kD1 j D1
This is the meaning of equation (20) of Sect. 2 from which most of our results are derived. The following proposition links full intermittency and existence of an .n/ eigenfunction corresponding to 1 .; /. Proposition 1.1. If there exists f 2 l2 .Zd.1Cn/ / with kf k2 D 1, such that .n/ .n/ .n/ L1 .f / D 1 .; /f , then 2 .; / > 1 .; /, and the system is fully intermittent. Proposition 1.1 is proved in the appendix. The existence of an eigenfunction .n/ corresponding to 1 .; / (and therefore full intermittency) was proved in the following cases: • n D 1; 2 and C < nGd .0/. This is done in [3] for n D 1, and in [15] for n D 2. • n 3 and 4d.n C / < 1 in [15].
100
F. Castell et al. .n/
To prove these results, in [3] and [15] P 1 .; / was expressed as the top of the spectrum of the operator H D B C nj D1 ı0 .zj /, where B is the generator of the Markov process Z.t/ D .X1 .t/ Y1 .t/; ; X1 .t/ Yn .t// (see (4)). For n D 1, H is just . C / C ı0 , which is a compact perturbation of . C /. This .1/ fact easily implies the existence of an eigenfunction corresponding to 1 .; /. However, this is no more the case as soon P as n 2. In [15], Schnitzler and Wolff considered B as a perturbation of nj D1 ı0 .zj /, leading to the results for .n/
n 2. Expressing p .; / in terms of the process .Z.t//t 0 does not seem very fruitful in cases other than the one treated in [3] and[15]. Therefore, it appeared .n/ to us more natural and more tractable to express p .; / in terms of the process .X1 .t/; ; Xp .t/; Y1 .t/; ; Yn .t//. We complete the intermittent picture by the following conjecture: Conjecture 1 (Intermittency). Fix n 2 N. Then (see Fig. 1–2), (1) For 1 d 2, the system is full intermittent (proved for n D 1; 2); (2) For d 3, the intermittency vanishes as increases. More precisely, for d 3, there are three different regimes: .n/
A: For 2 Œ0; 2 /, the system is full intermittent (proved in a small neighborhood of 0); .n/ B: For 2 Œ2 ; nGd .0//, there exists p D p./ 3 such that the system is q-intermittent for all q p; C: For 2 ŒnGd .0/; 1/, the system is not p-intermittent for any p 2. To complete Theorem 1.4, we close with a conjecture about critical ’s, whose analogue for white noise potential was conjectured in Carmona and Molchanov [2] and partially proved in Greven and den Hollander [11]: .n/
Conjecture 2 (Critical ’s). For all fixed n 1 and d large enough, the p ’s are distinct (see Fig. 2).
2 Proof of Theorem 1.1 Step 1: We first prove that if the limit in (5) exists for x D 0, then it exists for all x 2 Zd and does not depend on x as soon as .; / ¤ .0; 0/. To this end, let us introduce some notations. For any t > 0, we denote
Yt D .Y1 .t/; ; Yn .t// 2 Zdn ; Xt D .X1 .t/; ; Xp .t// 2 Zdp : For .x; y/ 2 Zdp Zdn , EX;Y x;y denotes the expectation under the law of .Xt ; Yt /t 0 starting from .x; y/. The same notation is used for x 2 Zd and y 2 Zd . In that case, ˝p ˝n it means that X0 D .x; ; x/, Y0 D .y; ; y/ and EX;Y x;y D Ey ˝ Ex . Finally, for x D .x1 ; ; xp / 2 Zdp and y D .y1 ; ; yn / 2 Zdn , set
Parabolic Anderson Model with a Finite Number of Moving Catalysts
Ip .x; y/ D
p n X X
101
ı0 .xj yk /:
(17)
j D1 kD1
Then, by time reversal for Y in (4), for all x 2 Zd and t > 0, p E˝n 0 Œu.x; t/ D
X
2 EX;Y x;z
0 t 1 3 Z 4exp @ Ip .Xs ; Ys / ds A ı0 .Yt /5 :
z2Zdn
(18)
0
Using the Markov property at time 1 and the fact that 1 exp
R
1 0 Ip .Xs ; Ys / ds
,
we get for x1 and x2 any fixed points in Zd , E˝n 0
Œu.x1 ; t/ p
X
2 EX;Y x1 ;z
0
4ı.x2 ; ;x2 / .X1 /ız .Y1 / exp @
z2Zdn
D p1 .x1 ; x2 /
p
n p1 .0; 0/
Zt
1
3
Ip .Xs ; Ys / ds A ı0 .Yt /5
1 p E˝n 0 .Œu .x2 ; t 1/ / ;
where pt is the transition kernel of a simple random walk on Zd with step rate 2d. This proves the independence of p w.r.t. x as soon as > 0, since in this case for all x1 ; x2 2 Zd , p1 .x1 ; x2 / > 0. For D 0, since the X -particles do not move, we have 2
0
p 4 @ E˝n 0 Œu.x1 ; t/ D E0 exp p
Zt
13n ıx1 .Y1 .s// ds A5 :
(19)
0
The same reasoning leads now to p p n ˝n E˝n 0 Œu.x1 ; t/ p1 .0; x1 x2 / E0 .Œu.x2 ; t 1/ / :
Step 2: Variational representation. From now on, we restrict our attention to the .n/ case x D 0. The aim of this step is to give a variational representation of p .; /. To this end, we introduce further notations. Let .e1 ; ; ed / be the canonical basis of Rd . For x D .x1 ; ; xp / 2 Zdp , and f W .x; y/ 2 Zdp Zdn 7! R, we set rx f .x; y/ D rx1 f .x; y/; ; rxp f .x; y/ 2 Rdp ; where for j 2 f1; ; pg, and i 2 f1; ; d g, ˛ ˝ rxj f .x; y/; ei D f .x1 ; ; xj C ei ; ; xp ; y/ f .x; y/:
102
F. Castell et al.
The same notation is used for the y-coordinates, so that ry f .x; y/ 2 Rdn . We also define x f .x; y/ D
p X
xj f .x; y/
j D1 p X X D f .x1 ; ; zj ; ; xp ; y/ f .x1 ; ; xj ; ; xp ; y/ : j D1
zj 2Zd zj xj
Proposition 2.1. Let d 1 and n; p 2 N. For all ; 2 Œ0; 1/, 1 p log E˝n 0 Œu.0; t/ pt 8 9 < = X 1 2 sup D Ip .x; y/f 2 .x; y/ : krx f k22 ry f 2 C ; p f 2l 2 .Zdp Zdn: /
.n/ p .; / D lim
t !1
.x;y/
kf k2 D1
(20) Proof. Upper bound. For a positive integer m, let BRm denote the ball in Zdm of radius R D t log.t/ centred at the origin. We first prove the following lemma which p states we can restrict (18) to X paths being in BR at time t and Y paths starting from n BR . Lemma 2.1. As t ! 1, p E˝n 0 Œu.x; t/ D .1Co.1//
X
2
0
4exp @ EX;Y 0;z
n z2BR
Zt
1
3
Ip .Xs ; Ys / ds A ı0 .Yt / 1I.B p / .Xt /5: R
0
(21)
Proof. It is enough to prove that E˝n 0 r.t/ WD
Œu.x; t/ p
X
2 EX;Y 0;z
n z2BR
0
4exp @
Zt
1
3
Ip .Xs ; Ys / ds A ı0 .Yt / 1I.B p / .Xt /5 R
0
p E˝n 0 Œu.x; t/
; (22)
converges to 0 as t ! 1. Using the trivial bounds 0 1 exp @
Zt 0
1 Ip .Xs ; Ys / ds A exp.tnp/;
(23)
Parabolic Anderson Model with a Finite Number of Moving Catalysts
103
and splitting the sum in (18), we get r.t/ X
X
e tnp EX;Y 0;z Œı0 .Yt /
EX;Y 0;z
Œı0 .Yt / C
X
EX;Y 0;z
i
h ı0 .Yt / 1I.B p /c .Xt / R
n z2BR
n z…BR
z2Z dn
X
X
e tnp Pz .Yt D 0/
Pz .Yt D 0/ C P0 .Xt …
p BR /
!
X
! Pz .Yt D 0/
n z2BR
n z…BR
z2Zdn p
e tnp .P0 .Yt … BRn / C P0 .Xt … BR //; where for the last two inequalities we used the time reversal of Y . We have for R D t log.t/ and large enough t
P0 .Y1 .t/ … BR1 / expŒC.d; /t log.t/;
(24)
P0 .X1 .t/ … BR1 / expŒC.d; /t log.t/
for some positive constants C.d; / and C.d; / (see for instance Lemma 4.3 in [10]). Using this, we get
t !1 r.t/ e tnp neC.d;/t log t C peC.d;/t log t ! 0: t u
This finishes the proof of the lemma. Using Lemma 2.1 it is enough to study the existence of 1 3 2 0 t Z X X;Y 1 lim log E0;z 4exp @ Ip .Xs ; Ys / ds A ı0 .Yt / 1IB p .Xt /5 R t !1 t n z2BR
D lim
t !1
0
˝ ˛ 1 log f1 ; e t Lp f2 ; t
where f1 W .x; y/ 2 Zdp Zdn 7! ı0 .x/ 1IBRn .y/, f2 W .x; y/ 2 Zdp Zdn 7! 1IBRp .x/ı0 .y/, and Lp is the bounded self-adjoint operator in l 2 .Zdp Zdn / defined by Lp f .x; y/ D x f .x; y/Cy f .x; y/CIp .x; y/f .x; y/; For a linear operator L on l 2 .Zdp Zdn /, we define kL k2;2 WD
sup f 2l 2 .Zdp Zdn / kf k2 D1
hf; L f i :
.x; y/ 2 Zdp Zdn :
104
F. Castell et al.
Note that we have ˝
˛ f1 ; e t Lp f2 kf1 k2 e t Lp 2;2 kf2 k2 D C.d; n; p/Rd.nCp/=2 e t Lp 2;2 ;
for some constant C.d; n; p/ > 0. Thus, lim
t !1
˝ ˛ 1 log f1 ; e t Lp f2 Lp 2;2 D t
sup f 2l 2 .Zdp Zdn / kf k2 D1
˝
˛ f; Lp f ;
which is the upper bound in (20). Lower bound. By (18) with x D 0, it follows that 2 p E˝n 0 Œu.0; t/
EX;Y 0;0
1 3 0 t Z 4exp @ Ip .Xs ; Ys / ds A ı0 .Xt /ı0 .Yt /5 0
2 ˛ ˝ t D ı0 ˝ ı0 ; e t Lp .ı0 ˝ ı0 / D e 2 Lp .ı0 ˝ ı0 /
2 X X t D e 2 Lp .ı0 ˝ ı0 /.x; y/ :
2
x2Zdp y2Zdn p
Restricting the sum over BR BRn , and applying Jensen’s inequality, we get p E˝n 0 Œu.0; t/
2 X X t e 2 Lp .ı0 ˝ ı0 /.x; y/ p n x2BR y2BR
0 12 1 @ X X t Lp 1 n e 2 .ı0 ˝ ı0 /.x; y/A jBR j jBRp j p n x2BR y2BR
0 D
C.d; n; p/ @ Rd.nCp/
X X
2 EX;Y x;y
p n x2BR y2BR
0 D
C.d; n; p/ @ X;Y E0;0 Rd.nCp/
0 t =2 1 3 12 Z 4exp @ Ip .Xs ; Ys / ds A ı0 .Xt =2 /ı0 .Yt =2 /5A 0
1 312 0 t =2 Z 4exp @ Ip .Xs ; Ys / ds A 1IB p .Xt =2 / 1IB n .Yt =2 /5A : R 2
R
0
Parabolic Anderson Model with a Finite Number of Moving Catalysts
105
Taking R D t log.t/, we obtain that 1 p log E˝n 0 Œu.0; t/ t !1 t 2 1 3 0 t =2 Z 2 4exp @ Ip .Xs ; Ys / ds A 1IB p .Xt =2 / 1IB n .Yt =2 /5 : lim inf log EX;Y 0;0 R R t !1 t
lim inf
0
On the other hand, by (23), (24) and our choice of R, we have 1 3 0 t =2 Z 4exp @ Ip .Xs ; Ys / ds A 1I.B p B n /c .Xt =2 ; Yt =2 /5 2 EX;Y 0;0
R
R
0
tnp
p P0 .Xt =2 … BR /P0 .Yt =2 … BRn / 2 h tnp i np exp C.d; / C C.d; / t log.t/ ; 2 exp
and therefore, with a similary reasoning as in the proof of Lemma 2.1 we get 2 13 0 t =2 Z 1 2 p 4exp @ Ip .Xs ; Ys / ds A5 : lim inf log E˝n inf log EX;Y 0;0 0 Œu.0; t/ lim t !1 t t !1 t 0
Now, the occupation measure
1 t
Rt 0 dp
ı.Xs ;Ys / ds satisfies a weak large deviations
principle (LDP) in the space M1 .Z Zdn / of probability measures on Zdp Zdn , endowed with the weak topology. The speed of this LDP is t, and the rate function is given for all 2 M1 .Zdp Zdn / by p 2 p 2 J./ D rx 2 C ry 2 ; (see, e.g., den Hollander [12], Sect. IV.4). Since I is bounded, the lower bound in Varadhan’s integral lemma (see, e.g., den Hollander [12], Sect. III.3) yields
lim inf t !1
8 <X
1 p log E˝n sup 0 Œu.0; t/ t 2M1 .Zdp Zdn / :
Setting f .x; y/ D
.x;y/
9 =
Ip .x; y/.x; y/ J./ : ;
p .x; y/ gives then the lower bound in (20). .n/
t u .n/
Step 3: Properties of p . Since 0 Ip .x; y/ np, we clearly have 0 p n. .n/ Using representation (20), we can conclude that the function .; / 7! p .; /
106
F. Castell et al. .n/
is convex and non-increasing in and . Moreover, p .; / is lower semicontinuous since it is supremum of functions that are linear in and . Finally, .n/ since every finite convex function is also upper semi-continuous, p is upper semi.n/ continuous. Hence, p .; / is continuous.
3 Proof of Theorems 1.2–1.3 By symmetry, note that for all n; p 2 N and ; 2 Œ0; 1/, .n/ p .; / D
n .p/ .; /: p n
(25)
3.1 Proof of Theorem 1.2 .n/
.n/
Proof of (i) By continuity, lim!0 p .; / D p .0; for /. Now n D 0, the p Y X particles do not move so that E˝n (see (19)), 0 Œu.0; t/ D E0 exp pLt .0/ where LYt .0/ is the local time at 0 of a simple random walk in Zd with rate 2d. Using the LDP for LYt , we obtain .n/ p .0; / D
n p
sup hf; . C pı0 /f i D n .=p/:
f 2l 2 .Zd / kf k2 D1
Proof of (ii) For all n; p 2 N and ; 2 Œ0; 1/, we have .n/
.1/
.1/ .n/ p .; / 1 .; / D n n .; / n 1 .; / D n . C / ;
where the last equality is proved in [3] and comes from the fact that Xt1 Yt1 is a simple random walk in Zd with jump rate 2d. C /. Since Gd .0/ D 1 for .n/ d D 1; 2, it follows from (9) that p .; / > 0 for d D 1; 2. .n/ Let us prove that lim!1 p .; / D 0. By monotonicity in , .n/ .n/ p .; / p .; 0/ D n .=n/:
(26)
Hence, the only thing to prove is that lim!1 ./ D 0. To this end, one can use the discrete Gagliardo-Nirenberg inequality: there exists a constant C such that for all f W Zd 7! R, for d D 1 ; kf k21 C kf k2 krf k2 I for d D 2 ; kf
k24
C kf k2 krf k2 :
(27) (28)
Parabolic Anderson Model with a Finite Number of Moving Catalysts
107
The proof of these inequalities follows the same lines as the proof of the usual Gagliardo-Nirenberg inequality (see, e.g., Brezis [1]). For completeness, a short proof is given in the appendix. From (27) and (28), we get for all f 2 l2 .Zd / with kf k2 D 1, krf k22 C f .0/2
krf k22 C kf k21 for d D 1 krf k22 C kf k24 for d D 2
krf k22 C C krf k2 : Taking the supremum over f yields C2
./ sup x 2 C C x D : 4 x0 .n/
The strict monotonicity is now an easy consequence of the fact that 7! p .; / is convex, positive, non-increasing, and tends to 0 as ! 1. Proof of (iii). By (25) and (26), we get .n/ p .; / n min . .=n/; .=p// :
(29)
Then the claim follows by (9).
3.2 Proof of Theorem 1.3 Proof of (i). Fix > 0. Let f approaching the supremum in the variational .n/ representation (20) of p .; 0/, so that X X
2 p .n/ p .; 0/ krx f k2 C
Ip .x; y/f 2 .x; y/
x2Zdp y2Zdn
p .n/ p .; / C
sup f 2l 2 .Zdp Zdn / kf k2 D1
ry f 2 : 2
For x 2 Zdp , set fx W y 2 Zdn 7! f .x; y/. Since the bottom of the spectrum of in l 2 .Zdn / is 4d n, X X ry fx .y/ 2 4dn fx2 .y/ ; 2 y2Zdn
y2Zdn
108
F. Castell et al.
for all x 2 Zdp . Hence, X X X X ry fx .y/ 2 4d n fx2 .y/ D 4dn: 2 x2Zdp y2Zdn
x2Zdp y2Zdn
Therefore, for all > 0, .n/ p .n/ p .; 0/ p p .; / C 4dn:
Letting ! 0 yields, .n/ p .; 0/
4dn .n/ .n/ p .; / p .; 0/ ; p
(30)
which, after letting p ! 1, gives the claim. .n/
.p/
Proof of (ii). By (25), limn!1 p .; / D limn!1 pn n .; / and by (i), .p/ lim .p/ n .; / n .; 0/ D p .=p/ > 0 ; for p > =Gd .0/:
n!1
.n/
Hence, for p > =Gd .0/, limn!1 p .; / D C1. Proof of (iii). This is a direct consequence of Theorem 1.2(iii).
4 Proof of Theorem 1.4 Proof of (i). We first prove that P p.n/ ./
D
sup f 2l2 .Zdp Zdn / kf k2 D1
x;y
2 Ip .x; y/f 2 .x; y/ ry f 2 krx f k22
;
(31)
with I defined as in (17). Indeed, let us denote by S the supremum in the right-hand side of (31). .n/ .n/ If p ./, then p .; / D 0. Therefore, using (20), for all f 2 l2 .Zdp Zdn / such that kf k2 D 1, X X
2 Ip .x; y/f 2 .x; y/ ry f 2 krx f k22 ;
x2Zdp y2Zdn .n/
so that S . Hence, p ./ S . On the opposite direction, we can assume that S < 1. Then, by definition of S , for all f 2 l2 .Zdp Zdn / such that kf k2 D 1,
Parabolic Anderson Model with a Finite Number of Moving Catalysts
X X
109
2 Ip .x; y/f 2 .x; y/ ry f 2 S krx f k22 :
x2Zdp y2Zdn
Thus, for all f 2 l2 .Zdp Zdn / such that kf k2 D 1, and all S , X X
2 Ip .x; y/f 2 .x; y/ ry f 2 krx f k22 .S / krx f k22 0:
x2Zdp y2Zdn .n/
.n/
.n/
Hence, for all S , p .; / D 0, i.e., p ./. Hence, S p ./. This proves (31). .n/ Since 7! p ./ is a supremum of linear functions, it is lower semi-continuous .n/ and convex. It is also obvious that 7! p ./ is non-increasing. The continuity .n/ follows then from the finiteness of p ./. The lower bound in (13) is a direct consequence of (30). Indeed, since .n/ p .; 0/ D n .=n/, it follows from (30) that if .=n/ > 4d=p, then .n/ < p ./. This yields the bound: p.n/ ./ n 1 .4d=p/: Using the symmetry relation (25), we also get from (30) that .n/ p .; / n .=p/ 4d : .n/
.n/
n
.=p/. Hence, if =p < Gd .0/, p ./ > 0. We have This leads to p ./ 4d .n/ .n/ already seen that p ./ D 0 if =p Gd .0/. Since p .; 0/ D n .=n/, it .n/ follows that p .0/ D nGd .0/. Using convexity, we have, for all 2 Œ0; pGd .0/, .n/
p.n/ ./
.n/
p .pGd .0// p .0/ C p.n/ .0/ D n .Gd .0/ =p/ : pGd .0/
.n/
Since p ./ D 0 if =p Gd .0/, then the upper bound in (13) is proved. Proof of (ii). To prove (14), let f0 be the function f0 .x; y/ D
p n Y Gd .xi / Y i D1
kGd k2
ı0 .yj /:
j D1
Note that for d 5, kGd k2 < 1, so that f0 is well-defined, and has l2 -norm equal to 1. From (31), we get P p.n/ ./
x;y
2 Ip .x; y/f02 .x; y/ ry f0 2 krx f0 k22
:
110
F. Castell et al.
An easy computation then gives X
Ip .x; y/f02 .x; y/ D np
x;y
Gd2 .0/ kGd k22
;
ry f0 2 D n ry ı0 2 D 2dn ; 1 2 2 and krx f0 k22 D p
krx1 Gd k22 kGd k22
Dp
Gd .0/ kGd k22
;
since krx1 Gd k22 D hGd ; Gd i D hGd ; ı0 i D Gd .0/. This gives (14). Proof of (iii). The inequality (15) is clear if 2 Œ.p 1/Gd .0/; pGd .0//, since in .n/ .n/ this case, p1 ./ D 0 < p ./. We assume therefore that 2 .0; .p 1/Gd .0//. .n/
.n/
From (13), we have p1 ./ nGd .0/n=.p 1/, whereas, from (14), p ./ nGd .0/ n=.p˛d /. Hence, the claim.
.n/ p1 ./
<
.n/ p ./
as soon as ˛d >
p1 p .
This gives
5 Proof of Corollary 1.1 .n/
.n/
Proof of (i). The function p 7! p .; / increases from 1 .; / to n .=n/. .n/ .n/ .n/ Hence, there exists p such that p .; / < pC1 .; / as soon as 1 .; / < .n/
.n/
n .=n/. But n .=n/ D 1 .; 0/. Hence, if 1 .; / D n .=n/, the convex .n/ decreasing function 7! 1 .; / is constant. Being equal to 0 for Gd .0/, we get that n .=n/ D 0, which can not be the case if < nGd .0/. This ends the proof of the first part. .n/ If nGd .0/, then p .; / D 0, for all p 1, and the system is not intermittent. This proves the second part. Proof of (ii). For all p 2 N n f1g by Lemma 1.1 for d large enough, we have q1 ˛d > p1 p . This implies that ˛d > q for all q 2 N n f1g and q p. Hence, by .n/
.n/
Theorem 1.4(iii), for all q 2 N n f1g with q p we have q1 ./ < q ./, for all 2 .0; pGd .0//. Hence, in the domain n
one has
o .n/ .; /W 2 .0; qGd .0// ; q1 ./ < q.n/ ./ ; .n/
.n/
1 .; / D D q1 .; / D 0 < .n/ q .; / ; which proves the desired result.
Parabolic Anderson Model with a Finite Number of Moving Catalysts
111
Acknowledgement The research in this paper was supported by the ANR-project MEMEMO.
Appendix: Proof of Lemma 1.1 For a function f W Zd 7! R, let fO denote the Fourier transform of f : X fO. / D ei h ;xi f .x/ 8 2 Œ0; 2d : x2Zd
Then, the inverse Fourier transform is given by Z 1 f .x/ D ei h ;xi fO. / d ; .2/d Œ0;2d
and the Plancherel’s formula reads X
f 2 .x/ D
x2Zd
1 .2/d
Z
jfO. /j2 d :
Œ0;2d
Using the equation Gd D ı0 , we get that GO d . / D
2
1
Pd
i D1 .1
cos. i //
:
Hence, Gd .0/ D
D
1 .2/d
Œ0;2d
2
Œ0;d
" 2
Pd
2
i D1 .1
Pd
i D1 .1
d
Pd
Z
1 d
D E
Z
cos. i //
d
i D1 .1
cos. i // #
1 cos.i //
where the random variables .i / are i.i.d. with uniform distribution on Œ0; . Moreover, by Plancherel’s formula we have
kGd k22 D
1 .2/d
Z Œ0;2d
2
3
d 1 7 6 P
2 D E4 P
2 5: d d 2 i D1 .1 cos. i // 2 i D1 .1 cos.i //
112
F. Castell et al.
Thus, Gd .0/
˛d D where SNd D get that
1 d
Pd
2d kGd k22
D
E E
h h
1 SNd 1 SNd2
i i;
cos.i //. Applying H¨older’s and Jensen’s inequality, we
i D1 .1
1 ˛d r h i E.SNd / D 1: E SN12 d
By the law of large numbers, SNd converges almost surely to E Œ1 cos./ D 1 as d tends to infinity. We are now going to prove that SNd2 is uniformly integrable by showing that for all p > 2, p sup E SNd < 1:
(32)
d >2p
Indeed, let 2 .0; / be a small positive number to be fixed later. Let I D fi 2 f1; ; d gW 0 i g : 1 X c X 2 SNd .1 cos. // C i ; d d i 2I
i …I
where c D inf0
1cos. /
2
d X p E SNd d p
kD0
! 1=2 when ! 0. Therefore,
X I f1; ;d g jI jDk
"
1II DI
#
E p : P .1 cos. //.d k/ C c i 2I i2
Since the last expectation only depends on jI j, we get d X p d E SNd d p a.k; ; d / ; k kD0
with a.k; ; d / WD
1 d
Z 0 1 ; ; k kC1 ; ; d
d 1 d d p : .1 cos. //.d k/ C c . 12 C C k2 /
Parabolic Anderson Model with a Finite Number of Moving Catalysts
113
Let !d denote the volume of the d -dimensional unit ball. For k D d , a.d; ; d / D D for d > 2p. Note that for large d , !d ' dp
1 d
Z
1
d 1 d d
0 1 ; ; d Z pd
p c d
!d
d
.2e/d=2 p . d d d=2
p
c k k2p r d 2p1 dr
0
1 d !d ; d 2 p .c 2 /p d 2p Therefore, as d ! 1
d a.d; ; d / D O d 3=2 . 2 2e=/d=2 : d
If is chosen so that 2 =.2e/, we obtain that limd !1 d p For k d 1, a.k; ; d /
d d
a.d; ; d / D 0.
k d k 1 1 1 ; .1 cos. //p .d k/p
1IN Dk .1 N=d /p , where N is a Binomial p random variable with parameters d and =. Hence, for < min.; =.2e//, and d p
d k
"
a.k; ; d /
1 E p N Sd
#
1 EŒ .1cos. //p
1 E Œ 1IN d 1 .1 N=d /p C O d 3=2 .1 cos. //p
dp 2 N d 1 P d .1 cos. //p 1 C C O d 3=2 : 2 p p .1 cos. // .1 /
Now, by the large deviations principle satisfied by N=d , there is an i. / > 0 such that P ŒN d2 = exp.di. //. This ends the proof of (32). Using the uniform (32), and the fact that SNd converges a.s. to 1, we h i h i integrability 1 1 obtain that E SN and E SN 2 both converge to 1, when d goes to infinity. d
d
114
F. Castell et al.
Appendix: Proof of Proposition 1.1. .n/
Let f 2 l2 .Zd.1Cn// with kf k2 D 1, such that L1 f D 1 .; /f . Define fQ.x1 ; x2 ; y/ D f .x1 ; y/f .x2 ; y/;
x1 ; y1 2 Zd ; y 2 Zdn :
Since X
fQ2 .x1 ; x2 ; y/ D
X X
x1 ;x2 ;y
y
!2 2
f .x; y/
x
sup y
X
! f .x; y/ kf k22 kf k42 ; 2
x
it follows that fQ is in l2 .Zd.2Cn/ /. A simple computation yields x1 fQ.x1 ; x2 ; y/ D f .x2 ; y/x f .x1 ; y/; x2 fQ.x1 ; x2 ; y/ D f .x1 ; y/x f .x2 ; y/; and y fQ.x1 ; x2 ; y/ D f .x2 ; y/y f .x1 ; y/ C f .x1 ; y/y f .x2 ; y/ X C .f .x1 ; z/ f .x1 ; y//.f .x2 ; z/ f .x2 ; y//: zy
Since
I2 fQ.x1 ; x2 ; y/ D f .x2 ; y/I1 f .x1 ; y/ C f .x1 ; y/I1 f .x2 ; y/ ;
(recalling (17)), this leads to L2 fQ.x1 ; x2 ; y/ D2 1 .; /fQ.x1 ; x2 ; y/ X C f .x1 ; z/ f .x1 ; y/ f .x2 ; z/ f .x2 ; y/ .n/
zy
(recalling (16). Therefore, 2 E 1D Q .n/ f ; L2 fQ 2 .; / fQ 2 2 D Note that
2 .n/ 1 .; / fQ 2
X
X
y;zy
x
X X C f .x; y/.f .x; z/ f .x; y// 2 y;zy x !2
f .x; y/.f .x; z/ f .x; y//
0;
!2 :
Parabolic Anderson Model with a Finite Number of Moving Catalysts
115
P with equality to 0 if and only if for all y and z x f .x; y/.f .x; z/ P y, f .x; y// D 0. Interchanging the role of z and y yields x .f .x; z/f .x; y//2 D 0, so that for all x, y and z y, f .x; z/ D f .x; y/. Hence, for all x, y, f .x; y/ D .n/ .n/ f .x; 0/. This is impossible since kf k2 D 1. Thus, 2 .; / > 1 .; /. t u
Appendix: Proof of the Discrete Gagliardo–Nirenberg Inequality Proof for d D 1. One can assume that kf k2 < 1, otherwise there is nothing to prove. Hence limjxj!1 jf .x/j D 0, and by the Cauchy–Schwarz inequality, we have for all x 2 Z, x X
f .x/ D 2
f 2 .j / f 2 .j 1/
j D1 C1 X
jf .j / f .j 1/j .jf .j /j C jf .j 1/j/
j D1
2
sX
jf .j / f .j 1/j2
sX
j
f 2 .j /
j
D 2 kf k2 krf k2 ; which proves (27) with C D 2. Proof for d D 2. Here again, one can assume that kf k2 < 1, and consequently limjx1 j!1 jf .x1 ; x2 /j D 0. Then, by the Cauchy–Schwarz inequality, we have for all x1 ; x2 2 Z, x1 X
f 2 .x1 ; x2 / D
f 2 .j1 ; x2 / f 2 .j1 1; x2 /
j1 D1 C1 X
jf .j1 ; x2 / f .j1 1; x2 /j .jf .j1 ; x2 /j C jf .j1 1; x2 /j/
j1 D1
2
sX
jf .j1 ; x2 / f .j1 1; x2 /j
j1
D 2 kf . ; x2 /k2
sX j1
2
sX
f 2 .j1 ; x2 /
j1
jrx1 f .j1 ; x2 /j2 WD 2fQ1 .x2 /:
116
F. Castell et al.
Similarly, we have f 2 .x1 ; x2 / 2 kf .x1 ; /k2
sX
jrx2 f .x1 ; j2 /j2 WD 2fQ2 .x1 /:
j2
Thus
X
f .x1 ; x2 / 4 4
x1 ;x2
X
! fQ1 .x2 /
X
x2
! Q f2 .x1 / :
x1
Since X
fQ1 .x2 / D
x2
X
kf . ; x2 /k2
sX
x2
sX
jrx1 f .j1 ; x2 /j2
j1
kf . ; x2 /k22
x2
sX X x2
jrx1 f .j1 ; x2 /j2
j1
kf k2 krf k2 ; and the same being true for
P x1
fQ2 .x1 /, it follows that
kf k44 4 kf k22 krf k22 ; which proves (28) with C D 2.
References 1. Brezis, H.: Analyse fonctionnelle: Th´eorie et applications. Collection Math´ematiques Appliqu´ees pour la Maˆıtrise, Masson, Paris (1983) 2. Carmona R.A., Molchanov, S.A.: Parabolic Anderson Problem and Intermittency. AMS Memoir 518, American Mathematical Society, Providence RI (1994) 3. G¨artner, J., Heydenreich, M.: Annealed asymptotics for the parabolic Anderson model with a moving catalyst. Stoch. Proc. Appl. 116, 1511–1529 (2006) 4. G¨artner, J., den Hollander, F.: Intermittency in a catalytic random medium. Ann. Probab. 34, 2219–2287 (2006) 5. G¨artner J., den Hollander, F., Maillard, G.: Intermittency on catalysts: symmetric exclusion. Electronic J. Probab. 12, 516–573 (2007) 6. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts. In: Blath, J., M¨orters P., Scheutzow, M. (eds.) Trends in Stochastic Analysis, London Mathematical Society Lecture Note Series 353, pp. 235-248. Cambridge University Press, Cambridge (2009) 7. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts: three-dimensional simple symmetric exclusion. Electronic J. Probab. 72, 2091–2129 (2009) 8. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts: voter model. Ann. Probab. 38, 2066–2102 (2010)
Parabolic Anderson Model with a Finite Number of Moving Catalysts
117
9. G¨artner, J., K¨onig, W.: The parabolic Anderson model. In: Deuschel, J.-D., Greven, A. (eds.) Interacting Stochastic Systems, pp. 153–179. Springer, Berlin (2005) 10. G¨artner, J., Molchanov, S.A.: Parabolic problems for the Anderson model. Commun. Math. Phys. 132, 613–655 (1990) 11. Greven, A., den Hollander, F.: Phase transition for the long-time behavior of interacting diffusions. Ann. Probab. 35, 1250–1306 (2007) 12. den Hollander, F.: Large Deviations. Fields Institute Monographs 14, American Mathematical Society, Providence, RI (2000) 13. Kesten, H., Sidoravicius, V.: Branching random walk with catalysts. Electr. J. Prob. 8, 1–51 (2003) 14. Maillard, G., Mountford, T., Sch¨opfer, S.: Parabolic Anderson model with voter catalysts: Dichotomy in the behavior of Lyapunov exponents. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U., (eds.), Probability in Complex Physical Systems, Vol. 11, pp. 33–68. Springer, Heidelberg (2012) 15. Schnitzler, A., Wolff, T.: Precise asymptotics for the parabolic Anderson model with a moving catalyst or trap. In: Deuschel, J.-D., Gentz, B., K¨onig, W., von Renesse, M.-K., Scheutzow, M., Schmock, U., (eds.), Probability in Complex physical systems, Vol. 11, pp. 69–89. Springer, Heldelberg (2012)
Survival Probability of a Random Walk Among a Poisson System of Moving Traps Alexander Drewitz, Jurgen ¨ G¨artner, Alejandro F. Ram´ırez, and Rongfeng Sun
Abstract We review some old and prove some new results on the survival probability of a random walk among a Poisson system of moving traps on Zd , which can also be interpreted as the solution of a parabolic Anderson model with a random time-dependent potential. We show that the annealed survival probability decays p asymptotically as e1 t for d D 1, as e2 t = log t for d D 2, and as ed t for d 3, where 1 and 2 can be identified explicitly. In addition, we show that the quenched Q survival probability decays asymptotically as ed t , with Q d > 0 for all d 1. A key ingredient in bounding the annealed survival probability is what is known in the physics literature as the Pascal principle, which asserts that the annealed survival probability is maximized if the random walk stays at a fixed position. A corollary of independent interest is that the expected cardinality of the range of a continuous time symmetric random walk increases under perturbation by a deterministic path. AMS 2010 subject classification: 60K37, 60K35, 82C22.
A. Drewitz Departement Mathematik, Eidgen¨ossische Technische Hochschule Z¨urich, R¨amistrasse 101, 8092 Z¨urich, Switzerland e-mail:
[email protected] J. G¨artner Institut f¨ur Mathematik, Technische Universit¨at Berlin, Sekr. MA 7-5, Str. des 17. Juni 136, 10623 Berlin, Germany e-mail:
[email protected] A.F. Ram´ırez Facultad de Matem´aticas, Pontificia Universidad Cat´olica de Chile, VicuQna Mackenna 4860, Macul, Santiago, Chile e-mail:
[email protected] R. Sun () Department of Mathematics, National University of Singapore, 10 Lower Kent Ridge Road, 119076 Singapore e-mail:
[email protected] J.-D. Deuschel et al. (eds.), Probability in Complex Physical Systems, Springer Proceedings in Mathematics 11, DOI 10.1007/978-3-642-23811-6 6, © Springer-Verlag Berlin Heidelberg 2012
119
120
A. Drewitz et al.
1 Introduction 1.1 Model and Results Let X WD .X.t//t 0 be a simple symmetric random walk on Zd with jump rate y 0, and let .Yj /1j Ny ;y2Zd be a collection of independent simple symmetric random walks on Zd with jump rate > 0, where Ny is the number of walks that start at each y 2 Zd at time 0, .Ny /y2Zd are i.i.d. Poisson distributed with mean y y > 0, and Yj WD .Yj .t//t 0 denotes the j th walk starting at y at time 0. Let us denote the number of walks Y at position x 2 Zd at time t 0 by X
.t; x/ WD
y
ıx .Yj .t//:
(1)
y2Zd ;1j Ny
It is easy to see that for each t 0, ..t; x//x2Zd are i.i.d. Poisson distributed with mean , so that ..t; //t 0 is a stationary process, and furthermore it is reversible in the sense that ..t; //0t T is equally distributed with ..T t; //0t T . We will interpret the collection of walks Y as traps, and at each time t, the walk X is killed with rate .t; X.t// for some parameter > 0. Conditional on the realization of the field of traps , the probability that the walk X survives by time t is given by 8 93 < Zt = 4 5; exp WD EX .s; X.s// ds 0 : ; 2
Zt;
(2)
0
where EX 0 denotes expectation with respect to X with X.0/ D 0. We call this the quenched survival probability, which depends on the random medium . When we furthermore average over , which we denote by E , we obtain the annealed survival probability
E
h
Zt;
i
2
8 <
4exp D E EX 0 :
Zt
93 = .s; X.s// ds 5: ;
(3)
0
We will study the long time behavior of the annealed and quenched survival probabilities and, in particular, identify their rate of decay and their dependence on the spatial dimension d and the parameters ; ; ; and . Here are our main results on the decay rate of the annealed and quenched survival probabilities. Theorem 1.1 [Annealed survival probability]. Assume that 2 .0; 1, 0, > 0, and > 0, then
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
8 r n o ˆ 8t ˆ ˆ exp .1 C o.1// ; ˆ ˆ ˆ ˆ < o n t E ŒZt; D .1 C o.1// ; exp ˆ ˆ log t ˆ ˆ ˆ n o ˆ ˆ : exp d;;;; t.1 C o.1// ;
121
d D 1; d D 2;
(4)
d 3;
where d;;;; depends on d , , , , , and is called the annealed Lyapunov exponent. Furthermore, d;;;; d;;0;; D =.1 C Gd .0/ /, where Gd .0/ R1 WD 0 pt .0/ dt is the Green function of a simple symmetric random walk on Zd with jump rate 1 and transition kernel pt ./. Note that in dimensions 1 and 2, the annealed survival probability decays subexponentially, and the prefactor in front of the decay rate is surprisingly independent of 2 .0; 1 and 0. The key ingredient in the proof is what is known in the physics literature as the Pascal principle, which asserts that in (3), if we condition on the random walk trajectory X , then the annealed survival probability is maximized when X 0. The discrete time version of the Pascal principle was proved by Moreau, Oshanin, B´enichou, and Coppey in [19, 20]. We will include the proof for the reader’s convenience. As a corollary of the Pascal principle, we will show in Corollary 2.1 that the expected cardinality of the range of a continuous time symmetric random walk increases under perturbation by a deterministic path. In contrast to the annealed case, the quenched survival probability always decays exponentially. Theorem 1.2 [Quenched survival probability]. Assume that d 1, > 0, 0, > 0 and > 0. Then there exists deterministic Q d;;;; depending on d; ; ; ; , called the quenched Lyapunov exponent, such that P -a.s., ˚ Zt; D exp Q d;;;; t.1 C o.1// as t ! 1:
(5)
Furthermore, 0 < Q d;;;; C for all d 1; > 0; 0; > 0 and > 0.
Remark. When < 0, Zt; can be interpreted as the expected number of branching random walks in the catalytic medium . See Sect. 1.3 for more discussion on this model. As will be outlined at the end of Sect. 4.1, (5) also holds in this case, and lies in the interval Œ ; 1/. In Proposition 3.2 below, we will also give an upper bound of the same order as in Theorem 1.1 for the survival probability E ŒZt; , where ..0; x//x2Zd is deterministic and satisfies some constraints. These constraints hold asymptotically a.s. for i.i.d. Poisson distributed ..0; x//x2Zd . Therefore, we call this a semiannealed bound, which we will use in Sect. 3 to obtain sub-exponential bounds on the quenched survival probability in dimensions 1 and 2.
122
A. Drewitz et al.
1.2 Relation to the Parabolic Anderson Model
The annealed and quenched survival probabilities Zt; and E ŒZt; are closely related to the solution of the parabolic Anderson model (PAM), namely, the solution of the following parabolic equation with random potential : @ u.t; x/ D u.t; x/ .t; x/ u.t; x/; @t
x 2 Zd ; t 0;
(6)
u.0; x/ D 1; 1 P where ; ; and, are as before, and f .x/ D 2d kyxkD1 .f .y/ f .x// is the d discrete Laplacian on Z , which is also the generator of a simple symmetric random walk on Zd with jump rate 1. By the Feynman–Kac formula, the solution u admits the representation
8 93 < Zt = 4exp .t s; X.s// ds 5; u.t; 0/ D EX 0 : ; 2
(7)
0
which differs from Zt; in (2) by a time reversal in . When we average u.t; 0/ over the random field , by the reversibility of ..t; //0st , we have 93 8 = < Zt 4 5 E Œu.t; 0/ D E EX .t s; X.s// ds exp 0 ; : 2
0
8 93 < Zt = 4 5 D E ŒZ : exp E .s; X.s// ds D EX 0 t; : ; 2
(8)
0
Therefore, Theorem 1.1 also applies to the annealed solution E Œu.t; 0/. Despite the difference between Zt; and u.t; 0/ due to time reversal, Theorem 1.2 also holds with u.t; 0/ in place of Zt; . Theorem 1.3 [Quenched solution of PAM]. Let d 1, > 0, 0, > 0, > 0, and Q d;;;; > 0 be the same as in Theorem 1.2. Then P -a.s., ˚ u.t; 0/ D exp Q d;;;; t.1 C o.1// as t ! 1:
(9)
Remark. By Theorem 1.2 and the remark following it, for any 2 R, t 1 log u.t; 0/ converges in probability to Q d;;;; because u.t; 0/ is equally distributed with Zt; . However, we were only able to strengthen this to almost sure convergence for the > 0 case, but not for < 0. For a broader investigation of the case < 0, see G¨artner et al. [14], which is also contained in the present volume.
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
123
1.3 Review of Related Results The study of trapping problems has a long history in the mathematics and physics literature. We review some models and results that are most relevant to our problem.
1.3.1 Immobile Traps Extensive studies have been carried out for the case of immobile traps, i.e., D 0 and .t; / .0; / for all t 0. A continuum version is Brownian motion among Poissonian obstacles, where a ball of size 1 is placed and centered at each point of a mean density 1 homogeneous Poisson point process in Rd , acting as traps or obstacles, and an independent Brownian motion starts at the origin and is killed at rate times the number of obstacles it is contained in. Using a large deviation principle for the Brownian motion occupation time measure, Donsker and Varadhan [7] showed that the annealed survival probability decays asymptotically d as expfCd; t d C2 .1 C o.1//g. Using spectral techniques, Sznitman [24] later developed a coarse graining method, known as the method of enlargement of obstacles, to show that the quenched survival probability decays asymptotically as expfCN d; .log tt /2=d .1 C o.1//g. Similar results have also been obtained for random walks among immobile Bernoulli traps (i.e., .0; x/ 2 f0; 1g), see e.g., [1, 2, 4, 8]. Traps with a more general form of the trapping potential have also been studied in the context of the parabolic Anderson model (see e.g. Biskup and K¨onig [3]), where alternative techniques to the method of enlargement of obstacles were developed and the order of sub-exponential decay of the survival probabilities may vary depending on the distribution of . Compared to our results in Theorems 1.1 and 1.2 we note that when the traps are moving, both the annealed and quenched survival probabilities decay faster than when the traps are immobile. The heuristic reason is that the walk survives by finding large space–time regions void of traps, which are easily destroyed if the traps are moving. Another example is a Brownian motion among Poissonian obstacles where the obstacles move with a deterministic drift. It has been shown that the annealed and quenched survival probabilities decay exponentially if the drift is sufficiently large, see e.g., [24, Thms. 5.4.7 and 5.4.9].
1.3.2 Mobile Traps The model we consider here has in fact been studied earlier by Redig in [22], where he considered a trapping potential generated by a reversible Markov process, such as a Poisson system of random walks, or the symmetric exclusion process in equilibrium. Using spectral techniques applied to the process of moving traps viewed from the random walk, he established an exponentially decaying upper bound for the annealed survival probability when the empirical distribuRt tion of the trapping potential, 1t 0 .s; 0/ ds, satisfies a large deviation principle
124
A. Drewitz et al.
with scale t. This applies, for instance, to generated from either a Poisson system of independent random walks or the symmetric exclusion process in equilibrium, in dimensions d 3.
1.3.3 Annihilating Two-Type Random Walks In [5], Bramson and Lebowitz studied a model from chemical physics, where there are two types of particles, As and Bs, both starting initially with an i.i.d. Poisson distribution on Zd with density A .0/ and B .0/, respectively. All particles perform independent simple symmetric random walk with jump rate 1, particles of the same type do not interact, and when two particles of opposite types meet, they annihilate each other. This system models a chemical reaction A C B ! inert. It was shown in [5] that when A .0/ D B .0/ > 0, then A .t/ and B .t/ (the densities of the A and B particles at time t) decay with the order t d=4 in dimensions 1 d 4, and decay with the order t 1 in d 4. When A .0/ > B .0/ > 0, it was shown that p A .t/ ! A .0/ B .0/ as t ! 1, and log B .t/ increases with the order t in d D 1, t= log t in d D 2, and t in d 3, which is the same as in Theorem 1.1. Heuristically, as B .t/ ! 0 and A .t/ ! A .0/ B .0/ > 0, we can effectively model the B particles as uncorrelated single random walks among a Poisson field of moving traps with density A .0/ B .0/. In light of Theorem 1.1, it is natural to conjecture that B .t/ decays exactly as prescribed in Theorem 1.1 with D A .0/ B .0/ and D 1, whence we obtain not only the logarithmic order of decay as in [5], but also the constant prefactor. However, we will not address this issue here.
1.3.4 Random Walk Among Moving Catalysts Instead of considering as a field of moving traps, we may consider it as a field of moving catalysts for a system of branching random walks which we call reactants. At time 0, a single reactant starts at the origin which undergoes branching. Independently, each reactant performs simple symmetric random walk on Zd with jump rate , and undergoes binary branching with rate j j.t; x/ when the reactant is at position x at time t. This model was studied by Kesten and Sidoravicius in [15], and in the setting of the parabolic Anderson model, studied by G¨artner and den Hollander in [11]. For the catalytic model, is negative in (2), (3), (7), and (8), and Zt; and E ŒZt; now represent the quenched, resp. annealed, expected number of reactants at time t. It was shown in [11] that E ŒZt; grows double exponentially fast (i.e., t 1 log log E ŒZt; tends to a positive limit as t ! 1) for all < 0 in dimensions d D 1 and 2. In d 3, there exists a critical c;d < 0 such that E ŒZt; grows double exponentially for < c;d , and grows exponentially (i.e., t 1 log E ŒZt; tends to a positive limit as t ! 1) for all 2 .c;d ; 0/. In the quenched case, however, it was shown in [15] that Zt; only exhibits exponential
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
125
growth (with log Zt; shown to be of order t) regardless of the dimension d 1 and the strength of interaction < 0. Such dimension dependence bears similarities with our results for the trap model in Theorems 1.1 and 1.2.
1.3.5 Directed Polymer in a Random Medium
We used Zt; to denote the survival probability, because Zt; and E ŒZt; are in fact the quenched and the annealed partition functions, respectively, of a directed polymer model in a random time-dependent potential at inverse temperature . The directed polymer is modeled by .X.s//0st . In the polymer measure, a trajectory .X.s//0st is reweighted by the survival probability of a random walk following that trajectory in the environment . Namely, we define a change of Rt 0 .s;X.s// ds measure on .X.s//0st with density e =Zt; in the quenched model, Rt
and with density E Œe 0 .s;X.s// ds =E ŒZt; in the annealed model. Qualitatively, the polymer measure favors trajectories which seek out space–time regions void of traps. However, a more quantitative geometric characterization as was carried out for the case of immobile traps (see e.g. [24]) is still lacking. For readers interested in more background on the problem of a Brownian motion (or random walk) in time-independent potential, we refer to the book by Sznitman [24] on Brownian motion among Poissonian obstacles, and the survey by G¨artner and K¨onig [12] on the parabolic Anderson model. For readers interested in more recent studies of a random walk in time-dependent catalytic environments, we refer to the survey by G¨artner, den Hollander, and Maillard [13]. For readers interested in more recent studies of the trapping problem in the physics literature, we refer to the papers of Moreau, Oshanin, B´enichou, and Coppey [19, 20] and the references therein. After the completion of this paper, we learnt that the continuum analogue of our model, i.e., the study of the survival probability of a Brownian motion among a Poisson field of moving obstacles, has recently been carried out by Peres, Sinclair, Sousi, and Stauffer in [21]. See Theorems 1.1 and 3.5 therein.
1.4 Outline The rest of this paper is organized as follows. Section 2 is devoted to the proof of Theorem 1.1 on the annealed survival probability, where the so-called Pascal principle will be introduced. In Sect. 3, we give a preliminary upper bound on the quenched survival probability in dimensions 1 and 2, as well as an upper bound for a semi-annealed system. Finally, in Sect. 4, we prove the existence of the quenched Lyapunov exponent in Theorems 1.2 and 1.3 via a shape theorem, and we show that the quenched Lyapunov exponent is always positive.
126
A. Drewitz et al.
2 Annealed Survival Probability In this section, we prove Theorem 1.1. We start with a proof in Sect. 2.1 of the existence of the annealed Lyapunov exponent d;;;; . Our proof follows the same argument as for the catalytic model with < 0 in G¨artner and den Hollander [11], which is based on a special representation of E ŒZt; after integrating out the Poisson random field , which then allows us to apply the subadditivity lemma. In Sect. 2.2, we prove Theorem 1.1 for the special case D 0, i.e., X 0, relying on exact calculations. Sections 2.3 and 2.4 prove, respectively, the lower and upper bound on E ŒZt; in Theorem 1.1, for d D 1; 2 and general > 0. The lower bound is obtained by creating a space–time box void of traps and forcing X to stay inside the box, while the upper bound is based on the so-called Pascal principle, first introduced in the physics literature by Moreau et al. [19, 20]. In Sect. 2.4, we will also prove the aforementioned Corollary 2.1 on the range of a symmetric random walk.
2.1 Existence of the Annealed Lyapunov Exponent In this section, we prove the existence of the annealed Lyapunov exponent 1 log E ŒZt; : t !1 t
D d;;;; WD lim
(10)
Remark. Clearly, 0, and Theorem 1.1 will imply that always equals 0 in dimensions d D 1; 2. For d 3, the lower bound for the quenched survival probability in Theorem 1.2 will imply that < C < 1, while an exact calculation of for the case D 0 in Sect. 2.2 and the Pascal principle in Sect. 2.4 will imply that > 0 for all ; ; > 0; and 0. Proof of (10). The proof is similar to that for the catalytic model with < 0 in [11]. As in [11], we can integrate out the Poisson system to obtain 93 2 8 = < Zt 4 5 E ŒZt; D E Œu.t; 0/ D EX E .t s; X.s// ds exp 0 ; : D EX 0
h
0
n X oi exp .vX .t; y/ 1/ ;
(11)
y2Zd
where conditional on X , 93 8 = < Zt vX .t; y/ D EYy 4exp ı0 .Y .s/ X.t s// ds 5 ; : 2
0
(12)
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
127
with EYy Œ denoting expectation with respect to a simple symmetric random walk Y with jump rate and Y .0/ D y. By the Feynman–Kac formula, .vX .t; y//t 0;y2Zd solves the equation @ vX .t; y/ D vX .t; y/ ıX.t / .y/ vX .t; y/; @t
y 2 Zd ; t 0;
(13)
vX .0; / 1; which implies that ˙X .t/ WD
P
y2Zd .vX .t; y/
1/ is the solution of the equation
d ˙X .t/ D vX .t; X.t//; dt
(14)
˙X .0/ D 0: Hence, ˙X .t/ D
Rt
vX .s; X.s// ds, and the representation (11) becomes
0
2
8 <
4exp E ŒZt; D EX 0 :
Zt
93 = vX .s; X.s// ds 5: ;
(15)
0
We now observe that for t1 ; t2 > 0, 2
8 <
4exp E ŒZt1 Ct2 ; D EX 0 :
8 <
Zt1
9 =
8 93 tZ 1 Ct2 < = vX .s; X.s// ds exp vX .s; X.s// ds 5 ; : ;
0
9 =
t1
8 93 Zt1 Zt2 < = X 4 E0 exp vX .s; X.s// ds exp v t1 X .s; . t1 X/.s// ds 5 : ; : ; 2
0
D
0
E ŒZt1 ; E ŒZt2 ; ;
(16)
where t1 X WD .. t1 X /.s//s0 D .X.t1 Cs/X.t1 //s0 , we used the independence of .X.s//0st1 and .. t1 X /.s//0st2 , and the fact that for s > t1 , 93 8 = < Zs vX .s; X.s// D EYX.s/ 4exp ı0 .Y .r/ X.s r// dr 5 ; : 2
0
93 8 st1 Z = < ı0 .Y .r/ X.s r// dr 5 EYX.s/ 4exp ; : 2
0
D v t1 X .s t1 ; . t1 X /.s t1 //:
128
A. Drewitz et al.
From (16), we deduce that log E ŒZt; is subadditive in t, and hence the limit in (10) exists and 1 (17) d;;;; D sup log E ŒZt; : t >0 t t u
2.2 Special Case D 0 In this section, we prove Theorem 1.1 for the case D 0, which will be useful for lower bounding E ŒZt; for general > 0, as well as for providing an upper bound on E ŒZt; by the Pascal principle. Proof Theorem 1.1 for D 0. We first treat the case 2 .0; 1/. When D 0, (15) becomes 8 9 Zt < = (18) E ŒZt; D exp v0 .s; 0/ ds ; : ; 0
where v0 is the solution of (13) with X 0. It then suffices to analyze the asymptotics of v0 .t; 0/ as t ! 1. Note that the representation (12) for v0 .t; 0/ becomes 2 3 t v0 .t; 0/ D EY0 4e
R 0
ı0 .Y.s// ds
5;
(19)
which is the Laplace transform of the local time of Y at the origin. For d D 1; 2, v0 .t; 0/ # 0 as t " 1 by the recurrence of simple random walks, while for d 3, v0 .t; 0/ # Cd for some Cd > 0 by transience. By Duhamel’s principle (see e.g., [9, pp. 49] for a continuous-space version), we have the following integral representation for the solution vX of (13), Zt vX .t; y/ D 1
ps y X.t s/ vX t s; X.t s/ ds;
(20)
0
where ps ./ is the transition probability kernel of a rate 1 simple symmetric random walk on Zd . When X 0, we obtain Zt v0 .t; 0/ D 1
ps .0/v0 .t s; 0/ ds:
(21)
0
Denote the Laplace transforms (in t) of v0 .t; 0/ and pt .0/ by Z1 vO 0 ./ D
Z1 e
0
t
v0 .t; 0/ dt;
et pt .0/ dt:
p./ O D 0
(22)
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
129
Taking Laplace transform in (21) and solving for vO 0 ./ then gives vO 0 ./ D
1 : C p.=/ O
(23)
We can apply the local central limit theorem for continuous time simple random d=2 walks in d D 1 and 2 (i.e., pt .0/ D 2 d t .1 C o.1// as t ! 1) to obtain the following asymptotics for p./ O as # 0, 8 1 ˆ ˆ p .1 C o.1//; ˆ ˆ ˆ 2 ˆ < p./ O D ln 1 ˆ .1 C o.1//; ˆ ˆ ˆ ˆ ˆ : Gd .0/.1 C o.1//; with Gd .0/ D vO 0 ./ as # 0:
R1 0
d D 1; (24)
d D 2; d 3;
pt .0/ dt, which translates into the following asymptotics for 8 ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ <
vO 0 ./ D
ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ :
p
2 1 p .1 C o.1//; 1 .1 C o.1//; ln 1
1 .1 C o.1//; C Gd .0/
d D 1; d D 2;
(25)
d 3:
Since v0 .t; 0/ is monotonically decreasing in t by (19), by Karamata’s Tauberian theorem (see e.g. [10, Chap. XIII.5, Thm. 4]), we have the following asymptotics for v0 .t; 0/ as t ! 1, 8 r ˆ 1 2 1 ˆ ˆ p .1 C o.1//; ˆ ˆ ˆ t ˆ ˆ < 1 v0 .t; 0/ D .1 C o.1//; ˆ ˆ ln t ˆ ˆ ˆ ˆ ˆ ˆ .1 C o.1//; : C Gd .0/
d D 1; d D 2; d 3;
which by (18) implies Theorem 1.1 for D 0 and 2 .0; 1/. When D 0 and D 1, we have n X E ŒZt; D P .s; 0/ D 0 8 s 2 Œ0; t D exp y2Zd
o .t; y/ ;
(26)
130
A. Drewitz et al.
where .t; y/ D PyY .9 s 2 Œ0; t W Y .s/ D 0/ for a jump rate simple symmetric random walk Y starting from y. Note further that .t; y/ solves the parabolic equation @ .t; y/ D .t; y/; y ¤ 0; t 0; (27) @t P with boundary conditions .; 0/ 1 and .0; / 0. Therefore, y2Zd .t; y/ solves the equation d X dt d
.t; y/ D .t; 0/ D .1 .t; e1 // D .t; e1 /;
(28)
y2Z
where e1 D .1; 0; : : : ; 0/, .t; e1 / WD 1 .t; e1 /, and we have used the fact that P d x2Z .t; x/ D 0 and the symmetry of the simple symmetric random walk. Therefore, 8 9 Zt < = (29) E ŒZt; D exp .s; e1 / ds : : ; 0
By generating function calculations and Tauberian theorems (see e.g. [17, Sect. 2.4] or [23, Sect. 32, P3]), it is known that .t; e1 /, which is the probability that a rate 1 simple random walk starting from e1 does not hit 0 before time t, has the q asymptotics .t; e1 / D for d D 2, and .t; e1 / D
2 t .1 C o.1// for d Gd .0/1 .1 C o.1// for
D 1, .t; e1 / D
C o.1//
d 3. Therefore, as t ! 1,
r 8 8t ˆ ˆ ˆ .1 C o.1//; ˆ ˆ ˆ ˆ < t log E ŒZt; D .1 C o.1//; ˆ ln t ˆ ˆ ˆ ˆ t ˆ ˆ : .1 C o.1//; Gd .0/ which proves Theorem 1.1 for D 0 and D 1.
ln t .1
d D 1; d D 2;
(30)
d 3; t u
Remark. When D 0 so that X 0, the representation (18) allows us to Rt easily compute the Laplace transform of Dt WD 1t 0 .s; 0/ ds, since E ŒZt; D E Œexpf p tDt g. By replacing t with a suitable scale t=at , where 2 R, at D t for d D 1, at D log t for d D 2, and at D 1 for d 3, we can identify
t at E exp Dt ‰./ WD lim t !1 t at using the asymptotics in (26). As shown in Cox and Griffeath [6], applying the G¨artner–Ellis theorem then leads to a large deviation principle for Dt with scale
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
131
t=at , except that in [6], the derivation of ‰./ was by Taylor expansion in , which can be greatly simplified if we use the representation from (18) instead.
2.3 Lower Bound on the Annealed Survival Probability
In this section, we prove the lower bound on E ŒZt; in Theorem 1.1 for dimensions d D 1 and 2, i.e., Lemma 2.1. For all 2 .0; 1, 0, > 0, and > 0, we have 1 lim inf p log E ŒZt; t !1 t
r
8 ;
ln t log E ŒZt; ; lim inf t !1 t
d D 1; (31) d D 2:
Proof. The basic strategy is the same as for the case of immobile traps, namely, we force the environment to create a ball BRt of radius Rt around the origin, which remains void of traps up to time t, and we force the random walk X to stay inside BRt up to time t. This leads to a lower bound on the survival probability that is independent of 2 .0; 1 and 0. Surprisingly, in dimensions d D 1 and 2, this lower bound turns out to be sharp, which can be attributed to the larger fluctuation of the random field in d D 1 and 2, which makes it easier to create space–time regions void of traps. Note that it is clearly more costly to maintain the same space– time region void of traps than in the case when the traps are immobile. Recall that is the counting field of a family of independent random walks y fYj gy2Zd ;1j Ny , where fNy gy2Zd are i.i.d. Poisson random variables with mean . Let Br denote the ballpof radius r, i.e., Br D fx 2 Zd W kxk1 rg. For a scale function 1 << Rt << t to be chosen later, let Et denote the event that Ny D 0 for y all y 2 BRt . Let Ft denote the event that Yj .s/ … BRt for all y … BRt ; 1 j Ny ; and s 2 Œ0; tI furthermore, let Gt denote the event that X with X.0/ D 0 does not leave BRt before time t. Then by (3),
E ŒZt; P .Et \ Ft \ Gt / D P .Et /P .Ft /P .Gt /:
(32)
d
Note that P .Et / D e.2Rt C1/ p . To estimate P .Gt /, note that by Donsker’s invariance principle if 1 << Rt << t as t ! 1, then there exists ˛ > 0 such that for all t sufficiently large, ˇ p 8 s 2 Œ0; t ; X.t/ 2 Bp ˇˇX.0/ D x ˛: P X.s/ 2 B inf (33) t t =2 p x2B
t=2
By partitioning Œ0; t into intervals of length Rt2 and applying the Markov property, we obtain
132
A. Drewitz et al.
P .Gt / P X.s/ 2 BRt 8 s 2 Œ.i 1/Rt2 ; iRt2 ; and X.iRt2/ 2 BRt =2 ; i D 1; 2; ; dt=Rt2 e 2
2
˛ t =Rt D et ln ˛=Rt :
(34) y
To estimate P .Ft /, let FQt denote the event that Yj .s/ ¤ 0 for all y 2 Zd , 1 j Ny , and s 2 Œ0; t. Note that P .FQt / is precisely the annealed survival probability E ŒZt; when D 0 and D 1, which satisfies the asymptotics in Theorem 1.1 by our calculations in Sect. 2.2. We next compare P .Ft / with P .FQt /. For a jump rate simple random walk Y starting from y 2 Zd , let BRt denote the stopping time when Y first enters BRt , and 0 the stopping time when Y first visits 0. Then standard computations yield X PyY .BRt t/; (35) ln P .Ft / D y2Zd nBRt
and a similar identity holds for ln P .FQt / with BRt replaced by B0 . Note that X
PyY .BRt t/
y2Zd nBRt
X
PyY .0 t/ D
y2Zd nBRt
Hence, ln P .Ft / ln P .FQt / C
X
PyY .0 t/
PyY .0 t/:
y2BRt
y2Zd
X
X
PyY .0 t/ ln P .FQt / C .2Rt C 1/d :
(36)
y2BRt
On the other hand, for > 0, we have X X PyY .0 t C t/ y2Zd
PyY BRt t; 0 t C t
y2Zd nBRt
inf PzY .0 t/ z2@BRt
X
PyY BRt t/;
y2Zd nBRt
where we used the strong Markov property. Therefore, X
P PyY .BRt
t/
y2Zd nBRt
y2Zd
PyY .0 t C t/
infz2@BRt PzY .0 t/
;
and hence by (35), ln P .Ft /
ln P .FQt Ct / : infz2@BRt PzY .0 t/
(37)
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
133
p We now choose Rt for d D 1 and 2. For d D 1, let Rt D t= ln t, which is by no means the unique scale appropriate. Clearly, infz2@Bpt = ln t PzY .0 t/ ! 1 as t ! 1. By (36) and (37), the fact that P .FQt / satisfies the asymptotics in Theorem 1.1 for D 0 and D 1, and that > 0 can be made arbitrarily small, we obtain r ln P .Ft / D Furthermore, for Rt D
8t .1 C o.1// D ln P .FQt /:
p t= ln t we have
p ln P .Et / D .2 t= ln t C 1/
and
ln P .Gt / ln ˛ ln t;
whence substituting these asymptotics into (32) gives (31) for d D 1. For d D 2, let Rt D ln t. Then we have infz2@Bln t PzY .0 t/ ! 1 as t ! 1, which is an easy consequence of [17, Exercise 1.6.8]. By the same argument as for d D 1, we have ln P .Ft / D
t .1 C o.1// D ln P .FQt /: ln t
Together with the asymptotics ln P .Et / D .2 ln t C 1/2
and
ln P .Gt /
t ln ˛ ; ln2 t
we deduce from (32) the desired bound in (31) for d D 2.
t u
2.4 Upper Bound on the Annealed Survival Probability: The Pascal Principle In this section, we present an upper bound on the annealed survival probability, called the Pascal principle. Proposition 2.1 [Pascal principle]. Let be the random field generated by a y collection of irreducible symmetric random walks fYj gy2Zd ;1j Ny on Zd with jump rate > 0. Then for all piecewise constant X W Œ0; t ! Zd with a finite number of discontinuities, we have 93 93 8 8 2 = = < Zt < Zt E 4exp .s; X.s// ds 5 E 4exp .s; 0/ ds 5: ; ; : : 2
0
0
(38)
134
A. Drewitz et al.
In words, conditional on the random walk X , the annealed survival probability is maximized when X 0. The discrete time version of this result was first proved by Moreau et al. in [19, 20], where they named it the Pascal principle, because Pascal once asserted that all misfortune of men comes from the fact that he does not stay peacefully in his room. The Pascal principle together with the proof of Theorem 1.1 for D 0 in Sect. 2.2 implies the desired upper bound on the annealed survival probability in Theorem 1.1 for dimensions d D 1; 2, and it also shows that for d 3, the annealed Lyapunov exponent d;;;; is always bounded from below by d;;0;; D =.1 C Gd .0/ /. We present below the proof of the discrete time version of the Pascal principle from [20], which being written as a physics paper, can be hard for the reader to separate the rigorous arguments from the non-rigorous ones. We then deduce the continuous time version, Proposition 2.1, by discrete approximation. As a byproduct, we will show in Corollary 2.1 that the expected cardinality of the range of a continuous time symmetric random walk increases under perturbation by a deterministic path. Moreau et al. considered in [20] a discrete time random walk among a Poisson field of moving traps, defined as follows. Let XN be a discrete time mean zero random walk on Zd with XN 0 D 0. Let fNy gy2Zd be i.i.d. Poisson random variables with y mean , and let fYNj gy2Zd ;1j Ny be a family of independent symmetric random y walks on Zd , where YNj denotes the j th random walk starting from y at time 0. Let N x/ WD .n;
X
y
ıx .YNj .n//:
(39)
y2Zd ;1j Ny
Fix 0 q 1, which will be the trapping probability. The dynamics of XN is such y that XN moves independently of the traps fYNj gy2Zd ;1j Ny , and at each time n 0, N N XN is killed with probability 1 .1 q/.n;X .n//. Namely, each trap at the time–space lattice site .n; XN .n// tries independently to capture XN with probability q. Given a realization of XN , let N XN .n/ denote the probability that XN has survived till time n. Then analogous to (11), we have h i n o Pn X N N N N N N X .n/ D E .1 q/ i D0 .i;X.i // D exp wN q;X .n; y/ ;
(40)
y2Zd y where if we let YN denote a random walk with the same jump kernel as YNj , then
h i Pn N N N /g : wN q;X .n; y/ WD 1 EYy .1 q/ i D0 1fYN .i /DX.i
(41)
The main result we need from Moreau et al. [20] is the following discrete time Pascal principle.
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
135
Lemma 2.2. [Pascal principle in discrete time [20]]. Let YN be an irreducible N symmetric random walk on Zd with P0Y .YN .1/ D 0/ 1=2. Then for all q 2 Œ0; 1, d n 2 N0 and XN W N0 ! Z , we have X
X
N
wN q;X .n; y/
y2Zd
wN q;0 .n; y/;
(42)
y2Zd
and hence N XN .n/ N 0 .n/, where wN q;0 and N 0 denote wN q;XN and N XN with XN 0. Proof. The argument we present here is extracted from [20]. First note that the assumption YN is symmetric implies that the Fourier transform f .k/ WD EY0N Œei hk;YN .1/i is real for all k 2 Œ ; d . The assumption P0YN .YN .1/ D 0/ 1=2 guarantees that f .k/ 2 Œ0; 1. If we let pnYN .y/ denote the n-step transition probability kernel of YN , then by Fourier inversion, we have N
N
pnY .0/ pnY .y/; N pnY .0/
YN pnC1 .0/
for all n 0; y 2 Zd :
(43)
If we now regard XN as a trap, then wN q;XN .n; y/ can be interpreted as the probability that a random walk YN starting from y gets trapped by XN by time n, where each time YN and XN coincide, YN is trapped by XN with probability q. More precisely, let Zi , i 2 N0 , be i.i.d. Bernoulli random variables with mean q, where Zi D 1 means that N // is open. Then XN is killed at the stopping time the trap at .i; X.i XN .YN / WD minfi 0 W YN .i / D XN .i /; Zi D 1g;
(44)
and wN q;XN .n; y/ D PyYN .XN n/. We examine the following auxiliary quantity, where by decomposition with respect to XN , we have qD
X
N PyY YN .n/ D XN .n/; Zn D 1
y2Zd
D
n1 X X
N YN PyY .XN D k/pnk .XN .n/ XN .k// q C
kD0 y2Zd
q
n1 X X kD0 y2Zd
X
N
PyY .XN D n/
(45)
y2Zd N
N
Y PyY .XN D k/pnk .0/ C
X
N
PyY .XN D n/;
y2Zd
where in the inequality we used (43). Similarly, when XN is replaced by XN 0, we have
136
A. Drewitz et al.
qD
X
N PyY YN .n/ D 0; Zn D 1
y2Zd
Dq
n1 X X
N
N
Y PyY .0 D k/pnk .0/ C
kD0 y2Zd
Denote
N
SnX WD
X
N
PyY .XN n/;
wN q;0 .n; y/ D
X
(47)
N
PyY .0 n/:
y2Zd
P
0 k/ D Sk0 Sk1 , where we set gives
q
(46)
y2Zd
y2Zd
n1 X
X
N
wN q;X .n; y/ D
X
Note that S0XN D S00 D q, and
N
PyY .0 D n/:
y2Zd
y2Zd
Sn0 WD
X
P YN XN XN y2Zd Py .XN D k/ D Sk Sk1 , y2Zd 0 XN S1 D S1 D 0. Together with (45) and
0 0 YN pnk .0/.Sk0 Sk1 / C Sn0 Sn1
q
kD0
n1 X
N
N
N
PyYN .0 D (46), this
N
N
Y X X pnk .0/.SkX Sk1 / C SnX Sn1 :
kD0
Rearranging terms, we obtain n2 X XN N N N 0 YN YN SnX Sn0 1 qp1Y .0/ .Sn1 pnk1 Sn1 /Cq .0/ pnk .0/ .SkX Sk0 /: kD0
(48) This sets up an induction bound for SnXN Sn0 . Since S0XN S00 D 0, 1 qp1YN .0/ 0, N and pkY .0/ is decreasing in k by (43), it follows that SnXN Sn0 for all n 2 N0 , which is precisely (42). t u Proof of Proposition 2.1. Integrating out on both sides of (38) as in (11) shows that (38) is equivalent to X
w;X .t; y/
y2Zd
w;0 .t; y/;
(49)
3 o ı0 .Y .s/ X.s// ds 5:
(50)
y2Zd
2
where
X
n
w;X .t; y/ WD 1 EYy 4exp
Zt 0
and X .k/ D X. nt / for k 2 N0 . Clearly, Y .n/ is For n 2 N, let Y .k/ D .n/ symmetric, and for n sufficiently large, P0Y .Y .n/ .1/ D 0/ 1=2. Therefore, we can apply Lemma 2.2 with YN D Y .n/ , XN D X .n/ , and q D q .n/ D t=n to obtain .n/
Y . knt /
.n/
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
X
.n/
wN t =n;X .n; y/
y2Zd
X
wN t =n;0 .n; y/:
137
(51)
y2Zd
By (41) and the definition of Y .n/ and X .n/ , we have .n/
Pn
t kD0 1fY .n/ .k/DX .n/ .k/g 1 n Pn
t kD0 1fY .k t =n/DX.k t =n/g : D 1 EYy 1 n
w N t =n;X .n; y/ D 1 EYy
.n/
By the assumption that X is a random walk path which is necessarily piecewise constant with a finite number of discontinuities, for a.s. all realization of Y , we have 8 9 Pn Zt < = 1 fY .k t =n/DX.k t =n/g t kD0 lim 1 D exp ı0 .Y .s/ X.s// ds : n!1 : ; n 0
.n/
Therefore by the bounded convergence theorem, limn!1 wN t =n;X .n; y/Dw;X .t; y/. By the same argument, limn!1 wN t =n;0 .n; y/ D w;0 .t; y/. Next we note .n/ that w t =n;X .n; y/ is the probability that Y .n/ is trapped by X .n/ before time n. .n/ Since Y .n/ and X .n/ are embedded in Y and X , we have w t =n;X .n; y/ PyY .X t/ uniformly in n, where X D inffs 0 W Y .s/ D X.s/g. Clearly, P PyY .X t/ < 1. Similarly w t =n;0 .n; y/ PyY .0 t/ uniformly in y2ZdP n and y2Zd PyY .0 t/ < 1. Therefore, we can send n ! 1 and apply the dominated convergence theorem in (51), from which (49) then follows. t u The Pascal principle in Lemma 2.2 and Proposition 2.1 have the following interesting consequence for the range of a symmetric random walk, which we denote by Rt .X / D fy 2 Zd W X.s/ D y for some 0 s tg. Corollary 2.1 [Increase of expected cardinality of range under perturbation]. Let YN and XN be discrete time random walks as in Lemma 2.2. Let Y be a continuous time irreducible symmetric random walk on Zd with jump rate > 0, and let X W Œ0; t ! Zd be piecewise constant with a finite number of discontinuities. Then for all n 2 N0 , respectively t 0, we have N N EY0 jRn .YN XN /j EY0 jRn .Y /j ; EY0 jRt .Y X /j EY0 jRt .Y /j ;
(52)
where j j denotes the cardinality of the set. Proof. The first inequality in (2.1) for discrete time random walks follows from the observation that
138
X y2Zd
A. Drewitz et al. N
PyY .XN n/ D
X
N P0Y YN .i / XN .i / D y for some 0 i n
y2Zd
N N ; D EY0 jRn .YN X/j X N X N N PyY .0 n/ D P0Y YN .i / D y for some 0 i n D EY0 jRn .YN /j ; y2Zd
y2Zd
(53) where XN D minfi 0 W YNi D XN i g and 0 D minfi 0 W YNi D 0g, which combined with Lemma 2.2 for q D 1 gives precisely X
N
PyY .XN n/
y2Zd
X
N
PyY .0 n/:
(54)
y2Zd
The continuous time case follows by similar considerations, where we apply Proposition 2.1 with D 1, or rather > 0 with " 1. t u
3 Quenched and Semi-Annealed Upper Bounds In this section, we prove sub-exponential upper bounds on the quenched survival probability in dimensions 1 and 2 (the exponential upper bound in dimensions 3 and higher follows trivially from the annealed upper bound by Jensen’s inequality and Borel–Cantelli). Although they will be superseded later by a proof of exponential decay using sophisticated results of Kesten and Sidoravicius [16], the proof we present here is relatively simple and self-contained. Along the way, we will also prove an upper bound (Proposition 3.2) on the annealed survival probability of a random walk in a random field of traps with deterministic initial condition, which we call a semi-annealed bound.
Proposition 3.1 [Sub-exponential upper bound on Zt; ]. There exist constants C1 ; C2 > 0 depending on ; ; ; > 0 such that a.s. with respect to , we have log t log Zt; C1 ; t
d D 1;
log log t lim sup log Zt; C2 ; t t !1
d D 2:
lim sup t !1
(55)
The same bounds hold if we replace Zt; by u.t; 0/ as in Theorem 1.3. Proof. The proof is based on coarse graining combined with the annealed bound in Theorem 1.1. Let us focus on dimension d D 1 first. Let X be a random walk as in (2), and let M.t/ WD sup0st jX.s/j1 . The first step is to note that by basic large deviation estimates for X ,
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
EX 0
h
Zt
n exp
139
i o .s; X.s// ds 1fMt t g P0X .Mt t/ eC t
0
for some C > 0 depending only on . Therefore to show (55), it suffices to prove that Zt o h n i Ct X E0 exp .s; X.s// ds 1fMt
for some C > 0 for all t sufficiently large. Since the integrand in the definition of Zt; is monotone in t; we may even restrict our attention to t 2 N. The second step is to introduce a coarse graining scale Lt WD A log t for some A > 0, and partition the space–time region Œ2t; 2t Œ0; t into blocks of the form i;k WD Œ.i 1/Lt ; iLt / Œ.k 1/L2t ; kL2t / for i; k 2 Z with L2tt C 1 i L2tt and 1 k Lt2 . We say a block t
X
i;k is good if
.i 1/Lt x
..k 1/L2t ; x/
Lt : 2
Since for each s 0, ..s; x//x2Z are i.i.d. Poisson distributed with mean , by basic large deviation estimates for Poisson random variables, there exists C > 0 such that for all t > 1, P .i;k is bad/ eC Lt : Let Gt ./ be the event that all the blocks i;k in Œ2t; 2t Œ0; t are good. Then P .Gtc .//
4t 2 C Lt 4 e D 3 ; 3 3 t C A2 A .log t/ Lt
which is summable in t 2, t 2 N if A is chosen sufficiently large. Therefore by Borel–Cantelli, a.s. with respect to , for all t 2 N sufficiently large, the event Gt ./ occurs. To prove (55), it then suffices to prove 1Gt ./ EX 0
h
Zt
n exp
i o Ct .s; X.s// ds 1fMt
(57)
0
almost surely for all t 2 N sufficiently large. The third step is applying an annealing bound. More precisely, to show (57), it suffices to average over and show that E
EX 0
h
n
Zt
exp 0
i o 2C t .s; X.s// ds 1fMt
(58)
140
A. Drewitz et al.
for some C > 0 for all t 2 N sufficiently large. Indeed, (58) implies that Zt h n i o Ct Ct X P 1Gt ./ E0 exp .s; X.s// ds 1fMt
e log t e log t ;
0
from which (57) then follows by Borel–Cantelli. ˚ R kL2t To prove (58), let us denote Zk WD exp .k1/L 2 .s; X.s// ds , and let t
F k be the -field generated by .Xs ; .s; //0skL2t . Replacing L2t by t=bt=L2t c if necessary, we may assume without loss of generality that t=L2t D t=.A log t/2 2 N. Then E
EX 0
h
Zt
n
i
o
.s; X.s// ds 1fMt
exp
EX 0
h 1fMt
DE
EX 0
Y
Zk
kD1
0
i
t =L2t
h
t =L2t
Y
1fMt
kD1
t =L2t i Y Zk E EX 0 ŒZk jFk1 : X E E0 ŒZk jFk1 kD1
(59)
By Proposition 3.2 below, on the event jX..k 1/L2t /j1 < t and i;k is good for all L2tt C 1 i L2tt , which is an event in Fk1 , we have
E
EX 0 ŒZk jFk1
DE
EX 0
h
ZkLt
2
n
oˇ i ˇ .s; X.s// ds ˇFk1 eCLt (60)
exp .k1/L2t
for some C > 0 depending on ; ; ; . Substituting this bound into (59) for 1 Qt =L2 Zk is a martingale then gives the k t=L2t and using the fact that kD1t E EX ŒZ jF 0
k
k1
desired bound eC t =Lt D eC t =.A log t / for (58). For dimension d D 2, the proof is similar. We choose Lt D A log t with A sufficiently large. We partition the space–time region Œ2t; 2t2 Œ0; t into blocks of the form i;j;k WD Œ.i 1/Lt ; iLt / Œ.j 1/Lt ; jLt / Œ.k 1/L2t ; kL2t /, and we define good blocks and bad blocks as before. Applying Proposition 3.2 below ˚ L2 Ct then gives an upper bound of exp C Lt2 log tLt D expf log AClog log t g, analogous t to (58). Finally, we note that the arguments also apply to the solution of the parabolic Anderson model u.t; 0/ D
EX 0
h
n
Zt
exp
oi .t s; X.s// ds
0
:
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
141
The only difference lies in passing the result (55) from t 2 N to t 2 R, due to the lack of monotonicity of u.t; 0/ in t. This can be easily overcome by the observation that for n 1 < t < n with n 2 N, u.n; 0/ e
.nt /
e
Rn t
.r;0/ dr
u.t; 0/;
p R i C1 and the fact that almost surely i .r; 0/ dr i for all i large by Borel–Cantelli R1 t u because 0 .r; 0/ dr has finite exponential moments. The following is a partial analogue of Theorem 1.1 for with deterministic initial conditions. Proposition 3.2 [Semi-annealed upper bound]. Let be defined as in (1) with deterministic initial condition ..0; x//x2Zd . For L > 0 and Ei D .i1 ; : : : ; id / 2 Zd , let BL;Ei WD Œ.i1 1/L; i1 L/ Œ.id 1/L; id L/. Assume that there exist a > 2 P and > 0 such that for all Ei 2 Œ3La ; 3La d , x2B .0; x/ Ld . Then there L;Ei
exist constants Cd > 0, d 1, such that for all L sufficiently large and for all x 2 Zd with jxj1 L, we have h
Z
L2
n
E EX x exp
8 ˆ ˆ ˆ <
oi .s; X.s// ds
0
The same is true if we replace
R L2 0
e ˆ ˆ ˆ :
eC1 L ;
d D 1;
2
L C2 log L
;
d D 2;
eCd L ;
d 3:
.s; X.s// ds by
2
R L2 0
(61)
.s; X.L2 s// ds.
Proof. The basic strategy is to dominate ..L2 =2; x//jxj1 <2La from below by i.i.d. Poisson random variables, which then allows us to apply Theorem 1.1. We proceed as follows. y Let be generated by independent random walks .Yj /y2Zd ;1j .0;y/ as in (1), and let N be generated by a separate system of independent random walks y N y//y2Zd are i.i.d. Poisson distributed with mean .YNj /y2Zd ;1j .0;y/ , where ..0; N . N Choose any N 2 .0; /. Then by large deviation estimates for Poisson random variables, X X N N N x/ (62) P .GLc / WD P .0; x/ for some Ei 2 Œ3La ; 3La d .0; x2BL;Ei
X
Ei 2Œ3La ;3La d
x2BL;Ei
X N
P
N x/ Ld 6d Lad eC;N Ld : .0;
x2BL;Ei y
On the event GL , we will construct a coupling between .Yj /y2Zd ;1j .0;y/ and y y N y/ and .YNj /y2Zd ;1j .0;y/ as follows. For each walk YNj with 1 j .0; N
142
A. Drewitz et al.
y y 2 BL;Ei for some Ei 2 Œ3La ; 3La d , we can match YNj with a distinct walk Ykz for some z 2 BL;Ei and 1 k .0; z/, which is possible on the event GL . y Independently for each pair of walks .YNj ; Ykz /, we will couple their coordinates as follows: For 1 i d; the i th coordinates of the two walks evolve independently until the first time that their difference is of even parity. Note that this is the case either at time 0 already or at the first time when one of the coordinates changes. From then on, the i th coordinates are coupled in such a way that they always jump at the same time and their jumps are always opposites until the first time when the two coordinates coincide. From that time onward, the two coordinates always perform the same jumps at the same time. For walks in the and N system which have not been paired up, we let them evolve independently. Note that such N and each coupled pair .YN y ; Y z / is a coupling preserves the law of (resp. ), j k y successfully coupled in the sense that YNj .L2 =2/ D Ykz .L2 =2/ if the trajectory of y YNj is in the event
n
y
Ej WD
y
y
sup .YNj .t/ YNj .0//i 2 ŒL=2; L and
0t L2 =2
inf
0t L2 =2
o 81i d ;
y y .YNj .t/ YNj .0//i 2 ŒL; L=2
y because jy zj1 L by our choice of pairing of YNj and Ykz . Then by our coupling of N and , on the event GL , we have X .L2 =2; x/ .x/ WD 1Ejy 1fYNjy .L2 =2/Dxg for all jxj1 2La : (63) y2Zd ; 1j N.0;y/
N x//x2Zd are i.i.d. Poisson with mean , N and Now observe that because ..0; y N .Yj /y2Zd ;1j .0;y/ are independent, ..x//x2Zd are also i.i.d. Poisson distributed N N
N
y
with mean ˛ WD P N .Ej / D P N .E10 /, which is bounded away from 0 uniformly in L by the properties of simple symmetric random walks. This achieves the desired stochastic domination of at time L2 =2. Let L .t; / denote the counting field of independent random walks as in (1) with initial condition L .0; y/ D .y/1fjyj1 2La g . Then using (63), uniformly in x 2 Zd with jxj1 L, we have "
(
exp E EX x
"
)#
ZL2
;N
(
exp D E EX x
.s; X.s// ds
0 N
P .GLc / C PxX .jX.L2 =2/j1 > L2 / C
sup EL EX exp x
jxj1 L2
.s; X.s// ds 0
"
(
2 L Z =2
L .s; X.s// ds
0
)#
ZL2
)#
Survival Probability of a Random Walk Among a Poisson System of Moving Traps d
143
2
6d Lad eC;N L C eCL " C
sup E
L
jxj1 L2
EX x
(
L .s; X.s// ds
exp
)#
2 L Z =2
:
(64)
0
By the same argument as for (11), we have "
(
EL EX x exp
"
)#
2 L Z =2
(
D EX x exp ˛
L .s; X.s// ds
X
jyj1
0
)# .1vX .L2 =2; y//
;
2La
(65)
where
"
(
vX .L2 =2; y/ D EYy exp
)#
2 L Z =2
ı0 .Y .s/ X.s// ds
:
0
To bound (65), note that by a union bound in combination with Azuma’s inequality we obtain, 2 sup PxX sup jX.s/j1 > 2L2 eCL : (66) jxj1 L2
0sL2 =2
On the complementary event fsup0sL2 =2 jX.s/j1 2L2 g, we have 1 vX .L2 =2; y/ PyY .2L2 L2 =2/ P .PL2 =2 jyj1 2L2 /; where 2L2 WD inffs 0 W jY .s/j1 2L2 g, and PL2 =2 is a Poisson random variable with mean L2 =2, which counts the number of jumps of Y before time L2 =2. Therefore for L sufficiently large, X
.1 vX .L2 =2; y//
jyj1 >2La
C
X
P .PL2 =2 jyj1 2L2 /
jyj1 >2La 1 X
P .PL2 =2 r=2/ r d 1 C EŒPLk 2 =2
rD2La
C.L2 =2/k .2La /d k CL.a2/kCad 1;
1 X
r d k1
rD2La
(67)
where we have changed the values of the constant C (independent of L) from line to line, and the last inequality holds for all L large if we choose k large enough. Substituting the bounds (66) and (67) into (65) then gives the following bound uniformly for x 2 Zd with jxj1 L2 :
144
A. Drewitz et al.
" E
L
EX x
( exp
L .s; X.s// ds 0
X
Px
)#
2 L Z =2
sup 0sL2 =2 2
h n oi X jX.s/j1 > 2L2 C EX .1 vX .L2 =2; y//C1 x exp ˛ h
n
eCL C eEX x exp ˛
X
y2Zd
oi .1 vX .L2 =2; y// ;
y2Zd
where by the representation (11), the expectation is precisely the annealed survival probability of a random walk among a Poisson field of traps with density ˛, for which the bounds in (4) apply with replaced by ˛ and t by L2 =2. Substituting this bound back into (64) then gives (61). The same proof applies when we reverse the time direction of X in (61). t u
4 Existence and Positivity of the Quenched Lyapunov Exponent In this section, we prove Theorems 1.2 and 1.3. In Sect. 4.1, we state a shape theorem which implies the existence of the quenched Lyapunov exponent for the quenched survival probability Zt; . In Sect. 4.2, we prove the stated shape theorem for bounded ergodic random fields. In Sect. 4.3, we show how to deduce the existence of the quenched Lyapunov exponent for the solution of the parabolic Anderson model from what we already know for the quenched survival probability. Finally in Sect. 4.4, we prove the positivity of the quenched Lyapunov exponent, which concludes the proof of Theorems 1.2 and 1.3.
4.1 Shape Theorem and the Quenched Lyapunov Exponent
In this section, we focus exclusively on the quenched survival probability Zt; . The approach we adopt in proving the existence of the quenched Lyapunov exponent for Zt; uses the subadditive ergodic theorem and follows ideas used by Varadhan in [25] to prove the quenched large deviation principle for random walks in random environments. X For s 0 and x 2 Zd , let Px;s and EX x;s denote, respectively, probability and expectation for a jump rate simple symmetric random walk X , starting from x at time s. For each 0 s < t and x; y 2 Zd , define 2
8 <
4 e.s; t; x; y; / WD EX x;s exp :
Zt s
9 =
3
.u; X.u// du 1fX.t /Dyg 5; ;
a.s; t; x; y; / WD log e.s; t; x; y; /:
(68)
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
145
We call a.s; t; x; y; / the point-to-point passage function from x to y between times s and t. We will prove the following shape theorem for a.0; t; 0; y; /. Theorem 4.1 [Shape theorem]. There exists a deterministic convex function ˛ W Rd ! R, which we call the shape function, such that P -a.s., for any compact K Rd , lim sup jt 1 a.0; t; 0; y; / ˛.y=t/j D 0: (69) t !1
y2tK\Zd
Furthermore, for any M > 0, we can find a compact K Rd such that 2 lim sup t !1
8 <
1 4exp log EX 0 : t
Zt
9 =
3
.s; X.s// ds 1fX.t /…tKg5 M: ;
(70)
0
Remark. Note that (5) in Theorem 1.2 follows easily from Theorem 4.1, which we leave to the reader as an exercise. In particular, the quenched Lyapunov exponent satisfies Q d;;;; D inf ˛.y/ D ˛.0/ D lim t 1 a.0; t; 0; 0; /; (71) y2Rd
t !1
where infy2Rd ˛.y/ D ˛.0/ follows from the convexity and symmetry of ˛ since is symmetric. The unboundedness of the random field creates complications for the proof of Theorem 4.1. Therefore, we first replace by N WD .maxf.s; x/; N g/s0;x2Zd for some large N > 0 and prove a corresponding shape theorem, then use almost sure properties of established by Kesten and Sidoravicius in [15] to control the error caused by the truncation. Theorem 4.2 [Shape theorem for bounded ergodic potentials]. Let WD ..s; x//s0;x2Zd be a real-valued random field, which is ergodic with respect to the shift map r;z WD ..s C r; x C z//s0;x2Zd , for all r 0 and z 2 Zd . Assume further that j.0; 0/j A a.s. for some A > 0. Then the conclusions of Theorem 4.1 hold with replaced by . Remark. Note that Theorem 4.2 can be applied to the occupation field of the exclusion process or the voter model in an ergodic equilibrium, which in particular implies the existence of the corresponding quenched Lyapunov exponents. Before we prove Theorem 4.2 in the next section, let us first show how to deduce Theorem 4.1 from Theorem 4.2, using almost sure bounds on from [15]. Proof of Theorem 4.1. Note that since is non-negative, (70) follows from elementary large deviation estimates for the random walk X , if we take K to be a large enough closed ball centered at the origin, which we fix for the rest of the proof.
146
A. Drewitz et al.
By applying Theorem 4.2 to the truncated random field N , we have that for each N > 0, there exists a convex shape function ˛N W Rd ! R such that (69) holds with replaced by N and ˛ replaced by ˛N . Note that ˛N is monotonically increasing in N , and its limit ˛ is necessarily convex. To prove (69), it then suffices to show that, for any > 0, we can choose N sufficiently large such that P -a.s., 1 sup ja.0; t; 0; y; / a.0; t; 0; y; N /j t y2tK\Zd
for all t sufficiently large:
(72) To prove (72), we will need Lemma 15 from [15], which by Borel–Cantelli implies that there exist positive constants C0 ; C1 ; C2 ; C3 ; C4 with C0 > 1, such that if „l denotes the space of all possible random walk trajectories W Œ0; t ! Zd , which contain exactly l jumps and are contained in the rectangle ŒC1 t log t; C1 t log td , then P -a.s., for all t 2 N sufficiently large, we have Zt .s; .s//1f .s; .s//C2 C d m g ds .t C l/
sup 2„l
0
1 X
r.d C6/Cd C4 C0r=4
C3 C0
e
rDm
0
8 m 2 N; l 0;
(73)
P r.d C6/Cd C4 C r=4 0 where Am WD 1 e ! 0 as m ! 1. rDm C3 C0 One important consequence of (73) is that 0 < sup ˛.y/ < 1:
(74)
y2K
Indeed, if lt .X / denotes the number of jumps of X on the time interval Œ0; t, then 9 8 3 = < Zt 4exp .s; X.s// ds 1fX.t /Dyg 5 sup ˛.y/ lim t 1 log inf EX 0 t !1 ; : y2tK\Zd y2K 2
0
8 9 < Zt = 4 lim t 1 log inf EX exp .s; X.s// ds 0 t !1 : ; y2tK\Zd 2
0
3
1fX.t /Dy;lt .X /2D.K/t;X 2„lt .X / g 5; where D.K/ WD supy2K jyj1 . We can then apply (73) and large deviation estimates for random walks to the above bound to deduce supy2K ˛.y/ < 1. The fact that supy2K ˛.y/ > 0 for a large ball K again follows from basic large deviation estimates.
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
147
By large deviation estimates, we can find B large enough such that P0X .lt .X / Bt or X … „lt .X / / e2 supy2K ˛.y/ t
for all t sufficiently large: (75) Let N D C2 C0d m . Then by (73), P -a.s., uniformly in y 2 Zd and for all t large, we have 9 8 2 = < Zt 4exp N .s; X.s// ds e.0; t; 0; y; / e.1CB/Am t EX 0 ; : 0
3
1fX.t /Dy;lt .X /Bt;X 2„lt .X / g 5 e.1CB/Am t .e.0; t; 0; y; N / e2 supy2K ˛.y/ t /;
(76)
where in the last inequality we applied (75). Since t 1 log e.t; 0; y; N / ! ˛N .y=t/ uniformly for y 2 tK \ Zd by Theorem 4.2, and supy2K ˛N .y/ supy2K ˛.y/, (76) implies that P -a.s., uniformly in y 2 tK \ Zd and for all t large, we have t 1 a.0; t; 0; y; / t 1 a.0; t; 0; y; N / C .1 C B/Am C o.1/: Since a.0; t; 0; y; / a.0; t; 0; y; N /, and Am can be made arbitrarily small by choosing m sufficiently large, (72) then follows. u t Remark. Theorem 4.1 in fact holds for the catalytic case as well, where we take < 0 in (68) and (70). This implies the existence of the quenched Lyapunov exponent in Theorem 1.2 for the catalytic case, where we set < 0 in the definition of Zt; . Indeed, Theorem 4.2 still applies to the truncated field N . To control the error caused by the truncation, the following modifications are needed in the proof of Theorem 4.1. To prove (70), we need to apply (73). More precisely, we need to first consider trajectories .Xx /0st , which are not contained in ŒC1 t log t; C1 t log td . The contribution from these trajectories can be shown to decay super-exponentially in t by large deviation estimates and a bound on given in (2.37) of [15, Lemma 4]. For X which lies inside ŒC1 t log t; C1 t log td , we can then use (73) and large deviations to deduce (70). In contrast to (76), we need to upper bound e.0; t; 0; y; / in terms of e.0; t; 0; y; N /. The proof is essentially the same, except that in place of (75), we need to show that we can choose B large enough, such that P -a.s., 9 8 2 3 = < Zt 4exp j j .s; X.s// ds 1fX.t /Dyg 1flt .X /Bt or X …„l .X / g 5 sup EX 0 t ; : y2tK\Zd
0
inf P0X .Xt D y/:
y2tK\Zd
(77)
148
A. Drewitz et al.
This can be proved by appealing to (70) and applying (73) and large deviation estimates.
4.2 Proof of Shape Theorem for Bounded Ergodic Potentials In this section, we prove Theorem 4.2. From now on, let QC denote the set of positive rationals, and let Qd denote the set of points in Rd with rational coordinates. We start with the following auxiliary result. Lemma 4.1. There exists a deterministic function ˛ W Qd ! ŒA; 1/ such that for every y 2 Qd , lim t 1 a.0; t; 0; ty; / D ˛.y/
t !1 ty2Zd
P a:s:
(78)
Proof. Since we assume y 2 Qd and ty 2 Zd in (78), without loss of generality, it suffices to consider y 2 Zd and t 2 N. Note that by the definition of the passage function a in (68), P -a.s., a.t1 ; t3 ; x1 ; x3 ; / a.t1 ; t2 ; x1 ; x2 ; / C a.t2 ; t3 ; x2 ; x3 ; / 8 t1 < t2 < t3 ; x1 ; x2 ; x3 2 Zd :
(79)
Together with our assumption on the ergodicity of , this implies that the twoparameter family a.s; t; sy; ty; /, 0 s t with s; t 2 Z, satisfies the conditions of Kingman’s subadditive ergodic theorem (see e.g., [18]). Therefore, there exists a deterministic constant ˛.y/ such that (78) holds. The fact that ˛.y/ A follows by bounding from above by the uniform bound A, and ˛.y/ < 1 follows from large deviation bounds for the random walk X . t u To extend the definition of ˛.y/ in Lemma 4.1 to y … Qd and to prove the uniform convergence in (69), we need to establish equicontinuity of t 1 a.0; t; 0; ty; / in y, as t ! 1. For that, we first need a large deviation estimate for the random walk X . Lemma 4.2. Let X be a jump rate simple symmetric random walk on Zd with X.0/ D 0. Then for every t > 0 and x 2 Zd , we have x
P0X .X.t/
eJ. t / t D x/ D x2 d .2 t/ 2 ˘idD1 t 2i C
2 1=4 d2
.1 C o.1// ;
where J.x/ WD
d X dxi j d i D1
with
j.y/ WD y sinh1 y
p y 2 C 1 C 1;
(80)
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
149
and the error term o.1/ tends to zero as t ! 1 uniformly in x 2 tK \ Zd , for any compact K Rd . Proof. Since the coordinates of X are independent, it suffices to consider the case X is a rate =d simple symmetric random walk on Z. Let WD t=dte. Let Z1 ; : : : ; Zdt e be i.i.d. with P .Z1 D y/ D P .X./ D y/eyˆ./ ; where
y 2 Z;
.cosh 1/: ˆ./ D log E eX. / D d
Note that EŒZ1 D
dˆ ./ D sinh d d
Var.Z1 / D
and
d2 ˆ ./ D cosh : 2 d d
We shall set D sinh1 . dx t / so that EŒZ1 D x=dte. If we let Sdt e WD then observe that
Pdt e
i D1 Zi ,
dx
P0X .X.t/ D x/ D P .Sdt e D x/exCdt eˆ./ D P .Sdt e D x/e d j. t /t : q Note that Sdt e x has mean 0, variance t
e
x2 t2
C
2 , d2
and characteristic function
r
dt e ˆ.i kC/ˆ./ i kx
De
ix.sin kk/t
x2 t2
2
C 2 .1cos k/ d
:
Applying Fourier inversion then gives (80). t u With the help of Lemma 4.2, we can control the modulus of continuity of t 1 a.0; t; 0; ty; /. Lemma 4.3. Let K be any compact subset of Rd . There exists K W .0; 1/ ! .0; 1/ with limr#0 K .r/ D 0, such that for any > 0, P -a.s., we have lim sup
sup
t !1
x;y2tK\Zd kxykt
t 1 ja.0; t; 0; x; / a.0; t; 0; y; /j K ./:
(81)
Proof. Let K Rd be compact. It suffices to consider 2 .0; 1=2/, which we also fix from now on. First note that, by Lemma 4.2, P -a.s., inf
z2tK\Zd
e.0; t; 0; z; / eAt
for all t sufficiently large.
inf
z2tK\Zd
P0X .Xt D z/ e.AC1/t supu2K J.u/ t
(82)
150
A. Drewitz et al.
Also note that for all z 2 Zd and t > 0, X e.0; .1 /t; 0; w; / e..1 /t; t; w; z; /: e.0; t; 0; z; / D
(83)
w2Zd
By large deviation estimates, we can choose a ball BR centered at the origin with radius R large enough and independent of , such that K BR and P -a.s., sup z2Zd
X w2Zd w…tBR
e.0; .1 /t; 0; w; / e..1 /t; t; w; z; / P0X X..1 /t/ … tBR eAt e.AC2/t supu2K J.u/ t
for all t sufficiently large. In view of (82), the dominant contribution in (83) comes from w 2 tBR \ Zd . Therefore to prove (81), it suffices to verify t
lim sup
sup
t !1
x;y2tK\Zd kxykt
1
ˇ ˇ P ˇ ˇ ˇ w2tBR \Zd e.0; .1 /t; 0; w; / e..1 /t; t; w; y; / ˇ ˇlog P ˇ ˇ w2tBR \Zd e.0; .1 /t; 0; w; / e..1 /t; t; w; x; / ˇ
K ./:
(84)
Note that P -a.s., and uniformly in x; y 2 tK \ Zd with kx yk t, P d
e.0; .1 /t; 0; w; / e..1 /t; t; w; y; /
w2tBR \Zd
e.0; .1 /t; 0; w; / e..1 /t; t; w; x; /
Pw2tBR \Z
e..1 /t; t; w; y; / P0X .X.t/ D y w/ 2At sup e X w2tBR \Zd e..1 /t; t; w; x; / w2tBR \Zd P0 .X.t/ D x w/ ) ( x w y w J J C 3At exp t sup t t w2tBR \Zd ( )
sup
exp t
sup
jJ.u/ J.v/j C 3At
u;v2B2R= ;kuvk1
for all t sufficiently large, where we applied Lemma 4.2, and B2R= denotes the ball of radius 2R=, centered at the origin. Therefore, (84) holds with
K ./ D 3A C
sup
jJ.u/ J.v/j:
u;v2B2R= ;kuvk1
It only remains to verify that K ./ # 0 as # 0, which is easy to check from the definition of J . t u
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
151
Proof of Theorem 4.2. Because is uniformly bounded, (70) follows by large deviation estimates for the number of jumps of X up to time t. Lemma 4.3 implies that for each compact K Rd , the function ˛ in Lemma 4.1 satisfies sup
j˛.u/ ˛.v/j K ./
for all > 0:
(85)
u;v2K\Qd kuvk
This allows us to extend ˛ to a continuous function on Rd . To prove (69), it suffices to show that for each ı > 0, lim sup
sup
t !1 y2tK\Zd
jt 1 a.0; t; 0; y; / ˛.y=t/j ı:
(86)
We can choose an such that K ./ < ı=3. We can then find a finite number of points x1 ; : : : ; xm 2 Qd which form an -net in K, and along a subsequence of times of the form tn D n with xi 2 Zd for all xi , we have tn1 a.0; tn ; 0; tn xi / ! ˛.xi / a.s. The uniform control of modulus of continuity provided by Lemma 4.3 and (85) then implies (86) along tn . This can be transferred to t ! 1 along R using e.0; t; 0; y; / e.0; s; 0; y; / e.s; t; y; y; / e.0; s; 0; y; /e.CA/.t s/
for s < t:
Finally, to prove the convexity of ˛, let x; y 2 Rd and ˇ 2 .0; 1/. Then P -a.s., we have a.0; tn ; 0; ˇyn C .1 ˇ/xn ; / a.0; ˇtn ; 0; ˇyn ; / C a.ˇtn ; tn ; ˇyn ; ˇyn C .1 ˇ/xn ; /; where we take sequences tn ; xn ; yn with tn ! 1, xn =tn ! x, yn =tn ! y, and ˇyn ; .1 ˇ/xn 2 Zd . By Lemma 4.1, the first term divided by tn converges a.s. to ˛.ˇy C .1 ˇ/x/, the second term divided by ˇtn converges a.s. to ˛.y/, while the last term divided by .1 ˇ/tn converges in probability to ˛.x/ by translation invariance. The convexity of ˛ then follows. t u
4.3 Existence of the Quenched Lyapunov Exponent for the PAM
Proof of (9) in Theorem 1.3. Since Zt; is equally distributed with u.t; 0/ for each t 0, t 1 log u.t; 0/ converges in probability to the quenched Lyapunov exponent Q d;;;; . It only remains to verify the almost sure convergence. We will bound the variance of log u.t; 0/, which is the same as that of log Zt; , and then apply Borel– Cantelli. Assume that t 2 N. Note that we can write as a sum of i.i.d. random fields .i .s; x//s0;x2Zd , each of which is defined from a Poisson system of independent
152
A. Drewitz et al.
random walks with density =t, in the same way as . Then we can perform a martingale decomposition and write
t X
log Zt; E Œlog Zt; D
Vi
i D1
WD
t X E Œlog Zt; j1 ; : : : ; i E Œlog Zt; j1 ; : : : ; i 1 ; i D1
and hence Var.log Zt; / D
Pt
i D1
E ŒVi2 .
For each 1 i t, we have Vi D Ei C1 ;:::;t log Zt; Ei Œlog Zt; 2 3 t h R P1j t;j ¤i j .s;X.s//Ci .s;X.s// ds i 0 6 7 EX 0 e 7 i C1 ;:::;t i0 6 DE E 6log 7 t R P 4 0 h i5 1j t;j ¤i j .s;X.s//Ci .s;X.s// ds 0 EX 0 e 3 2 t t h R i .s;X.s// ds i h R i0 .s;X.s// ds i 0 5; D Ei C1 ;:::;t Ei 4log EX;i e 0 log EX;i e 0 where i0 denotes an independent copy of i , and EX;i denotes expectation with respect to the Gibbs transform of the random walk path measure P0X , with Gibbs Rt P weight e 0 1j t;j ¤i j .s;X.s// ds . Then by Jensen’s inequality, 0
E ŒVi2 E;i
h
;i0
h R i .s;X.s// ds i h R i0 .s;X.s// ds i2 i log EX;i e 0 log EX;i e 0 t
h
2E
;i0
log E
h
C 2E
D 4E
h
h
X;i
e
log E
X;i
log E
X;i
h
Rt 0
h
e
t
i .s;X.s// ds i2 i
e Rt 0
Rt 0
i0 .s;X.s// ds i2 i
i .s;X.s// ds i2 i
h h Zt i2 i X;i 4E E i .s; X.s// ds
0
4 2 E EX;i
h Z t i .s; X.s// ds 0
2 i
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
D 4 E 2
X;i
E
i
h Z t i .s; X.s// ds
2 i
153
;
0
where in the third line we used the exchangeability of fi ; i0 g, and in the fourth line we applied Jensen’s inequality1 to the non-negative convex function log x on the interval .0; 1. Note that for any realization of ..X.s//0st , we have E
i
h Z t i .s; X.s// ds 0
2 i
“ Ei Œi .u; X.u//i .v; X.v// du dv
D2 0
“
2 X
D2
t2
0
C
2 C 2 t t
Y Py;u .Y .v/ D X.v//
y2Zd y¤X.u/
Y PX.u/;u .Y .v/ D X.v// du dv
Zt Y P0;0 .Y .s/ D 0/ ds;
2 2 C 2 0
Y denotes probability for a simple symmetric random walk on Zd with where Py;s Y jump rate , starting from y at time s, and in the last line we used that P0;0 .Y .s/D y/ is maximized at y D 0 for all s 0. Combined with the previous bounds, we obtain
Var.log u.t; 0// D Var.log Zt; / D
t X
E ŒVi2
i D1
Zt 2 2
3
Y P0;0 .Y .s/ D 0/ ds C t 2
2
8 t C 8 t 0
Rt Y p for some C > 0, since 0 P0;0 .Y .s/ D 0/ ds is of order t in dimension d D 1, of order log t in d D 2, and converges in d 3. Therefore for any > 0, ˇ ˇ P ˇ log u.t; 0/ E Œlog u.t; 0/ˇ t
1
Note that this is where the proof fails for the < 0 case.
C p ; t
2
154
A. Drewitz et al.
which by Borel–Cantelli implies that along the sequence tn D n3 , n 2 N, we have almost sure convergence of t 1 log u.t; 0/ to the quenched Lyapunov exponent Q d;;;; . To extend the almost sure convergence to t ! 1 along R, consider t 2 Œtn ; tnC1 / for some n 2 N. As at the end of the proof of Proposition 3.1, we have
u.t; 0/ e
.t tn /
u.t; 0/ e
.tnC1 t /
e e
Rt tn
.s;0/ ds
tnC1 R t
u.tn ; 0/;
.s;0/ ds
u.tnC1 ; 0/:
Rt Note that .tnC1 tn /=tn ! 0 as n ! 1, and we claim that also tn1 tnnC1 .s; 0/ ds ! 0 a.s. as n ! 1, which then implies the desired almost sure convergence of R1 t 1 log u.t; 0/ as t ! 1 along R. Indeed, since 0 .s; 0/ ds has finite exponential moments, as can be seen from (15) applied to the case < 0 and X 0, we have R1 exponential tail bounds on 0 .s; 0/ ds, which by Borel–Cantelli implies that a.s. R i C1 sup0i <m i .s; 0/ ds log m for all m 2 N sufficiently large. The above claim then follows. t u
4.4 Positivity of the Quenched Lyapunov Exponent In this section, we conclude the proof of Theorems 1.2 and 1.3 by showing that the quenched Lyapunov exponent Q d;;;; is positive in all dimensions. The strategy is as follows: Employing a result of Kesten and Sidoravicius [16, Prop. 8], we deduce that P -a.s. for eventually all integer time points t, sufficiently many X paths encounter a -particle close-by for of order t many integer time points. Using the Markov property, we then show that with positive P0X probability, X moves to a close-by -particle (which itself stays at its site for some time) within a very short time interval and collects some local time with this -particle. This then implies the desired exponential decay. Proof of Theorems 1.2 and 1.3. Since we have shown the quenched Lyapunov exponent Q d;;;; in Theorems 1.2 and 1.3 to be the same, it suffices to consider only Theorem 1.2. Note that the upper bound on Q d;;;; in Theorem 1.2 follows trivially by requiring the walk X to stay at the origin. To show Q d;;;; > 0, we will make the strategy outlined above precise. In compliance with [16], we let C0 and r > 0 be large integers and for Ei 2 Zd define the cubes Qr .Ei / WD
d Y
Œij ; ij C C0r /:
j D1
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
155
In a slight abuse of common notation, let D.Œ0; 1/; Zd / denote the Skorohod space restricted to those functions that start in 0 at time 0 and have nearest neighbor jumps only. Then set ˚ Jk WD ˆ 2 D.Œ0; 1/; Zd / W ˆ jumps at most dC0r . _ 1/k times up to time k : For integer times t > 0 define „.t/ WD
t \
Jk :
kDbt =4c
Then standard large deviation bounds yield P0X X 2 „.t/c ec.t Co.t //;
(87)
for some c > 0: In addition, define the cube Ct WD ŒdC0r . _ 1/t; dC0r . _ 1/td \ Zd ; as well as for arbitrary t 2 N; k 2 f0; : : : ; tg; ˆ 2 „.t/ and 0 the events ˚ A.t; ˆ; k; / WD 9Ei 2 Ct W ˆ.k/ 2 Qr .Ei / and 9 y 2 Qr .Ei / W .s; y/ 1 8 s 2 Œk; k C = \ n
and G.t/ WD
ˆ2„.t /
o 1A.t;ˆ;k;/ t ;
X k2fbt =4c; ;t 1g
which both depend on : For small enough, using Borel–Cantelli, it is a consequence of [16, Prop. 8] that P -a.s., G.t/ occurs for eventually all t 2 N: Indeed, denoting by „.t/jfbt =4c;:::;t g the subset of .Zd /fbt =4c;:::;t g obtained by restricting each element of „.t/ to the domain fbt=4c; : : : ; tg, we estimate
P G.t/
c
P
[ ˆ2„.t /
P
[ ˆ2„.t /
(
(
X
)! 1A.t;ˆ;k;/ t
k2fbt =4c;:::;t 1g
X
1A.t;ˆ;k;0/
k2fbt =4c;:::;t 1g
ˇ ˇ C ˇ„.t/jfbt =4c;:::;t g ˇ max P ˆ2„.t /
t 2
)!
X k2fbt =4c;:::;t 1g
1A.t;ˆ;k;0/
t ; 2
156
A. Drewitz et al.
!
X
1A.t;ˆ;k;/ t
k2fbt =4c;:::;t 1g
P
(
[ ˆ2„.t /
X
1A.t;ˆ;k;0/
k2fbt =4c;:::;t 1g
t 2
! t =2 X ˇ ˇ pi; t ; C ˇ„.t/jfbt =4c;:::;t g ˇ P
)!
(88)
i D1
where in the last step we observed that, given ˆ 2 „.t/, by the strong Markov property of applied successively to the stopping times i WD inffj bt=4c W P j 1 D i g, we can couple with a sequence of i.i.d. Bernoulli random kDbt =4c A.t;ˆ;k;0/ variables .pi; /i 2N with ˇ P .p1; D 1/ D P Y10 .s/ D 0 8s 2 Œ0; = ˇ .0; 0/ 1 ; P such that 1A.t;ˆ;i ;/ pi; a.s. for all i 2 N, and hence k2fbt =4c;:::;t 1g 1A.t;ˆ;k;/ P Pt =2 t k2fbt =4c;:::;t 1g 1A.t;ˆ;k;0/ 2 . Here, pi; corresponds to the i D1 pi; on the event event that given A.t; ˆ; i ; 0/, a chosen Y -particle, which is close to ˆ at time i , does not jump on the time interval Œi ; i C =. By [16, Prop. 8], the first term in (88) by 1=t 2 for t large ˇ is bounded from ˇ above Ct ˇ ˇ enough. For the second term we have „.t/jfbt =4c;:::;t g e for some C > 0 and all t; while large deviations yield that we can find > 0 such that P
t =2 X
pk; t e2C t
kD1
for t large enough. From now on we fix such an . Borel–Cantelli then yields that P -a.s., G.t/ holds for all t 2 N large enough. Next observe that by the strongPMarkov property of X , we can construct a coupling such that on the event k2fbt =4c;:::;t 1g 1A.t;X;k;/ t, the random Rt variable 0 .s; X.s// ds almost surely dominates the sum of i.i.d. random variables .qi; /1i t with P .q1; D =.2// D ˛ WD P .q1; D 0/
inf
y;z2Qr .0/
PyX .X.s/ D z 8s 2 Œ=.2/; =// > 0;
D 1 ˛I
Pj qi; corresponds to the event that given i WD inffj bt=4c W kDbt =4c 1A.t;X;k;/ D ig, X finds a Y -particle in the field which guarantees the event A.t; X; i ; /, and then occupies the same position as that Y -particle on the time interval Œi C =.2/; i C =. Since P -a.s., G.t/ holds for all t 2 N large enough, for such t, we have
Survival Probability of a Random Walk Among a Poisson System of Moving Traps
EX 0
h
n
Zt
exp
157
i o i h Pt .s; X.s// ds ; „.t/ E e i D1 qi; D ˛e =.2/ C1 ˛/t :
0
(89)
Thus, with (87) and (89) we obtain that P -a.s., for all t 2 N large, Zt Zt h n h n oi o i X exp exp EX .s; X.s// ds E .s; X.s// ds ; „.t/ 0 0 0
CP0X
0
X 2 „.t/c eı.t Co.t //
for some ı > 0. This establishes the desired result along integer t. Since Zt; is monotone in t, we deduce that the result holds as stated. t u Acknowledgements We thank Frank den Hollander for bringing [22] to our attention, Alain-Sol Sznitman for suggesting that we prove a shape theorem for the quenched survival probability, and Vladas Sidoravicius for explaining to us [16, Prop. 8], which we use to prove the positivity of the quenched Lyapunov exponent. A.F. Ram´ırez was partially supported by Fondo Nacional de Desarrollo Cient´ıfico y Tecnol´ogico grant 1100298. J. G¨artner, R. Sun, and partially A.F. Ram´ırez were supported by the DFG Forschergruppe 718 Analysis and Stochastics in Complex Physical Systems.
References 1. Antal, P.: Trapping problem for the simple random walk. Dissertation ETH, No 10759 (1994) 2. Antal, P.: Enlargement of obstacles for the simple random walk. Ann. Probab. 23, 1061–1101 (1995) 3. Biskup, M., K¨onig, W.: Long-time tails in the parabolic Anderson model with bounded potential. Ann. Probab. 29, 636–682 (2001) 4. Bolthausen, E.: Localization of a two-dimensional random walk with an attractive path interaction. Ann. Probab. 22, 875–918 (1994) 5. Bramson, M., Lebowitz, J.: Asymptotic behavior of densities for two-particle annihilating random walks. J. Statist. Phys. 62, 297–372 (1991) 6. Cox, T., Griffeath, D.: Large deviations for Poisson systems of independent random walks. Z. Wahrsch. Verw. Gebiete 66, 543–558 (1984) 7. Donsker, M., Varadhan, S.R.S.: Asymptotics for the Wiener sausage. Comm. Pure Appl. Math. 28, 525–565 (1975) 8. Donsker, M., Varadhan, S.R.S.: On the number of distinct sites visited by a random walk. Comm. Pure Appl. Math. 32, 721–747 (1979) 9. Evans, L.C.: Partial differential equations, 2nd edn. Graduate Studies in Mathematicsm, vol. 19. American Mathematical Society, Providence, RI (2010) 10. Feller, W.: An introduction to probability theory and its applications, vol. II. Wiley, New York (1966) 11. G¨artner, J., den Hollander, F.: Intermittency in a catalytic random medium. Ann. Probab. 34, 2219–2287 (2006) 12. G¨artner, J., K¨onig, W.: The parabolic Anderson model. Interacting Stochastic Systems, pp. 153–179. Springer, Berlin (2005)
158
A. Drewitz et al.
13. G¨artner, J., den Hollander, F., Maillard, G.: Intermittency on catalysts. Trends in Stochastic Analysis, pp. 235–248, London Math. Soc. Lecture Note Ser., vol. 353. Cambridge University Press, Cambridge (2009) 14. G¨artner, J., den Hollander, F., Maillard, G.: Quenched Lyapunov exponent for the parabolic Anderson model in a dynamic random environment. In: Probability in Complex Physical Systems. Springer, Heidelberg, pp. 159–193 (2012) 15. Kesten, H., Sidoravicius, V.: Branching random walks with catalysts. Electron. J. Probab. 8, 1–51 (2003) 16. Kesten, H., Sidoravicius, V.: The spread of a rumor or infection in a moving population. Ann. Probab. 33, 2402–2462 (2005) 17. Lawler, G.F.: Intersections of Random Walks. Birkh¨auser Boston (1996) 18. Liggett, T.: An improved subadditive ergodic theorem. Ann. Probab. 13, 1279–1285 (1985) 19. Moreau, M., Oshanin, G., B´enichou, O., Coppey, M.: Pascal principle for diffusion-controlled trapping reactions. Phys. Rev. E 67, 045104(R) (2003) 20. Moreau, M., Oshanin, G., B´enichou, O., Coppey, M.: Lattice theory of trapping reactions with mobile species. Phys. Rev. E 69, 046101 (2004) 21. Peres, Y., Sinclair, A., Sousi, P., Stauffer, A.: Mobile geometric graphs: Detection, coverage and percolation. Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (50DA), 412–428 (2011) 22. Redig, F.: An exponential upper bound for the survival probability in a dynamic random trap model. J. Stat. Phys. 74, 815–827 (1994) 23. Spitzer, F.: Principles of Random Walk, 2nd edn. Springer, Berlin (1976) 24. Sznitman, A.S.: Brownian Motion, Obstacles and Random Media. Springer, Berlin (1998) 25. Varadhan, S.R.S.: Large deviations for random walks in a random environment. Comm. Pure Appl. Math. 56, 1222–1245 (2003)
Quenched Lyapunov Exponent for the Parabolic Anderson Model in a Dynamic Random Environment Jurgen ¨ G¨artner, Frank den Hollander, and Gr´egory Maillard
Abstract We continue our study of the parabolic Anderson equation @u=@t D u C u for the space–time field uW Zd Œ0; 1/ ! R, where 2 Œ0; 1/ is the diffusion constant, is the discrete Laplacian, 2 .0; 1/ is the coupling constant, and W Zd Œ0; 1/ ! R is a space–time random environment that drives the equation. The solution of this equation describes the evolution of a “reactant” u under the influence of a “catalyst” , both living on Zd . In earlier work we considered three choices for : independent simple random walks, the symmetric exclusion process, and the symmetric voter model, all in equilibrium at a given density. We analyzed the annealed Lyapunov exponents, i.e., the exponential growth rates of the successive moments of u w.r.t. , and showed that these exponents display an interesting dependence on the diffusion constant , with qualitatively different behavior in different dimensions d . In the present paper we focus on the quenched Lyapunov exponent, i.e., the exponential growth rate of u conditional on . We first prove existence and derive qualitative properties of the quenched Lyapunov exponent for a general that is stationary and ergodic under translations in space and time and satisfies certain noisiness conditions. After that we focus
J. G¨artner Institut f¨ur Mathematik, Technische Universit¨at Berlin, Strasse des 17. Juni 136, D-10623 Berlin, Germany e-mail: [email protected] F. den Hollander Mathematical Institute, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands EURANDOM, P.O. Box 513, 5600 MB Eindhoven, The Netherlands e-mail: [email protected] G. Maillard () CMI-LATP, Universit´e de Provence, 39 rue F. Joliot-Curie, 13453 Marseille Cedex 13, France EURANDOM, P.O. Box 513, 5600 MB Eindhoven, The Netherlands e-mail: [email protected] J.-D. Deuschel et al. (eds.), Probability in Complex Physical Systems, Springer Proceedings in Mathematics 11, DOI 10.1007/978-3-642-23811-6 7, © Springer-Verlag Berlin Heidelberg 2012
159
160
J. G¨artner et al.
on the three particular choices for mentioned above and derive some further properties. We close by formulating open problems.
1 Introduction Section 1.1 defines the parabolic Anderson model, Sect. 1.2 introduces the quenched Lyapunov exponent, Sect. 1.3 summarizes what is known in the literature, Sect. 1.4 contains our main results, while Sect. 1.5 provides a discussion of these results and lists open problems.
1.1 Parabolic Anderson Model The parabolic Anderson model (PAM) is the partial differential equation @ u.x; t/ D u.x; t/ C Œ .x; t/ ıu.x; t/; @t
x 2 Zd; t 0:
(1)
Here, the u-field is R-valued, 2 Œ0; 1/ is the diffusion constant, is the discrete Laplacian acting on u as u.x; t/ D
X
Œu.y; t/ u.x; t/;
(2)
y2Zd kyxkD1
(k k is the Euclidian norm), 2 Œ0; 1/ is the coupling constant, ı 2 Œ0; 1/ is the killing constant, while D .t /t 0 with t D f.x; t/W x 2 Zd g;
(3)
is an R-valued random field that evolves with time and that drives the equation. The -field provides a dynamic random environment defined on a probability space .˝; F ; P /. As initial condition for (1) we take u.x; 0/ D ı0 .x/;
x 2 Zd :
(4)
One interpretation of (1) and (4) comes from population dynamics. Consider a system of two types of particles, A (catalyst) and B (reactant), subject to: • A-particles evolve autonomously according to a prescribed dynamics with .x; t/ denoting the number of A-particles at site x at time t.
Quenched Lyapunov Exponent for the PAM
161
• B-particles perform independent random walks at rate 2d and split into two at a rate that is equal to times the number of A-particles present at the same location. • B-particles die at rate ı. • The initial configuration of B-particles is one particle at site 0 and no particle elsewhere. Then u.x; t/ D the average number of B-particles at site x at time t conditioned on the evolution of the A-particles:
(5)
It is possible to remove ı via the trivial transformation u.x; t/ ! u.x; t/eıt . In what follows we will therefore put ı D 0. Throughout the paper, P denotes the law of and we assume that
is stationary and ergodic under translations in space and time, is not constant, and D E..0; 0// 2 R
8 ; 2 Œ0; 1/ 9 c D c.; / < 1W E.log u.0; t// ct 8 t 0
(6) (7)
Three choices of will receive special attention: (1)
(2)
(3)
Independent Simple Random Walks (ISRW) [Kipnis and Landim [22], d Chap. 1]. Here, t 2 ˝ D .N [ f0g/Z and .x; t/ represents the number of particles at site x at time t. Under the ISRW-dynamics particles move around independently as simple random walks stepping at rate 1. We draw 0 according to the equilibrium with density 2 .0; 1/, which is a Poisson product measure. Symmetric Exclusion Process (SEP) [Liggett [23], Chap. VIII]. Here, t 2 d ˝ D f0; 1gZ and .x; t/ represents the presence (.x; t/ D 1) or absence (.x; t/ D 0) of a particle at site x at time t. Under the SEP-dynamics particles move around independently according to an irreducible symmetric random walk transition kernel at rate 1, but subject to the restriction that no two particles can occupy the same site. We draw 0 according to the equilibrium with density 2 .0; 1/, which is a Bernoulli product measure. Symmetric Voter Model (SVM) [Liggett [23], Chap. V]. Here, t 2 ˝ D d f0; 1gZ and .x; t/ represents the opinion of a voter at site x at time t. Under the SVM-dynamics each voter imposes its opinion on another voter according to an irreducible symmetric random walk transition kernel at rate 1. We draw 0 according to the equilibrium distribution with density 2 .0; 1/, which is not a product measure.
Note: While ISRW and SEP are conservative and reversible in time, SVM is not. The equilibrium properties of SVM are qualitatively different for recurrent and transient random walk. For recurrent random walk all equilibria with 2 .0; 1/
162
J. G¨artner et al.
are non-ergodic, namely, D .1 /ıf 0g C ıf 1g , and therefore are precluded by (6). For transient random walk, on the other hand, there are ergodic equilibria.
1.2 Lyapunov Exponents Our focus will be on the quenched Lyapunov exponent, defined by 1 log u.0; t/ t !1 t
0 D lim
-a.s.
(8)
We will be interested in comparing 0 with the annealed Lyapunov exponents, defined by 1=p 1
p D lim log E Œu.0; t/p ; p 2 N; (9) t !1 t which were analyzed in detail in our earlier work (see Sect. 1.3). In (8–9) we pick x D 0 as the reference site to monitor the growth of u. However, it is easy to show that the Lyapunov exponents are the same at other sites. By the Feynman–Kac formula, the solution of (1) reads Z t u.x; t/ D Ex exp .X .s/; t s/ ds u X .t/; 0 ;
(10)
0
where X D .X .t//t 0 is simple random walk on Zd stepping at rate 2d and Ex denotes expectation with respect to X given X .0/ D x. In particular, for our choice in (4), for any t > 0 we have
Z t exp X .s/; t s ds ı0 X .t/
Z t exp X .s/; s ds ı0 X .t/ ;
u.0; t/ D E 0 D E0
0
(11)
0
where in the last line we reverse time and use that X is a reversible dynamics. Therefore, we can define 0 .t/ D
Z t 1 1 log u.0; t/ D log E 0 exp X .s/; s ds u X .t/; 0 : t t 0
(12)
If the last quantity -a.s. admits a limit as t ! 1, then
0 D lim 0 .t/ t !1
where the limit is expected to be -a.s. constant.
-a.s.;
(13)
Quenched Lyapunov Exponent for the PAM
163
Clearly, 0 is a function of d , , and the parameters controlling . In what follows, our main focus will be on the dependence on , and therefore we will often write 0 ./. Note that p 7! p ./ is nondecreasing for p 2 N [ f0g. Note: Conditions (6–7) imply that the expectations in (10–12) are strictly positive and finite for all x 2 Zd and t 0, and that 0 < 1. Moreover, by Jensen’s inequality applied to (12) with u.; 0/ given by (4), we have E.0 .t// C 1 log P0 .X .t/ D 0/ and, since the last term tends to zero as t ! 1, we find that t
0 > 1.
1.3 Literature The behavior of the Lyapunov exponents for the PAM in a time-dependent random environment has been the subject of several papers.
1.3.1 White Noise Carmona and Molchanov [6] obtained a qualitative description of both the quenched and the annealed Lyapunov exponents when is white noise, i.e., .x; t/ D
@ W .x; t/; @t
(14)
where W D .Wt /t 0 with Wt D fW .x; t/W x 2 Zd g is a space–time field of independent Brownian motions. This choice is special because the increments of are independent in space and time. They showed that if u.; 0/ has compact support (e.g., u.; 0/ D ı0 ./ as in (4)), then the quenched Lyapunov exponent 0 ./ defined in (8) exists and is constant -a.s., and is independent of u.; 0/. Moreover, they found that the asymptotics of 0 ./ as # 0 is singular, namely, there are constants C1 ; C2 2 .0; 1/, and 0 2 .0; 1/ such that C1
1 log log.1=/ 0 ./ C2 log.1=/ log.1=/
8 0 < 0 :
(15)
Subsequently, Carmona, Molchanov and Viens [7], Carmona, Koralov and Molchanov [5], and Cranston, Mountford and Shiga [9] proved the existence of 0 when u.; 0/ has noncompact support (e.g., u.; 0/ 1), showed that there is a constant C 2 .0; 1/ such that lim log.1=/ 0./ D C; (16) #0
and proved that lim p ./ D 0 ./ p#0
8 2 Œ0; 1/:
(17)
164
J. G¨artner et al. l p(k)
Fig. 1 Quenched and annealed Lyapunov exponents when d D 1; 2 for white noise
p=k ⋅ ⋅ ⋅
d = 1,2
p=3 p=2
1 2
p=1 p=0
k
0
(These results were later extended to L´evy white noise by Cranston, Mountford and Shiga [10], and to colored noise by Kim, Viens and Vizcarra [20].) Further refinements on the behavior of the Lyapunov exponents were conjectured in Carmona and Molchanov [6] and proved in Greven and den Hollander [18]. In particular, it was shown that 1 ./ D 12 for all 2 Œ0; 1/, while for the other Lyapunov exponents the following dichotomy holds (see Figs. 1–2): • d D 1; 2: 0 ./ < 12 , p ./ > 12 for p 2 Nnf1g, for 2 Œ0; 1/ • d 3: there exist 0 < 0 2 3 : : : < 1 such that
0 ./ and
p ./
1 2
1 2
< 0; for 2 Œ0; 0 /; D 0; for 2 Œ0 ; 1/;
> 0; for 2 Œ0; p /; D 0; for 2 Œp ; 1/;
p 2 Nnf1g:
(18)
(19)
Moreover, variational formulas for p were derived, which in turn led to upper and lower bounds on p and to the identification of the asymptotics of p for p ! 1 (p grows linearly with p). In addition, it was shown that for every p 2 Nnf1g there exists a d.p/ < 1 such that p < pC1 for d d.p/. Moreover, it was shown that 0 < 2 in Birkner, Greven and den Hollander [2] (d 5), Birkner and Sun [3] (d D 4), Berger and Toninelli [1], Birkner and Sun [4] (d D 3). Note that, by H¨older’s inequality, all curves in Figs. 1–2 are distinct whenever they are different from 12 . 1.3.2 Interacting Particle Systems Various models where is dependent in space and time were looked at subsequently. Kesten and Sidoravicius [19] and G¨artner and den Hollander [13] considered the
Quenched Lyapunov Exponent for the PAM l p(k) p=k d ≥3
⋅ ⋅ ⋅
Fig. 2 Quenched and annealed Lyapunov exponents when d 3 for white noise
165
p=3 p=2
p=1 p=0
k 0 k 2 k 3 ⋅ ⋅ ⋅ kk 0
1 2 k
case where is a field of independent simple random walks in Poisson equilibrium (ISRW). The survival versus extinction pattern [19] and the annealed Lyapunov exponents [13] were analyzed in particular, their dependence on d , , , and . The case where is a single random walk was studied by G¨artner and Heydenreich [12]. G¨artner, den Hollander and Maillard [14], [16], [17] subsequently considered the cases where is an exclusion process with an irreducible symmetric random walk transition kernel starting from a Bernoulli product measure (SEP), respectively, a voter model with an irreducible symmetric transient random walk transition kernel starting either from a Bernoulli product measure or from equilibrium SVM. In each of these cases, a fairly complete picture of the behavior of the annealed Lyapunov exponents was obtained, including the presence or absence of intermittency, i.e.,
p ./ > p1 ./ for some or all values of p 2 Nnf1g and 2 Œ0; 1/. Several conjectures were formulated as well. In what follows we describe these results in some more detail. We refer the reader to G¨artner, den Hollander and Maillard [15] for an overview. It was shown in G¨artner and den Hollander [13] and G¨artner, den Hollander and Maillard [14], [16], [17] that for ISRW, SEP, and SVM in equilibrium the function 7! p ./ satisfies: • If d 1 and p 2 N, then the limit in (9) exists for all 2 Œ0; 1/. Moreover, if p .0/ < 1, then 7! p ./ is finite, continuous, strictly decreasing, and convex on Œ0; 1/. • There are two regimes (we summarize results only for the case where the random walk transition kernel has finite second moment): – Strongly catalytic regime (see Fig. 3): ISRW: d D 1; 2, p 2 N or d 3, p 1= Gd W p 1 on Œ0; 1/ (Gd is the Green function at the origin of simple random walk) SEP: d D 1; 2, p 2 NW p on Œ0; 1/ SVM: d D 1; 2; 3; 4, p 2 NW p on Œ0; 1/
166
J. G¨artner et al. l p(k)
Fig. 3 Triviality of the annealed Lyapunov exponents for ISRW, SEP, and SVM in the strongly catalytic regime
∞
ISRW
g
SEP, SVM
rg k
0 l p(k )
Fig. 4 Nontriviality of the annealed Lyapunov exponents for ISRW, SEP, and SVM in the weakly catalytic regime at the critical dimension
d = 3 ISRW, SEP d = 5 SVM
p=3 p=2 p=1
?
rg k
0
Fig. 5 Nontriviality of the annealed Lyapunov exponents for ISRW, SEP, and SVM in the weakly catalytic regime above the critical dimension
l p(k)
p=3
d ≥ 4 ISRW, SEP d ≥ 6 SVM
p=2 p=1
?
rg
0
k
– Weakly catalytic regime (see Fig. 4–5): ISRW: d 3, p < 1= Gd W < p < 1 on Œ0; 1/ SEP: d 3, p 2 NW < p < on Œ0; 1/ SVM: d 5, p 2 NW < p < on Œ0; 1/ • For all three dynamics, in the weakly catalytic regime lim!1 Œ p ./ D C1 C C2 p 2 1fd Ddc g with C1 ; C2 2 .0; 1/ and dc a critical dimension: dc D 3 for ISRW, SEP and dc D 5 for SVM. • Intermittent behavior: – In the strongly catalytic regime, there is no intermittency for all three dynamics.
Quenched Lyapunov Exponent for the PAM
167
– In the weakly catalytic regime, there is full intermittency for: All three dynamics when 0 1 ISRW and SEP in d D 3 when 1 SVM in d D 5 when 1 Note: For SVM the convexity of 7! p ./ and its scaling behavior for ! 1 have not actually been proved, but have been argued on heuristic grounds. Recently, there has been further progress for the case where consists of 1 random walk (Schnitzler and Wolff [25]) or n independent random walks (Castell, G¨un and Maillard [8]), is the SVM (Maillard, Mountford and Sch¨opfer [24]), and for the trapping version of the PAM with 2 .1; 0/ (Drewitz, G¨artner, Ram´ırez and Sun [11]). All these papers appear elsewhere in the present volume.
1.4 Main Results We have six theorems, all relating to the quenched Lyapunov exponent and extending the results on the annealed Lyapunov exponents listed in Sect. 1.3. Let e be any nearest-neighbor site of 0, and abbreviate Z I .x; t/ D
t
Œ.x; s/ ds;
x 2 Zd ; t 0:
(20)
0
Our first three theorems deal with general and employ four successively stronger noisiness conditions: 1 E jI .0; t/ I .e; t/j D 1; log t 1 1 lim inf E jI .0; t/ I .e; t/j2 > 0; lim sup 2 E jI .0; t/j4 < 1; t !1 t t !1 t i h 1 lim sup 2=3 log sup P I .0; t/ > t 5=6 < 0; t t !1 2˝
8 ; t > 0; 9 c < 1W sup E exp I .0; t/ expŒc 2 t lim
t !1
(21) (22) (23) (24)
2˝
where P denotes the law of starting from 0 D . Theorem 1.1. Fix d 1, 2 Œ0; 1/ and 2 .0; 1/. The limit in (8) exists P -a.s. and in P -mean, and is finite. Theorem 1.2. Fix d 1 and 2 .0; 1/. (i) 0 .0/ D and < 0 ./ < 1 for all 2 .0; 1/ with D E..0; 0// 2 R. (ii) 7! 0 ./ is globally Lipschitz outside any neighborhood of 0. Moreover, if
168
J. G¨artner et al.
is bounded from above, then the Lipschitz constant at tends to zero as ! 1. (iii) If satisfies condition (21) and is bounded from below, then 7! 0 ./ is not Lipschitz at 0. Theorem 1.3. (i) If satisfies condition (22) and is bounded from below, then lim inf log.1=/ Œ 0 ./ > 0:
(25)
#0
(ii) If is a Markov process that satisfies condition (23) and is bounded from above, then lim sup Œlog.1=/1=6 Œ 0 ./ < 1: (26) #0
(iii) If is a Markov process that satisfies condition (24) and is bounded from above, then log.1=/ Œ 0 ./ < 1: lim sup (27) log log.1=/ #0 Our last three theorems deal with ISRW, SEP and SVM. Theorem 1.4. For ISRW, SEP, and SVM in the weakly catalytic regime, lim!1
0 ./ D . Theorem 1.5. ISRW and SEP satisfy conditions (21) and (22). Theorem 1.6. For ISRW in the strongly catalytic regime, 0 ./ < 1 ./ for all 2 Œ0; 1/. Theorems 1.1–1.3 wil be proved in Sect. 2, Theorems 1.4–1.6 in Sect. 3. Note: Theorem 1.4 extends to voter models that are nonnecessarily symmetric (see Sect. 3.1).
1.5 Discussion and Open Problems 1. Figure 6 graphically summarizes the results in Theorems 1.1–1.3 and what we expect to be provable with a little more effort. The main message of this figure is that the qualitative behavior of 7! 0 ./ is well understood, including the logarithmic singularity at D 0. Note that Theorems 1.2 and 1.3(i) do not imply continuity at D 0, while Theorems 1.3(ii–iii) do. 2. Figures 7–9 summarize how we expect 7! 0 ./ to compare with 7! 1 ./ for the three dynamics. 3. Conditions (6–7) are trivially satisfied for SEP and SVM, because is bounded. For ISRW they follow from Kesten and Sidoravicius [19], Theorem 2. 4. Conditions (21–22) are weak while conditions (23–24) are strong. Theorem 1.5 states that conditions (21–22) are satisfied for ISRW and SEP. We will see in
Quenched Lyapunov Exponent for the PAM Fig. 6 Conjectured behavior of the quenched Lyapunov exponent
169 l0(k)
rg
k
0
Fig. 7 Conjectured behavior for ISRW, SEP, and SVM below the critical dimension
l0(k)
p=1
p=0 0
Fig. 8 Conjectured behavior for ISRW, SEP, and SVM at the critical dimension
k
lp(k)
p=1
d = 3 ISRW, SEP d = 5 SVM
p=0 0
Fig. 9 Conjectured behavior for ISRW, SEP, and SVM above the critical dimension
k
lp(k)
p=1
p=0 0
d ≥ 4 ISRW, SEP d ≥ 6 SVM
k0
k
Sect. 3.2 that, most likely, they are satisfied for SVM as well. Conditions (23–24) fail for the three dynamics, but are satisfied, e.g., for spin-flip dynamics in the so-called “M < regime” (see Liggett [23], Sect. I.3). (The verification of this statement is left to the reader.) 5. The following problems remain open: • Extend Theorem 1.1 to the initial condition u.; 0/ 1, and show that 0 is the same as for the initial condition u.; 0/ D ı0 ./ assumed in (4). (The proof of Theorem 1.1 in Sect. 2.1 shows that it is straightforward to do this extension for u.; 0/ symmetric with bounded support. Recall the remark made prior to (12).)
170
J. G¨artner et al.
• Prove that lim#0 0 ./ D and lim!1 0 ./ D under conditions (6–7) alone. (These limits correspond to time ergodicity, respectively, space ergodicity of , but are nontrivial because they require some control on the fluctuations of .) • Prove Theorems 1.2(ii–iii) without the boundedness assumptions on . Prove Theorem 1.3(i) under condition (21) alone. (The proof of Theorem 1.2(iii) in Sect. 2.4 shows that 0 ./ stays above any positive power of as # 0.) Improve Theorems 1.3(ii–iii) by establishing under what conditions the upper bounds in (26–27) can be made to match the lower bound in (25). • Extend Theorems 1.4–1.6 by proving the qualitative behavior for the three dynamics conjectured in Figs. 7–9. (For white noise dynamics the curves successively merge for all d 3 (see Figs. 1–2).) • For the three dynamics in the weakly catalytic regime, find the asymptotics of
0 ./ as ! 1 and compare this with the asymptotics of p ./, p 2 N, as ! 1 (see Figs. 4–5). • Extend the existence of p to all (noninteger) p > 0 and prove that p # 0 as p # 0. (For white noise dynamics this extension is achieved in (17).)
2 Proof of Theorems 1.1–1.3 The proofs of Theorems 1.1–1.3 are given in Sects. 2.1, 2.2–2.4, and 2.5–2.7, respectively. Without loss of generality, we may assume that D E..0; 0// D 0, by the remark made prior to conditions (6–7).
2.1 Proof of Theorem 1.1 Proof. Recall (4) and (12–13), abbreviate Z .s; t/ D E0 exp
t s
X .v/; s C v dv ı0 .X .t s// ;
0 s t < 1;
0
(28) P and note that .0; t/ D u.0; t/. Picking u 2 Œs; t, inserting ı0 .X .u s// under the expectation and using the Markov property of X at time u s, we obtain .s; t/ .s; u/ .u; t/;
0 s u t < 1:
(29)
Thus, .s; t/ 7! log .s; t/ is superadditive. By condition (6), the law of f.uCs; uC t/W 0 s t < 1g is the same for all u 0. Therefore the superadditive ergodic theorem (see Kingman [21]) implies that
Quenched Lyapunov Exponent for the PAM
0 D lim
t !1
171
1 log .0; t/ exists P -a.s. and in P -mean: t
(30)
We saw at the end of Sect. 1.2 that 0 2 Œ0; 1/ (because D 0).
t u
2.2 Proof of Theorem 1.2(i) Proof. The fact that 0 .0/ RD 0 is immediate from (12–13) because P0 .X 0 .t/ D t 0/ D 1 for all t 0 and 0 .0; s/ ds D o.t/ -a.s. as t ! 1 by the ergodic theorem (recall condition (6)). We already know that 0 ./ 2 Œ0; 1/ for all 2 Œ0; 1/. The proof of the strict lower bound 0 ./ > 0 for 2 .0; 1/ comes in two steps. 1. Fix T > 0 and consider the expression
0 D lim
n!1
1 E log u.0; nT / nT
-a.s.
(31)
Partition the time interval Œ0; nT / into n pieces of length T , Ij D Œ.j 1/T; j T /;
j D 1; : : : ; n:
(32)
Use the Markov property of X at the beginning of each piece, to obtain X n Z u.0; nT / D E 0 exp
j D1 Ij
D
X
n Y
X .s/; s ds ı0 .X .nT //
Z E xj 1 exp
x1 ;:::;xn1 2Zd j D1
T 0
X .s/; .j 1/T C s ds ıxj .X .T // (33)
.T /
with x0 D xn D 0. Next, for x; y 2 Zd , let E x;y denote the conditional expectation over X given that X .0/ D x and X .T / D y, and abbreviate, for 1 j n, Z / .T / exp .j / D E E.T x;y x;y Then we can write Z E xj 1 exp D
pT .xj
T 0
T
X .s/; .j 1/T C s ds
:
(34)
0
X .s/; .j 1/T C s ds ıxj .X .T //
/ xj 1 / E.T xj 1 ;xj .j /;
(35)
172
J. G¨artner et al.
where we abbreviate pT .x/ D P0 .X .T / D x/, x 2 Zd . Combined with (33), this gives X
u.0; nT / D
n Y
x1 ; ;xn1
D
2Zd
.nT / pnT .0/ E 0;0
! pT .xj
xj 1 /
j D1
n Y j D1
! / E.T xj 1 ;xj .j /
!
n Y j D1
.T / E X ..j 1/T /;X .j T / .j /
(36) :
2. To estimate the last expectation in (36), abbreviate I D .t /t 2I , I Œ0; 1/ and apply Jensen’s inequality to (34), to obtain Z / E.T .j / D exp x;y
T 0
/ X E.T .s/; .j 1/T C s ds C C ; T x;y Œ.j 1/T;j T x;y (37)
for some Cx;y .Œ.j 1/T;j T ; T / that satisfies Cx;y Œ.j 1/T;j T ; T > 0 -a.s.
8 x; y 2 Zd ; 1 j n:
(38)
Here, the strict positivity is an immediate consequence of the fact that is not constant (recall condition (6)) and u 7! e u is strictly convex. Combining (36–37) .nT / and using Jensen’s inequality again, this time w.r.t. E 0;0 , we obtain n X .nT / .T / E X ..j 1/T /;X .j T / E log u.0; nT / log pnT .0/ C E E 0;0 j D1
Z
T
X .s/; .j 1/T C s ds
0
C CX ..j 1/T /;X .j T / Œ.j 1/T;j T ; T .nT /
D log pnT .0/ C E E 0;0
n X j D1
!!
.T /
E X ..j 1/T /;X .j T /
!! CX ..j 1/T /;X .j T / Œ.j 1/T;j T ; T ;
(39)
where the middle term in the second line vanishes because of condition (6) and our assumption that E..0; 0// D 0. After inserting the indicator of the event fX ..j 1/T / D X .j T /g for 1 j n in the last expectation in (39), we get
Quenched Lyapunov Exponent for the PAM
E
.nT / E 0;0
n X j D1
.T / E X ..j 1/T /;X .j T /
173
!! CX ..j 1/T /;X .j T / Œ.j 1/T;j T ; T
n X X p.j 1/T .z/ pT .0/ p.nj /T .z/ pnT .0/
j D1 z2Zd
E Cz;z Œ.j 1/T;j T ; T
n CT pT .0/;
(40)
where we abbreviate CT D E Cz;z Œ.j 1/T;j T ; T > 0;
(41)
P note that the latter does not depend on j or z, and use that z2Zd p.j 1/T .z/p.nj /T .z/ D p.n1/T .0/ pnT .0/. Therefore, combining (31) and (39–41), and using that lim
n!1
1 .0/ D 0; log pnT nT
(42)
we arrive at 0 .CT =T /pT .0/ > 0.
t u
2.3 Proof of Theorem 1.2(ii) Proof. In Step 1 we prove the Lischitz continuity outside any neighborhood of 0 under the restriction that 1. This proof is essentially a copy of the proof in G¨artner, den Hollander and Maillard [17] of the Lipschitz continuity of the annealed Lyapunov exponents when is SVM. In Step 2 we explain how to remove the restriction 1. In Step 3 we show that the Lipschitz constant tends to zero as ! 1 when 1. 1. Pick 1 ; 2 2 .0; 1/ with 1 < 2 arbitrarily. By Girsanov’s formula, E0
Z t 2 2 exp .X .s/; s/ ds ı0 .X .t// 0
Z t D E 0 exp .X 1 .s/; s/ ds ı0 .X 1 .t// h
0
exp J.X 1 I t/ log.2 =1 / 2d.2 1 /t D I C II;
i (43)
where J.X 1 I t/ is the number of jumps of X 1 up to time t, I and II are the contributions coming from the events fJ.X 1 I t/ M 2d2tg, respectively,
174
J. G¨artner et al.
fJ.X 1 I t/ > M 2d2tg, with M > 1 to be chosen. Clearly, h i M 2d2 log.2 =1 / 2d.2 1 / t Z t 1 1 .X .s/; s/ ds ı0 .X .t// ; E 0 exp
I exp
(44)
0
II e t P0 J.X 2 I t/ > M 2d2t ;
while
(45)
because we may estimate Z
t
.X 1 .s/; s/ ds t;
(46)
0
and afterwards use Girsanov’s formula in the reverse direction. Since J.X 2 I t/ D J .2d2 t/ with .J .t//t 0 a rate-1 Poisson process, we have 1 log P0 J.X 2 I t/ > M 2d2t D 2d2 I .M / t !1 t
(47)
I .M / D sup M u e u 1 D M log M M C 1:
(48)
lim
with
u2R
Recalling (12–13), we get from (43–47) the upper bound
0 .2 / M 2d2 log.2 =1 / 2d.2 1 / C 0 .1 / _ 2d2 I .M / : (49) On the other hand, estimating J.X 1 I t/ 0 in (43), we have Z t .X 2 .s/; s/ ds ı0 .X 2 .t// E 0 exp 0
expŒ2d.2 1 /t E 0
Z t 1 1 exp .X .s/; s/ ds ı0 .X .t// ; (50) 0
which gives the lower bound
0 .2 / 2d.2 1 / C 0 .1 /:
(51)
Next, for 2 .0; 1/, define D C 0 ./ D lim sup 1 Œ 0 . C / 0 ./;
!0
D 0 ./ D lim inf 1 Œ 0 . C / 0 ./;
!0
(52)
Quenched Lyapunov Exponent for the PAM
175
where ! 0 from both sides. Then, in (49) and (51), picking 1 D and 2 D Cı, respectively, 1 D ı and 2 D with ı > 0 and letting ı # 0, we get D C 0 ./ .M 1/2d
8 M > 1W 2dI .M / 0;
D 0 ./ 2d:
(53)
(The condition in the first line of (53) guarantees that the first term in the right-hand side of (49) is the maximum because 0 ./ 0.) Since limM !1 I .M / D 1, it follows from (53) that D C 0 and D 0 are bounded outside any neighborhood of D 0. 2. It remains to explain how to remove the restriction 1. Without this restriction (46) is no longer true, but by the Cauchy–Schwarz inequality we have II III IV;
(54)
with 1=2 Z t .X 1 .s/; s/ ds ı0 .X 1 .t// III D E 0 exp 2
(55)
0
and h i I V D E 0 exp 2J.X 1 I t/ log.2 =1 / 4d.2 1 /t 11fJ.X 1 I t/ > M 2d2tg
1=2
h i d 1 2d2 C d.22 =1 / t 2 2 2 =1 1 2d 2 =1 1 t E 0 exp J.X I t/ log 1 1=2 1 11fJ.X I t/ > M 2d2tg
D exp
D exp
1=2 h i 2 d 1 2d2 C d.22 =1 / t P 0 J X 2 =1 I t > M 2d2t ; (56)
where in the last line we use Girsanov’s formula in the reverse direction (without ). By (12–13) and condition (7), we have III e c0 t -a.s. for t 0 and some c0 < 1. Therefore, combining (54–56), we get
176
J. G¨artner et al.
II exp
1=2 h i 2 c0 C d 1 2d2 C d.22 =1 / t P 0 J X 2 =1 I t > M 2d2t (57)
instead of (45). The rest of the proof goes along the same lines as in (47–53). 3. Since I .M / > 0 for all M > 1, it follows from (53) that lim sup!1 D C 0 ./ 0. To prove that lim inf!1 D 0 ./ 0, we argue as follows. From (43) with 1 D ı and 2 D , we get E0
Z t exp .X .s/; s/ ds ı0 .X .t// 0
Z t D E 0 exp .X ı .s/; s/ ds ı0 .X ı .t// 0
h
exp J.X ı I t/ log e2dıt
ı
2dıt
i
Z t