ebook img

Weak and almost sure limits for the parabolic Anderson model with heavy tailed potentials PDF

0.43 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Weak and almost sure limits for the parabolic Anderson model with heavy tailed potentials

TheAnnalsofAppliedProbability 2008,Vol.18,No.6,2450–2494 DOI:10.1214/08-AAP526 (cid:13)c InstituteofMathematicalStatistics,2008 WEAK AND ALMOST SURE LIMITS FOR THE PARABOLIC 9 0 ANDERSON MODEL WITH HEAVY TAILED POTENTIALS 0 2 By Remco van der Hofstad,1 Peter Mo¨rters2 n and Nadia Sidorova3,4 a J Eindhoven University of Technology, University of Bath and 6 University College London 1 WestudytheparabolicAndersonproblem,thatis,theheatequa- ] R tion ∂ u=∆u+ξu on (0,∞)×Zd with independent identically dis- t P tributed random potential {ξ(z):z∈Zd} and localized initial condi- h. tion u(0,x)=10(x). Ourinterest is in thelong-term behavior of the randomtotalmassU(t)= u(t,z)oftheuniquenonnegativesolu- t z a tioninthecasethatthedistributionofξ(0)isheavytailed.Forthis, m P we study two paradigm cases of distributions with infinite moment [ generating functions: thecase of polynomial or Pareto tails, and the case of stretched exponential or Weibull tails. In both cases we find 3 asymptotic expansions for the logarithm of the total mass up to the v firstrandomterm,whichwedescribeintermsofweaklimittheorems. 7 2 Inthecaseofpolynomialtails,alreadytheleadingtermintheexpan- 5 sion is random. For stretched exponential tails, we observe random 6 fluctuationsinthealmostsureasymptoticsofthesecondtermofthe 0 expansion,butin theweak sensethefourthterm isthefirstrandom 6 term of the expansion. The main tool in our proofs is extreme value 0 theory. / h t a m : v Received June 2006; revised July 2007. i 1Supportedin part by theNetherlands Organization for ScientificResearch (NWO). X 2Supported by an Advanced Research Fellowship and by Grant EP/C500229/1 of the r Engineering and Physical Sciences Research Council. a 3Supportedby Grant EP/C500229/1 of theEPSRC. 4Supportedby theEuropean Science Foundation (ESF). AMS 2000 subject classifications. Primary 60H25, 82C44; secondary 60F05, 60F15, 60G70. Key words and phrases. Anderson Hamiltonian, parabolic Anderson problem, long termbehavior,intermittency,localization,randomenvironment,randompotential,partial differential equations with random coefficients, heavy tails, extreme value theory, Pareto distribution, Weibull distribution, weak limit theorem, law of theiterated logarithm. This is an electronic reprint of the original article published by the Institute of Mathematical Statistics in The Annals of Applied Probability, 2008,Vol. 18, No. 6, 2450–2494. This reprint differs from the original in pagination and typographic detail. 1 2 R.VAN DER HOFSTAD,P.MO¨RTERS AND N.SIDOROVA 1. Introduction. 1.1. Motivation and background. We consider the heat equation with randompotentialontheintegerlattice Zd andstudytheuniquenonnegative solution to the Cauchy problem with localized initial data: ∂ u(t,z)=∆du(t,z)+ξ(z)u(t,z), (t,z) (0, ) Zd, t ∈ ∞ × (1.1) u(0,z)=1 (z), z Zd, 0 ∈ where ∆d denotes the discrete Laplacian, (∆df)(z)= [f(y) f(z)], z Zd,f:Zd R, − ∈ → y∼z X and the potential ξ(z):z Zd is a collection of independent, identically { ∈ } distributed random variables. The parabolic problem (1.1) is called the parabolic Anderson model. It serves as a natural model for random mass transport in a random medium; see, for example, [4] for physical motivation of this problem, [2, 7] for some interesting recent work, and [6] for a recent survey of the field. Alot ofthemathematical interest intheparabolicAndersonmodelis due to the fact that it is the prime example of a model exhibiting intermittency. This means that, for large times t, the overwhelming contribution to the total mass U(t):= u(t,z) zX∈Zd ofthesolutionisconcentrated onasubsetof Zd consistingofasmallnumber of islands located very far from each other. This behavior becomes manifest in the large-time asymptotic behavior of U(t) and of its moments. For ex- ample, it has been proposed in the physics literature [13] (see also [6]) to define the model as intermittent if, in our notation, for p<q, (E[U(t)p])1/p lim =0. t↑∞ (E[U(t)q])1/q The large-time asymptotic behavior of U(t) has been studied in some detail for potentials with finite exponential moments, that is, if E[exp hξ(0) ]< { } , for all h>0. Important examples include [1, 3] for the case of bounded ∞ potentials, [8,9]focusingonthevicinity of double-exponentialdistributions, and [10], which attempts a classification of the potentials according to the long-term behavior of U(t). Most of the existing results approach the prob- lem via the asymptotics of the moments of U(t) and almost sure results are derived using Borel–Cantelli type arguments. LIMITS FOR THE PARABOLICANDERSONMODEL 3 If the potential fails to have finiteexponential moments, then the random variable U(t) fails to have any moments, and new methods have to befound to study its almost sure behavior. It is believed that for such potentials the bulkof themass U(t) is concentrated in asmall numberof “extreme” points of the potential. This suggests an approach using extreme value theory. It is this approach to the long-term behavior of the parabolic Anderson model that we follow in this paper. Inallcasesofpotentialswithfiniteexponentialmoments,itturnsoutthat the two leading terms in the asymptotic expansion of logU(t) are determin- istic, an effect which we did not expect to hold for potentials with heavier tails. Our investigation is motivated by this conjecture, and therefore, we are particularly interested in finding the first (nondegenerate) random term in the asymptotic expansion of logU(t). For this purpose, we consider two classes of heavy-tailed potentials: Potentials with stretched exponential tail, or Weibull potentials. The dis- • tribution function of ξ(0) is given as F(x)=1 e−xγ for some positive − γ<1. This class represents potentials with an intermediately heavy tail. Potentials with polynomial tail, or Pareto potentials. The distribution • function of ξ(0) is given as F(x)=1 x−α, for some α>d. This class − represents the most heavy-tailed potentials. Note that the condition γ <1 is necessary to make the potentials heavy- tailed, and recall from [8] that the condition α>d is necessary (and suf- ficient) for the existence of a unique solution of the parabolic Anderson problem. A fairly complex picture emerges from the main results of this paper, which are formulated precisely in Section 1.2 below: In the case of potentials with polynomial tails, already the leading order • term is nondegenerate random, and we determine its asymptotic distribu- tion, if normalised by tα/(α−d)(logt)−d/(α−d), which is of extremal Fr´echet type with shape parameter α d. − In the case of stretched exponential tails, the first term in the expan- • sion, which is of order t(logt)1/γ, is deterministic. For the second term, which is of order t(logt)1/γ−1loglogt, the almost sure limsup and lim- inf differ by a constant factor, and the weak limit agrees with the lat- ter. The third term in the weak expansion is still deterministic of or- der t(logt)1/γ−1logloglogt. Only the fourth term in the weak expansion, whichisofordert(logt)1/γ−1,isnondegenerateandproperlyrenormalized converges to a Gumbel distribution. These results are in line with the underlying belief that for heavy-tailed potentials the bulk of the mass U(t) is concentrated in a small number of 4 R.VAN DER HOFSTAD,P.MO¨RTERS AND N.SIDOROVA “extreme” points of the potential. However, this is not proved here. Attack- ing this problem requires a wider range of methods and is the subject of ongoing research. 1.2. Main results of the paper. We now give precise statements of our results. As we consider two classes of potentials and study two types of convergence for each class, we formulate four theorems. Recall that U(t) is the total mass of the solution of (1.1) and abbreviate 1 L := logU(t). t t Throughout this paper we denote by F(x)=P(ξ(0) x) the distribution ≤ function of ξ(0) and define M :=maxξ(z), r |z|≤r where is the 1-norm on Zd. |·| The first two theorems are devoted to potentials with polynomial tails. Theorem 1.1 (AlmostsureasymptoticsforParetopotentials). Suppose that the distribution of ξ(0) has a polynomial tail, that is, F(x)=1 x−α, − x 1, for some α>d. Then, almost surely, ≥ logL d/(α d)logt d 1 limsup t− − = − for d>1, loglogt −α d t→∞ − logL d/(α d)logt 1 t limsup − − = for d=1 logloglogt α d t→∞ − and logL d/(α d)logt d liminf t− − = for d 1. t→∞ loglogt −α d ≥ − Looking at convergence in law, denoted by , we find that the liminf ⇒ above becomes a limit logL d/(α d)logt d t − − as t . loglogt ⇒ −α d ↑∞ − This follows from a much more precise result, which identifies the order of magnitude of L itself and the limit distribution of the rescaled random t variable L . t Theorem 1.2 (Weak asymptotics for Pareto potentials). Suppose that the distribution of ξ(0) has a polynomial tail, that is, F(x)=1 x−α, x 1, − ≥ for some α>d. Then, as t , ↑∞ t −d/(α−d) L Y where P(Y y)=exp θyd−α t logt ⇒ ≤ {− } (cid:18) (cid:19) LIMITS FOR THE PARABOLICANDERSONMODEL 5 and (α d)d2dB(α d,d) θ:= − − , dd(d 1)! − where B denotes the beta function. Remark 1. Recall from classical extreme value theory (see, e.g., [5], Table 3.4.2) that the maximum of td independent Pareto distributed ran- dom variables with shape parameter α d has qualitatively the same weak − asymptotic behavior as our logarithmic total mass L . An interpretation of t this fact is that in the parabolic Anderson modelwith polynomial potential, the random fluctuations of the potential dominate over the smoothing effect of the Laplacian. The results for potentials with polynomial tails prepare the ground for the discussion of the considerably more demanding case of potentials with stretched exponential tails. The next two theorems are the main results of this paper. Theorem 1.3 (Almost sure asymptotics for Weibull potentials). Sup- pose that ξ(0) has distribution function F(x)=1 e−xγ, x 0, for some − ≥ positive γ<1. Then, almost surely, L (dlogt)1/γ limsup t− =d(1/γ2 1/γ)+1/γ, (dlogt)1/γ−1loglogt − t→∞ L (dlogt)1/γ liminf t− =d(1/γ2 1/γ). t→∞ (dlogt)1/γ−1loglogt − Thedifference between liminf and limsup in Theorem 1.3 is dueto fluctu- ations from the liminf-behavior which occur at very rare times. Indeed, we have, as t , ↑∞ L (dlogt)1/γ t− d(1/γ2 1/γ). (dlogt)1/γ−1loglogt ⇒ − Thisis a consequence of thenexttheorem, whichalso extends theexpansion in the weak sense up to the first (nondegenerate) random term. Theorem 1.4 (Weak asymptotics for Weibull potentials). Suppose that ξ(0) has distribution function F(x) = 1 e−xγ, x 0, for some positive − ≥ γ<1. Then, (L (dlogt)1/γ d(1/γ2 1/γ)(dlogt)1/γ−1loglogt t − − − +(d/γ)(dlogt)1/γ−1logloglogt)((dlogt)1/γ−1)−1 Y, ⇒ 6 R.VAN DER HOFSTAD,P.MO¨RTERS AND N.SIDOROVA where Y has a Gumbel distribution P(Y y)=exp θe−γy ≤ {− } with θ:=2ddd(1/γ−1). Remark 2. The almost sure results of Theorem 1.3 also hold in the case of (standard) exponentially distributed potentials, that is, when γ=1. Extendingthemethodsof thispaper,Lacoin [11]hasshownthatinthiscase L dlogt t liminf − = (d+1) almost surely t→∞ logloglogt − and L dlogt+dlogloglogt Y, t − ⇒ where Y has a Gumbel distribution P(Y y)=exp 2de−y+2d . ≤ {− } 1.3. Outline of the proofs. Let (X :s [0, )) be the continuous-time s simple random walk on Zd with generator∈∆d. B∞y P and E , we denote the z z probability measure and the expectation with respect to the walk starting at z Zd. By the Feynman–Kac formula (see, e.g., [8], Theorem 2.1), the ∈ unique solution of (1.1) can be expressed as t u(t,z)=E exp ξ(X )ds 1 (X ) , 0 s z t (cid:20) (cid:26)Z0 (cid:27) (cid:21) and the total mass of the solution is hence given by t (1.2) U(t)=E exp ξ(X )ds . 0 s (cid:20) (cid:26)Z0 (cid:27)(cid:21) Inthisrepresentation,themaincontributiontoU(t)comesfromtrajectories oftherandomwalkwhich,ontheonehand,spendalotoftimeatsiteswhere thevalueofthepotentialislargebut,ontheotherhand,arenottoounlikely under the measure P . In particular, the contributing trajectories will not 0 visit sites situated too far from the origin. We introduce two variational problems depending on the potential ξ: r r r (1.3) N(t):=max M log and N(t):=max M logM , r r r r>0 − t 2det r>0 − t (cid:20) (cid:21) (cid:20) (cid:21) which reflect the interaction of these two factors. Indeed, up to an additive error which goes to zero, N(t) 2d is an upperand N(t) 2d a lower bound − − forL .Formostofourapplicationstheseboundsaresufficientlyclosetoeach t other. Our proofs are based on first making these approximations precise, and then investigating the asymptotics of the random variational problems by means of extreme value theory. LIMITS FOR THE PARABOLICANDERSONMODEL 7 Toseetherelation between U(t)andtheapproximatingfunctionsinmore detail, note that the probability that a continuous-time random walk visits a point z Zd with z =r √t is roughly ∈ | | ≫ (2dt)r r P(X =z)/e−2dt exp rlog 2dt . t r! ≈ − 2det − (cid:26) (cid:27) If X r for all s [0,t], then tξ(X )ds M t. This gives the upper | s|≤ ∈ 0 s ≤ r bound R 1 r r L = logU(t)/max M log 2d=N(t) 2d. t r t r>0 − t 2det − − (cid:20) (cid:21) For a lower bound, we fix a site z Zd and ρ (0,1), and consider only ∈ ∈ trajectories which remain constant equal to z duringtheentire time interval t(ρ,1]. The probability of this strategy is 1 |z| (2dρt)|z| P(X =z s [ρt,t])' e−2dρt e−2d(1−ρ)t s ∀ ∈ 2d z ! (cid:18) (cid:19) | | z exp z log | | 2dt , ≈ −| | eρt − (cid:26) (cid:27) while the contribution of these trajectories to the exponent is tξ(X )ds t(1 ρ)ξ(z). Optimizing over z Zd and ρ (0,1), we arrive0at as lowe≥r − ∈ ∈ R bound of the form 1 z z L = logU(t)'max max (1 ρ)ξ(z) | |log | | 2d. t t z∈Zd0<ρ<1 − − t eρt − (cid:20) (cid:21) Interchanging the maxima over ρ and z, and maximizing over ρ (0,1), ∈ gives z z z max max (1 ρ)ξ(z) | |log | | = max ξ(z) | |logξ(z) N(t), z∈Zd0<ρ<1 − − t eρt |z|<tξ(z) − t ≈ (cid:20) (cid:21) (cid:20) (cid:21) where the condition z <tξ(z) arises from ρ<1 and can be dropped when | | t is sufficiently large. Supposing for the moment that these approximations are sufficiently ac- curate, we can use extreme value theory to derive asymptotics for N(t) and N(t) which then extend to L . While the almost sure results follow directly t from results on the almost sure behavior of maxima of i.i.d. random vari- ables, the key to the weak limit statements is to write N(t) and N(t) as a functional of the point process ε (z/At,(ξ(z)−Bt)/Ct) zX∈Zd 8 R.VAN DER HOFSTAD,P.MO¨RTERS AND N.SIDOROVA for suitable scaling functions A , B , C and show convergence of the point t t t processes along with the functionals. The nature of our functionals will re- quire a somewhat nonstandard set-up, but the core of the arguments in this part of the proof is using familiar techniques of extreme value theory. The feasibility of this strategy of proof depends on the quality of the approximation of L by N(t) 2d, respectively, N(t) 2d. In the case of t − − potentials with polynomial tails, the arguments sketched above show that L /N(t) 1 almost surely, which suffices to infer both weak and almost t → sure limits of L from those of N(t). These arguments are technically less t demanding, which allows us to exhibit the strategy of proof very clearly, while in the harder case of potentials with stretched exponential tails tech- nical difficulties may obscure the view to the underlying basic ideas. In the latter casetheboundsN(t)andN(t)havethesamealmostsurebehaviorup to the second term, but their weak behavior when scaled as in Theorem 1.4 differs in that the limiting laws are Gumbel with different location parame- ter. A considerably refined calculation allows us to show that in probability L can be approximated by N(t) up to an additive error of order smaller t than (logt)1/γ−1, and hence, the weak limit theorem for L coincides with t that of N(t). This is the most delicate part of the proof, where we rely on a thorough study of the behavior of the potential along random walk paths. The paper is organized as follows. In Section 2 we prove preliminary re- sults, which will be relevant for both classes of potentials. We start Sec- tion2.1withLemma2.1,whereweshowthatN(t)andN(t)arewelldefined and can be expressed directly in terms of the potential ξ. In Lemmas 2.2 and 2.3 we compute upper and lower bounds for L in a form which will t be simplified to N(t) and N(t) in the course of the proofs. In Section 2.2 we prepare the discussion of the extreme value behavior of the bounds with two general lemmas dealing with point processes derived from i.i.d. random variables. Section 3 is devoted to potentials with polynomial tails. In Section 3.1 we analyze the bounds computed in Section 2.1 and the asymptotic behavior of the optimal value r in the definition of N(t) in (1.3). We infer from this that L /N(t) 1 (see Proposition 3.2) and therefore already the first term t → of the asymptotic expansion of L is nondeterministic. Since M is the main t r ingredient in the definition of N(t), we need to find sharp bounds for M , r whichwedoinSection 3.2 usingextremevaluetheory.InSection 3.3wefind the weak asymptotics for N(t), and hence of L , using the point processes t technique developed in Section 2.7. This proves Theorem 1.2. Finally, in Section 3.4, we use the bounds for M and the weak convergence of N(t) to r find the almost sure asymptotics of N(t), and hence of L , which is stated t in Theorem 1.1. In Section 4 we discuss stretched exponential potentials. This is consider- ably harder than the polynomial case, and we have to refine the approxima- tion of L in several steps. In Section 4.1 we find almost sure bounds for M t r LIMITS FOR THE PARABOLICANDERSONMODEL 9 with a high degree of precision, using extreme value theory. Then we show in Proposition 4.2 that N(t) 2d and N(t) 2d are indeed upper and lower − − bounds for L up to an additive error converging to zero. In Section 4.2 we t find weak asymptotics for N(t) and N(t), which turn out to be different in thefourthtermandarethereforeinsufficienttogivetheweakasymptoticfor L . In Section 4.3 we therefore show that (L N(t))/(logt)1/γ−1 0. This t t − ⇒ approximation, formulated as Proposition 4.6,implies that theweak asymp- totics of N(t) apply in the same form to L , and this completes the proof t of Theorem 1.4. Finally, in Section 4.4, we study the almost sure behavior of N(t) and of N(t), using our knowledge of the behavior of the maximum M . It turns out that N(t) and N(t) are so close to each other that we can r get the almost sure upper and lower asymptotics for L as stated in The- t orem 1.3, additionally using our knowledge of the weak asymptotics from Theorem 1.4. 2. Notation and preliminary results. Denote by F¯(x):=1 F(x) the − tail of the potential and by J the number of jumps of the random walk t (X :t 0) before time t. Denote by κ (r)rd the number of points in the t d d-dime≥nsional ball of radius r in Zd with respect to the 1-norm and κ := d lim κ (r). One can easily check that κ =2d/d!, but we only need to r→∞ d d know that it is nonzero (which follows from the equivalence of all norms on Euclidean space). Throughoutthepaper,weusethenotation o() andO() fordeterministic · · functions of one variable (which we specify if there is a risk of confusion). If those functionsareallowed to dependonthepotential ξ or another variable, then we indicate this by the lower index, writing, for example, o and O . ξ ξ We say that a family of events (E :t 0) holds t ≥ eventually for all t there exists T >0 such that E holds for all t>T; t ⇔ infinitely often there exists a sequence t such that E n t ⇔ ↑∞ holds for all t=t . n 2.1. Bounds for L and their properties. The random functions N(t) t and N(t) have been defined in terms of the maximum M . The next lemma r provides expressions directly in terms of the potential ξ. This, as well as the bounds for L , which we compute later on, is proved under a mild condition t on the growth of the maximum M of the potential ξ, as r goes to infinity. r Later we shall see that this condition is satisfied both for the stretched exponential potentials and for the potentials with polynomial tails. Lemma 2.1 [N(t) and N(t) in terms of ξ]. Let η (0,1). Assume that ∈ the distribution of ξ(0) is unbounded from above and that, almost surely, M rη eventually for all r. Then, almost surely: r ≤ 10 R.VAN DER HOFSTAD,P.MO¨RTERS AND N.SIDOROVA (a) the maxima N(t) and N(t) in (1.3) are well defined and the maxi- mizing radii r(t) and r(t) satisfy r(t) and r(t) as t ; →∞ →∞ →∞ (b) if r(t)>2dt, then N(t)=max [ξ(z) |z|log |z| ]; z∈Zd − t 2det (c) N(t)=max [ξ(z) |z|log ξ(z)]eventuallyforallt,where log (x):= z∈Zd − t + + log(x 1). ∨ Proof. (a) The maxima in N(t) and N(t) are attained because M r is a right continuous step function which grows slower than rlog r and t 2det r logM asr ,foreach fixedt.Moreover,asthepotentialdistributionis utnbounrdedfr→om∞above,wehave M as r .Since rlog r 0and r →∞ →∞ t 2det → r logM 0 as t for any fixed r, we obtain N(t) and N(t) . t r → →∞ →∞ →∞ On the other hand, for any R>0 and t large enough, we have r r R R t→∞ max M log M + log M < r R R r≤R − t 2det ≤ t 2det −→ ∞ (cid:20) (cid:21) (cid:12) (cid:12) (cid:12) (cid:12) and (cid:12) (cid:12) (cid:12) (cid:12) r R t→∞ max M logM M + logM M < , r r R R R r≤R − t ≤ t | | −→ ∞ (cid:20) (cid:21) which implies that r(t)>R and r(t)>R eventually. (b) Observe that at r =2dt the function r rlog r takes its mini- 7→ t 2det mum, and that it is decreasing on (0,2dt) and increasing on (2dt, ). De- ∞ note by z a point such that M =ξ(z ) and z r(t). If z 2dt, then t r(t) t t t | |≤ | |≤ M =ξ(z )=M M and, hence, by monotonicity of M , we have r(t) t |zt| ≤ 2dt r M =M . Since, by monotonicity, the value of rlog r at r=r(t)>2dt 2dt r(t) t 2det is strictly greater than its value 2d at r=2dt, we obtain − r(t) r(t) M log <M +2d, r(t) 2dt − t 2det whichisacontradiction tor(t)maximizingN(t)in(1.3).Hence,2dt< z t | |≤ r(t). Since M =ξ(z ), we obtain, again using monotonicity, that r(t) t r(t) r(t) z z t t M log ξ(z ) | |log | | . r(t) t − t 2det ≤ − t 2det This proves the upper bound for N(t). The lower bound is obvious. (c) Denote by z a point such that ξ(z )=M and z r(t). Since t t r(t) t | |≤ r(t) , we obtain M =ξ(z )>1 eventually. Then, for large t, r(t) t →∞ z r(t) r(t) t ξ(z ) | |log ξ(z ) ξ(z ) log ξ(z )=M logM , t − t + t ≥ t − t + t r(t)− t r(t) which proves the upper bound for N(t). Toprovethelowerbound,notethatsinceM >1eventuallyand r logM r t r → 0 as t for any fixed r, we obtain N(t)>1 eventually. Let us assume t →∞

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.