FLUCTUATION EXPONENTS AND LARGE DEVIATIONS FOR DIRECTED POLYMERS IN A RANDOM ENVIRONMENT

Size: px
Start display at page:

Download "FLUCTUATION EXPONENTS AND LARGE DEVIATIONS FOR DIRECTED POLYMERS IN A RANDOM ENVIRONMENT"

Transcription

1 FLUCTUATION EXPONENTS AND LARGE DEVIATIONS FOR DIRECTED POLYMERS IN A RANDOM ENVIRONMENT PHILIPPE CARMONA AND YUEYUN HU Abstract. For the model of directed polymers in a gaussian random environment introduced by Imbrie and Spencer, we establish: a scaling inequality between the volume exponent and the fluctuation exponent of the free energy; a Large Deviations Principle for the end position of the polymer under the Gibbs measure; a relationship between the volume exponent and the rate function of the Large Deviations Principle.. Introduction Let us first describe the model of directed polymers in a random environment introduced by Imbrie and Spencer 2.The random media is a family (g(k, x), k, x Z d ) of independent identically distributed random variables defined on a probability space (Ω, F, P). Let S n be the simple symmetric random walk in Z d. Let P x be the probability measure of (S n ) n N starting at x Z d and let E x be the corresponding expectation. The object of our study is the Gibbs measure (n) defined by (n) def f = E 0 f(s)e βh n(g,s), H n (g, γ) def = Z n where Ω n is the set of nearest neighbour paths of length n: n g(i, γ(i)). (.) Ω n def = { γ :, n Z d, γ(k) γ(k ) =, k = 2,..., n }, and Z n is the partition function: i= (.2) Z n = Z n (g, β) = E 0 e βh n(g,s). Date: January 24, Mathematics Subject Classification. Primary 60K37. Key words and phrases. Random Environment; Directed Polymers; Large Deviations; Concentration of Measure.

2 2 P. CARMONA AND Y. HU In other words, for a given realization g(ω) of the environment, the Gibbs measure gives to a polymer γ having an energy H n (g, γ) at temperature T = β, a weight proportional to eβhn(g,γ). Dating back to the pioneer work of Imbrie and Spencer 2, the situation in dimension d 3 is well understood for small β > 0. There exists some constant β 0 > 0 such that for β < β 0, S n is diffusive under (n). Theorem.. (Imbrie and Spencer 2, Bolthausen 3, Sinai 8, Albeverio and Zhou ) If d 3, then there exists β 0 = β 0 (d) > 0 such that for β < β 0, Sn 2 (n) (.3) n P a.s.. It is believed in many physics papers (see e.g. 6, 3) that for small dimension d =, 2 and β small enough S n 2 (n) behaves as n 2ζ for some ζ >. However no rigorous proof has been given yet. 2 The aim of this paper is to establish rigorous results when the random media is given by i.i.d. N (0, ) gaussian random variables. Following Piza 6 we define the volume exponent (.4) ζ def { } (n) = inf α > 0 : ( max k n S k n α ) in P probability, and the fluctuation exponent of the free energy (.5) χ = sup { α > 0 : Var(log Z n ) n 2α for large enough n }. We shall establish a scaling inequality similar to the one obtained by Piza 6 in a different framework. He works with a polymer model more related to oriented percolation, where furthermore the potentials g are assumed non positive. Theorem.2. For all d and β 0, χ dζ. 2 The following Large Deviations result may seem at first sight highly uncorrelated to these two exponents.

3 3 Theorem.3. The distribution of S n under the Gibbs measure (n) n satisfy a Large Deviations Principle for closed sets with a (deterministic) good rate function K β. For every closed set C of, d, (n) lim sup n n log Sn n C inf K β(θ) P a.s.. θ C We shall prove the existence of a pointwise rate function Proposition.4. There exists a deterministic nonnegative convex function I β : (, ) d R +, such that I β (0) = 0. for θ (, ) d Q d, n log (n) (Sn =nθ) Iβ (θ), P a.s.. where we take the limit along n such that P 0 (S n = nθ) > 0. I β (θ) K β (θ) However, there is a close relationship between the volume exponent and the shape of the rate function. Theorem.5. Assume that for some δ, C > 0 the rate function satisfies: (.6) I β (θ) C θ δ (θ (, ) d ). Then, the volume exponent satisfies: (.7) ζ 2δ. In particular, if lim n E log Z n(β) = 2 β2, which is the case if d 3 and β is small enough 4, then ζ 3/4. When (S n ) is replaced by a discrete time Brownian motion and g(, ) by a gaussian fields, Petermann 5 showed ζ 3/5 in the onedimensional case and Mejane 4 showed ζ 3/4 for all d. But it does not seem clear to obtain a invariance principle between these two models. Acknowledgements. We are very much indebted to M. Talagrand s First Course on spin glasses 20 from which we learned how to use effectively concentration of measure and integration by parts. Furthermore, we would like to stress the fact that while in spin glasses the covariance structure of the energies of configurations is influenced by the exchangeability of the individuals spins, in the polymer model it is influenced by the Markov property of the underlying random walk.

4 4 P. CARMONA AND Y. HU 2. Notations and basic tools In addition to the partition function Z n, we define the partition function starting from x: Z n (x) = Z n (x, g) def = E n x e βh n (g,s), H n (g, γ) = g(i, γ(i)), and the point to point partition function i= Z n (x, y) = Z n (x, y, g) = E x e βh n (g,s) (Sn=y). This function is strictly positive only if there exists a nearest neighbour path of length n connecting x to y, i.e. P x S n = y > 0. We shall note this x n y. Eventually, let θ n denote the time shift of order n on the environment: Our first tool is the (θ n g)(k, x) = g(k + n, x) (x Z d, k ). Lemma 2. (Markov Property). For every integers n, m and every x, y Z d, we have: (2.) Z n+m (x) = y Z n (x, y, g)z m (y, θ n g) (2.2) Z n+m (x, z) = y Z n (x, y, g)z m (y, z, θ n g). Proof. The two identities are proved similarly, with the help of the Markov property for the random walk S n. Indeed, Therefore, H n+m (g, S) = n+m i= g(i, S i ) = H n (g, S) + H m (θ n g, S n+. ). Z n+m (x, g) = E x e βh n(g,s) e βhm(θng,s n+.) = E x e βh n (g,s) Z m (S n, θ n g) = y E x e βh n(g,s) (Sn =y) Zm (y, θ n g) = y Z n (x, y, g)z m (y, θ n g). Let us recall the concentration of measure property of Gaussian processes (see Ibragimov and al. ).

5 5 Proposition 2.2. Consider a function F on R M and assume that its Lipschitz constant is at most A, i.e. F (x) F (y) A x y (x, y R M ), where x denotes the euclidean norm of x. Then if g = (g,..., g M ) are i.i.d. N (0, ) we have P ( F (g) E F (g) u) exp( u2 ) (u > 0). 2A2 Following Talagrand 9, we apply this Proposition to partition functions. Proposition Define for n integer p n (β) = E log Z n n. Then, for any u > 0, and x n 0, (2.3) (2.4) ( ) P n log Z n p n (β) u exp( nu2 2β 2 ) P ( log Z n (0, x) E log Z n (0, x) u) exp( u2 2nβ 2 ). 2. Let ν > 2. Then almost surely there exists n 0 such that for every n n 0 : (2.5) (2.6) log Z n (β) np n (β) n ν log Z n (0, x) E log Z n (0, x) n ν (x Z d, x n 0). 3. Let ν >. There exists a constant C = C(ν, β) > 0 such that: 2 E exp(n ν (log Z n (0, x) E log Z n (0, x))) C (n, x n 0). Proof.. We consider the function F : R M R defined by n F (z) = log E 0 exp(β z i,si ) = log E 0 exp(β = log E 0 e β as.z i= n z i,x (Si =x)) i= x i, where a γ is the vector with coordinates: a γ i,x = (γ(i)=x) ( i n, x i). Cauchy-Schwarz inequality yields a γ.z a γ.z a γ z z = n z z.

6 6 P. CARMONA AND Y. HU Therefore, F has Lispschitz constant at most A = β n, and we obtain the concentration of measure inequality (2.3). The inequality (2.4) is obtained in the same way. 2. The second part of the Proposition is proved by introducing the events: A n = x Z d : x n{ log Z n (0, x) E log Z n (0, x) n ν } { log Z n (β) np n (β) n ν }. Then, P (A n ) c d n d exp( n2ν ), 2β 2 n P (A n) < + and we conclude by Borel Cantelli s Lemma. 3. The third part is a straightforward upper-bound using the concentration inequality E e n ν (log Z n (0,x) Elog Z n (0,x)) ( ) = P e n ν (log Z n(0,x) Elog Z n(0,x)) v dv P ( log Z n (0, x) E log Z n (0, x) n ν log v) dv exp ( (log ) v)2 n 2ν dv 2β 2 exp ( C 4 (log v) 2) dv = C 5 < +. Eventually let us recall the well known result (see e.g. Talagrand 20) Lemma 2.4. Let (g(i)) i N be a family of N (0, ) random variables, not necessarily independent. Then, E max g(i) 2 log N. i N Proof. This short proof was given by M. Talagrand during the Ecole d été de Saint-Flour, but was not incorporated in the notes 20. We let g = max i N g(i). Then for all real number β, by Jensen s inequality N Ne β2 2 = E e βg(i) E e βg exp(βe g ). i= Therefore, β2 +log N βe 2 g and optimizing for β = 2 log N yields the desired result.

7 7 3. A scaling inequality involving the volume and the fluctuation exponents The following lemma is elementary, but nevertheless gives useful lower bounds on the variance: Lemma 3.. Let X L 2 (Ω, F, P) and assume that G,..., G k,... is a sequence of mutually independent sub-σ-fields of F. We have ( ) Var(X) Var E X G k. k= Lemma 3.2. Denote by g = d N (0, ) a standard real-valued Gaussian variable. There exists some constant c β > 0 such that for all u, v 0, we have ( ) Cov log(u + e βg ), log(v + e βg ) ( c β max 0, ı (u,v ), ) uv ı (u>,v>). Proof. Denote by f(u, v) the above covariance. Since f(u, v) = Cov ( log(+ u eβg ), log( + v eβg ) ), we get lim u f(u, v) = 0. Let g be an independent copy of g, we have (3.) 2 f u v (u, v) = Cov( u + e, ) βg v + e βg = E (u + e βg )(v + e βg ) (u + e βg )(v + e βeg ) e βeg e βg = E (u + e βg )(v + e βg )(v + e βeg ) (e βeg e βg )(u + e βeg ) = E (u + e βg )(u + e βeg )(v + e βg )(v + e βeg ) (e βeg e βg )e βeg = E (u + e βg )(u + e βeg )(v + e βg )(v + e βeg ) = 2 E (e βeg e βg ) 2, (u + e βg )(u + e βeg )(v + e βg )(v + e βeg ) where the last equality is obtained by interchanging g and g. Remark that for x, y 0, f(x, y) = x f f(u, y)du = u Going back to (3.), we remark that inf 0 u 2,0 v 2 x du 2 f u v (u, v) = c β <, y dv 2 f (u, v) 0. u v

8 8 P. CARMONA AND Y. HU and for all u, v, f (u, v) = u v 2u 2 v E (e βeg e βg ) 2 2 ( + u eβg )( + u eβeg )( + v eβg )( + v eβeg ) From the above estimates, the desired conclusion follows (the constant c β may be smaller). c βu 2 v 2. Proof of Theorem.2. Applying Lemma 3. with {G k, k } = { σ(g(j, x)), j n, x Z d}, we get ( ) ( ) Var log Z n (β) Var E log Z n (β) g(j, x). j n,x Z d Fix j n and x Z d. Denote by D n (g, S) def = exp We have ( β ) n g(i, S i). Z n (β) = E 0 Dn (g, S) (Sj x) +E0 Dj (g, S) (Sj =x) e βg(j,x) Z n j (x, g θ j ) It follows that log Z n (β) = log ) (Y +e βg(j,x) +log Z n j (x, g θ j )E 0 Dj (g, S) (Sj =x), with (here we can only consider those j and x such that P 0 S j = x > 0) Y def E 0 Dn (g, S) (Sj x) = Z n j (x, g θ j )E 0 Dj (g, S) (Sj =x) is independent of g(j, x). Since Z n j (x, g θ j )E 0 Dj (g, S) (Sj =x) is also independent of g(j, x), we get ( ) Var E log Z n (β) g(j, x) = E P (Y dy) y>0 = (( c β max c β 4 E ( P (Y dy )P (Y dy 2 ) Cov Y = Var (E log(y + e βg(j,x) ) g(j, x) ) log(y + e βg(j,x) ) E log(y + e βg(j,x) ) 2 ) 2, P (Y ) (E ) 2) Y (Y >) 2, ) log(y + e βg(j,x) ), log(y 2 + e βg(j,x) ) where the first inequality is due to Lemma 3.2. Recalling the definition of Y, we remark that Y = (Sj =x) (n) e βg(j,x) (Sj =x) (n) e βg(j,x) (Sj =x) (n),

9 9 which in view of Lemma 3. imply that Var(log Z n ) c ( β E ( e βg(j,x) (Sj =x) (n))) 2. 4 j n,x Z d Pick up ζ > ζ. Cauchy-Schwarz inequality implies that (E ( e βg(j,x) (Sj =x) (n))) 2 j n, x n ζ ( j n, x n ζ E ( e βg(j,x) (Sj=x) (n))) 2 where ( n ζ d ( n ζ d j n, x n ζ E j n, x n ζ E j n j n, x n ζ ( e M n (g) (Sj =x) (n))) 2 ( e M n (g) (Mn(g) 0) (Sj =x) (n))) 2 ( ) 2 = n ζ d E e Mn(g) (Mn (g) 0) ( Sj n ζ ) (n), M n (g) def = max g(j, x). j n, x n The standard extreme value theory 7 implies that if then, N n def = {(j, x) : j n, x n} = (n + )(2n + ) d n d+ M n (g) 2 log Nn, almost surely. We introduce the event { A n = 2 log Nn M n 2 } 2 log N n. 2 We have P (A n ). By definition of the exponent ζ, if X n = ( sup k n S k n ζ ) (n), then X n in probability and 0 X n. Therefore, X n in L (P), and E X n An. So, there exists n 0 such that for n n 0, E X n An 2. Consequently, for n n 0 and j n,

10 0 P. CARMONA AND Y. HU (n) E e Mn(g) (Mn (g) 0) ( S j n ζ ) E e Mn(g) X n An Hence exp( 2 2 log N n )E X n An 2 exp( 2 2 log N n ). 2 log Nn, Var(log Z n ) c β 6 n ζ d e 4 which implies that 2χ ζ d for all ζ > ζ, ending the proof. 4. Large Deviations Principle The first step in the proof of Theorem.3 is the Proposition 4.. For every λ R d, we have the convergence lim n + n log e λ.sn (n) = φβ (λ) Pa.s. and in L (P). The function φ β : R d R is convex nonnegative, φ β (0) = 0, and for every permutation σ: φ β (λ,..., λ d ) = φ β (±λ σ(),... ± λ σ(d) ). Proof. Fix λ R d and define Zn(x, λ g) = E x e λ.(s n x) e P β n i= g(i,s i), and Zn λ = Zn(0, λ g). From the Markov property of the random walk S we infer that e λ.s n (n) Zn+m λ = Zn λ (Sn =x) Z λ e λ.s n (n) m(x, θ n g). x Jensen s inequality applied to the concave function log yields e λ.s n (n) (Sn=x) log Z λ n+m log Z λ n + x e λ.s n (n) log Z λ m(x, θ n g). The independence between the σ-fields σ(g(k, x), k n, x Z d ) and σ(g(k, x), k > n, x Z d ) implies that E log Zn+m λ E log Z λ e λs n (n) (Sn=x) n + E E log Z λ x e λ.s n (n) m(x, θ n g) = E log Zn λ + E log Z λ e λs n (n) (Sn =x) m E e λs n (n) = E log Z λ n + E log Z λ m. x

11 Consequently, the sequence n E log Z λ n is superadditive and we can consider the limit: φ β (λ) def = lim n E log e λ.s n (n). We can apply the concentration of measure property (see Proposition 2.2) to see that this convergence is also an almost sure convergence. To prove that this convergence also holds in L (P) we only need to show that the sequence log e n λs (n) n is uniformly integrable. This is true, because this sequence is bounded by c d λ. The properties of convexity, positivity and symmetry of φ β are inherited from the functions λ log E e λs n (n). For example, by convexity n of the exponential: n E log e λ.s (n) n E λ.s n (n) = 0. Proof of Theorem.3. This is Gärtner-Ellis Theorem (see e.g. Dembo and Zeitouni Theorem , or den Hollander section V.2 0). We can obtain a weak LDP if we are able to prove that the function λ φ β (λ) is differentiable on R d. We now state a Law of Large Numbers in dimension d =.We say that (S n ) n N is a nearest neighbour random walk on Z if for a constant p it is a Markov chain with transition probabilities: p(x, x + ) = p = p(x, x ) (x Z). Proposition 4.2. Assume that the function φ β is differentiable at λ R. Then the nearest neighbour random walk on Z with mean tanh λ, i.e. p = eλ, satisfies the law of large numbers: 2chλ n S n (n) φ β(λ) almost surely. This very weak law of large numbers is not a surprise for the symmetric random walk, since we have then S n (n) = d S n (n) and thus E S n (n) = 0. Proof. The function φ β is the limit of the convex C functions f n (λ) = log e n (n). λs n Therefore, since φβ is differentiable at λ (see Lemma 4.3),

12 2 P. CARMONA AND Y. HU almost surely φ β(λ) = lim f n(λ) = lim n Sn e λs n (n) e λs n (n). Define ψ(λ) = log cosh(λ). Then M λ n = e λs n nψ(λ) is a martingale and under the new probability E λ f(s k, k n) def = E 0 f(sk, k n)e λsn nψ(λ) the nearest neighbour random walk S has mean tanh(λ). Let us denote by S (λ) this walk ; then almost surely φ β(λ) = lim S (λ) (n) n, n which is the desired result. Lemma 4.3. Assume the sequence f n of real valued, differentiable, convex functions converge on an open interval I to a function f. Then f is convex, and for every x such that f is differentiable at x, f n(x) converges to f (x). Proof. The convexity of f is obvious. For a < b in I we have f n (b) f n (a) b a Therefore, since f n(a) fn(b) fn(a) b a lim sup f n(a) Letting b decrease to a, we obtain Similarly, since f n(b) f n(b) f n (a) b a Letting a increase to b yields: f(b) f(a) b a we obtain: f(b) f(a) b a lim sup f n(a) f +(a). we obtain: lim inf f n(b) f n(b) f n (a) b a lim inf f n(b) f (b). Combining these inequalities yields for any x such that f is differentiable at x, and therefore lim inf f n(x) f (x) = f +(x) lim sup f n(x), lim f n(x) = f (x)....

13 5. A relationship between the volume exponent and the shape of the rate function It is easy to adapt the arguments of the proof of Proposition 4. to establish the convergence of the free energy: 3 (5.) p(β) def = lim n n log Z n P a.s. and in L (P). Indeed, the sequence n p n (β) = n E log Z n is superadditive so p(β) = lim p n (β) is well defined. The concentration of measure property (Proposition 2.3) implies that n log Z n p n (β) 0 a.s and in L. See also Comets, Shiga and Yoshida 5 where they studied general environments g by using martingale arguments. Our aim now is to show that there exists an exponential rate of convergence of the point to point partition function when we follow a given direction. Indeed, from the Markov Property (Lemma 2.) we get Z n+m (0, x + y, g) Z n (0, x, g)z m (x, x + y, θ n g) (x, y Z d ). Taking the expectation of the logarithm, we get, since θ n g is distributed as g, (5.2) (5.3) E log Z n+m (0, x + y) E log Z n (0, x) + E log Z m (x, x + y) = E log Z n (0, x) + E log Z m (0, y) Fix e = (k, z), k, z Z d. the sequence n a n = E log Z nk (0, nz) is superadditive : a n+m a n + a m. hence, we can consider the limit (5.4) f β (e) = f β (k, z) def = lim n n E log Z nk(0, nz) = sup n n E log Z nk(0, nz). Following Piza 6 and Alexander 2, we can define f β (e) for e = (k, z) having rational coordinates by restricting our sequence n a n to the n such that ne = (nk, nz) has integer coordinates. We have defined on Q + Q d a function f β such that: f β is homogeneous: f β (λe) = λf β (e) for λ Q +. f β is super additive: f β (e + e ) f β (e) + f β (e ). We can then conclude by Lemma.5 of Alexander 2 that f β may be extended to a uniformly continuous function on R + R d, homogeneous, superadditive and concave. Remark 5.. Owing to the concentration of measure phenomenon, the convergence f β (k, z) def = lim log Z n nk(0, nz) also holds almost surely and in L (P).

14 4 P. CARMONA AND Y. HU Remark 5.2. We need to be very careful when defining f β. Indeed if e = (k, z) and P 0 S nk = nz = 0, i.e. there is no path of length nk connecting 0 to nz, then Z nk (0, nz) = 0 and f β (e) =. Therefore, if z > k we have f β (k, z) = and when z k, we shall restrict the sequence n E log Z nk (0, nz) to the integers n such that P 0 S nk = nz > 0. If this is the case, we do not have integrability problems preventing us from establishing (5.2). Indeed, Jensen s inequality implies that: Z nk (0, nz) P 0 S nk = nze 0 e βh nk (g,s) S nk = nz Therefore, P 0 S nk = nz exp(βe 0 H nk (g, S) S nk = nz). n E log Z nk(0, nz) n log P 0S nk = nz + β n E E 0H nk (g, S) S nk = nz = n log P 0S nk = nz. and this entails, thanks to the local central limit theorem for ordinary random walks (see e.g. Lawler 8), the lower bound, C d = 2(d/2π) d/2 : z 2 f β (k, z) C d k. Let us now establish some useful properties of the function f β. Proposition 5.3. () f β (, 0) = sup θ (,) d f β (, θ). (2) f β (, 0) = p(β). (3) Fix ν >. Then, for m large enough 2 m E log Z m p(β) m E log Z m + m ν and almost surely, for m large enough m log Z m m ν p(β) m log Z m + m ν (4) Similarly, for m large enough, 2m E log Z 2m(0, 0) f β (, 0) 2m E log Z 2m(0, 0) + m ν. (5) β 2 2 C d θ 2 f β (, θ) C d θ 2. Proof.. The Markov Property (Lemma 2.) implies that for x Q d Z 2n (0, 0, g) Z n (0, nx, g)z n (nx, 0, θ n g).

15 Therefore, (5.5) E Z 2n (0, 0) E log Z n (0, nx) + E log Z n (nx, 0) = 2E log Z n (0, nx). Taking limits along n such that P 0 S n = x > 0 and nx Z d, we get: f β (2, 0) = 2f β (, 0) 2f β (, x). 2. Fix ν > 2 and let ɛ = n ν. Then, 5 E log Z n ɛ log E Zɛ n (Jensens inequality) ɛ log E Z n (0, x) ɛ (since 0 < ɛ < ) x n = ɛ log E e ɛ(log Zn(0,x) Elog Zn(0,x)) e x n ɛ log C x n e ɛelog Z n(0,x) ɛelog Zn(0,x) (by Proposition 2.3) ɛ log ( C(2n + ) d e ɛ/2elog Z 2n(0,0) ) (by inequality 5.5) C n ν + C 2 (log n)n ν + 2 E log Z 2n(0, 0). We conclude by taking limits. 3. The second line follows from the first and from the concentration of measure property. By construction m E log Z m p(β). Therefore, we only need to establish that for m large enough p(β) m E log Z m + m ν. Fix a large m and a small 0 < ɛ = ɛ(m) < whose value will be determined later. Define h ɛ (n) def = log E Z ɛ n ɛe log Z n. Observe that by the Markov property and the concavity of x x ɛ, ( ) ɛ Zn+k ɛ = Z n (0, x, g)z k (x, θ n g) x x Z ɛ n(0, x, g)z ɛ k(x, θ n g).

16 6 P. CARMONA AND Y. HU Hence, by independence, h ɛ (n + k) log E Zn(0, ɛ x, g)e Zk(x, ɛ θ n g) x n log ( (2n) d E Z ɛ ne Z ɛ k ) = h ɛ (n) + h ɛ (k) + d log(2n). Thanks to Hammersley s general subaditive theorem 9, the following limit exists and satisfies: h ɛ (n) h(ɛ) = lim h ɛ(m) n + n m + C log m m. Recall that h ɛ (n) ɛe log Z n. Hence, h(ɛ) ɛp(β). We now choose ɛ = m ν with ν > /2. We obtain that h ɛ (m) = log E e ɛ(log Z m Elog Z m ) + ɛe log Z m Therefore, C + ɛe log Z m (by Proposition 2.3). p(β) h(ɛ) h ɛ(m) + C log m ɛ mɛ mɛ m E log Z m + C m ν log m, proving the desired result for ν > ν. 4. Since the proof is really similar to the preceding one, it has been omitted. 5. Only the left inequality remains to be proved. Thanks again to the concavity of the logarithm: n E log Z nk(0, nz) n log E Z nk(0, nz) = ( ) n log β2 nk e 2 P0 S nk = nz. We obtain from the local central limit theorem that, f β (k, z) kβ2 2 C z 2 d k. Proof of Proposition.4. Define (5.6) I β (θ) = p(β) f β (, θ). Then, thanks to Proposition 5.3, the function I β and I β (0) = 0. It remains to show that: I β (θ) K β (θ). is positive, convex

17 Indeed, if θ has rational coordinate, then C = {θ} is a closed set and (n) Sn log n C = log Z n(0, nθ). Z n Therefore, if we let n go to with the restrictions that nθ Z d and P 0 S n = nθ > 0, we get: (n) n log Sn n C f β (, θ) p(β) = I β (θ). On the other hand, the Large Deviations Property of Theorem.3 implies that lim sup (n) n log Sn n C K β (θ), 7 so we obtain I β (θ) K β (θ). Proof of Theorem.5. Fix ν > and γ such that + δ(γ ) > ν. 2 Using the concentration of measure inequality as in the proof of Proposition 2.3, it is easy to show that almost surely for n large enough, k n and z k 0: log (n) (Sk =z) E log (n) (Sk =z) 2n ν. Assume that k is even, so that 0 k 0. Then, Markov property implies (n) Z k (0, z)z n k (z, θ k g) (Sk =z) = x Z k(0, x)z n k (x, θ k g) Z k(0, z) Z k (0, 0) Since Z n k (z, θ k g) d = Z n k (0, θ k g), we obtain Z n k (z, θ k g) Z n k (0, θ k g). E log (n) (Sk =z) E log Z k (0, z) E log Z k (0, 0) f β (k, z) E log Z k (0, 0) (by (5.4)) f β (k, z) k f β (, 0) + k ν (by Proposition 5.3) = ki β (z/k) + k ν. Hence, if z n γ, we get almost surely for large enough n,

18 8 P. CARMONA AND Y. HU log (n) (Sk =z) kiβ (z/k) + k ν + 2n ν Thus, Ck z/k δ + 3n ν Ck δ n γδ + 3n ν (since z n γ ) Cn δ+γδ + 3n ν (since k n and δ > ) C 2 n δ+γδ. (n) ( Sk n γ ) C3 n d e C 2n δ+γδ. If k is odd, then (n) (n) ( Sk n γ ) ( Sk n ) γ and we obtain the same type of upper bound. This upper bound implies that (n) ( k n, Sk n ) γ k n ( Sk n γ ) Therefore, P alsmost surely, ( max k n S k n γ ) (n), (n) C3 n d+ e C 2n δ+γδ 0 and γ ζ. We conclude by letting ν 2 and γ 2δ. Assume now that p(β) = β 2 /2. By Proposition 5.3 this implies that I β (θ) C d θ 2. We can apply the preceding result with δ = 2 and obtain ζ 3/4. References. S. Albeverio and X.Y. Zhou, A martingale approach to directed polymers in a random environment, Journal of Theoretical Probability 9 (995), no., K.S. Alexander, Approximation of subadditive functions and convergence rates in limiting shape results, The Annals of Probability 28 (997), no., E. Bolthausen, A note on the diffusion of directed polymers in a random environment, Communications in Mathematical Physics 23 (989), Ph. Carmona and Y. Hu, On the partition function of a directed polymer in a Gaussian random environment, Probab. Th. Rel. Fields 24 (2002) F. Comets, T., Shiga and N. Yoshida, Directed polymers in random environment: Path localization and strong disorder. Bernoulli (to appear). 6. D.A. Huse and C.L. Henley, Pinning and roughening of domain walls in Ising systems due to random impurities, Phys. Rev. Lett. 54 (985), A. Dembo and O. Zeitouni, Large deviations techniques and applications, Applications of Mathematics, no. 38, Springer, G.F. Lawler, Intersections of random walks, Probability and its applications, Birkhauser, 996.

19 9. J.M. Hammersley, Generalization of the fundamental theorem on subadditive functions, Proc. Cambridge Philosophical Society 58 (962), F. den Hollander, Large deviations, Fields Institute Monographs, vol. 4, American Mathematical Society, I.A. Ibragimov, V. Sudakov, and B.S. Tsirelson, Norms of Gaussian sample functions, Proceedings of the Third Japan-USSR Symposium on Probability (Tashkent), Lecture Notes in Mathematics, vol. 550, 975, pp J.Z. Imbrie and T. Spencer, Diffusion of directed polymers in a random environment, Journal of Statistical Physics 52 (988), M. Kardar, Roughening by impurities at finite temperatures, Phys. Rev. Lett. 55 (985), O. Mejane, Upper bound of a volume exponent for directed polymers in a random environment. (preprint 2002). 5. M. Petermann, Sperdiffusivity of directed polymers in random environment, Ph.D thesis, Univ. Zürich, M.S.T. Piza, Directed polymers in a random environment : Some results on fluctuations, Journal of Statistical Physics 89 (997), no. 3/4, S.I. Resnick, Extreme values, regular variation and point processes, Applied Probability, vol. 4, Springer, Y.G. Sinai, A remark concerning random walks with random potentials. Fund. Math. 47 (995), no. 2, M. Talagrand, The Sherrington-Kirkpatrick model : a challenge to mathematicians, Probability Theory and Related Fields 0 (998), , Ecole d été de probabilité de saint-flour, Lecture Notes in Mathematics, ch. A First course on Spin Glasses, Springer, Philippe Carmona, Laboratoire de Mathématiques Jean Leray, Université de Nantes, 2 Rue de la Houssinière, BP 92208, F Nantes Cedex 03 France address: philippe.carmona@math.univ-nantes.fr Yueyun Hu, Laboratoire de Probabilités et Modèles Aléatoires, CNRS UMR 7599, Université Paris VI, case 88, 4 place Jussieu Paris Cedex 05 France address: hu@ccr.jussieu.fr 9

Universality in Sherrington-Kirkpatrick s Spin Glass Model

Universality in Sherrington-Kirkpatrick s Spin Glass Model Universality in Sherrington-Kirkpatrick s Spin Glass Model Philippe CARMOA, Yueyun HU 5th ovember 08 arxiv:math/0403359v mathpr May 004 Abstract We show that the limiting free energy in Sherrington-Kirkpatrick

More information

Large deviations and fluctuation exponents for some polymer models. Directed polymer in a random environment. KPZ equation Log-gamma polymer

Large deviations and fluctuation exponents for some polymer models. Directed polymer in a random environment. KPZ equation Log-gamma polymer Large deviations and fluctuation exponents for some polymer models Timo Seppäläinen Department of Mathematics University of Wisconsin-Madison 211 1 Introduction 2 Large deviations 3 Fluctuation exponents

More information

Concentration inequalities and the entropy method

Concentration inequalities and the entropy method Concentration inequalities and the entropy method Gábor Lugosi ICREA and Pompeu Fabra University Barcelona what is concentration? We are interested in bounding random fluctuations of functions of many

More information

Scaling exponents for certain 1+1 dimensional directed polymers

Scaling exponents for certain 1+1 dimensional directed polymers Scaling exponents for certain 1+1 dimensional directed polymers Timo Seppäläinen Department of Mathematics University of Wisconsin-Madison 2010 Scaling for a polymer 1/29 1 Introduction 2 KPZ equation

More information

1 Functions of normal random variables

1 Functions of normal random variables Tel Aviv University, 200 Gaussian measures : results formulated Functions of normal random variables It is of course impossible to even think the word Gaussian without immediately mentioning the most important

More information

Random Bernstein-Markov factors

Random Bernstein-Markov factors Random Bernstein-Markov factors Igor Pritsker and Koushik Ramachandran October 20, 208 Abstract For a polynomial P n of degree n, Bernstein s inequality states that P n n P n for all L p norms on the unit

More information

Probability and Measure

Probability and Measure Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability

More information

4 Sums of Independent Random Variables

4 Sums of Independent Random Variables 4 Sums of Independent Random Variables Standing Assumptions: Assume throughout this section that (,F,P) is a fixed probability space and that X 1, X 2, X 3,... are independent real-valued random variables

More information

The Sherrington-Kirkpatrick model

The Sherrington-Kirkpatrick model Stat 36 Stochastic Processes on Graphs The Sherrington-Kirkpatrick model Andrea Montanari Lecture - 4/-4/00 The Sherrington-Kirkpatrick (SK) model was introduced by David Sherrington and Scott Kirkpatrick

More information

Gärtner-Ellis Theorem and applications.

Gärtner-Ellis Theorem and applications. Gärtner-Ellis Theorem and applications. Elena Kosygina July 25, 208 In this lecture we turn to the non-i.i.d. case and discuss Gärtner-Ellis theorem. As an application, we study Curie-Weiss model with

More information

3 Integration and Expectation

3 Integration and Expectation 3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ

More information

STAT 7032 Probability Spring Wlodek Bryc

STAT 7032 Probability Spring Wlodek Bryc STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,

More information

If g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get

If g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get 18:2 1/24/2 TOPIC. Inequalities; measures of spread. This lecture explores the implications of Jensen s inequality for g-means in general, and for harmonic, geometric, arithmetic, and related means in

More information

Part IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015

Part IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015 Part IA Probability Theorems Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.

More information

A slow transient diusion in a drifted stable potential

A slow transient diusion in a drifted stable potential A slow transient diusion in a drifted stable potential Arvind Singh Université Paris VI Abstract We consider a diusion process X in a random potential V of the form V x = S x δx, where δ is a positive

More information

L p Spaces and Convexity

L p Spaces and Convexity L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function

More information

MATHS 730 FC Lecture Notes March 5, Introduction

MATHS 730 FC Lecture Notes March 5, Introduction 1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists

More information

Additive functionals of infinite-variance moving averages. Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535

Additive functionals of infinite-variance moving averages. Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535 Additive functionals of infinite-variance moving averages Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535 Departments of Statistics The University of Chicago Chicago, Illinois 60637 June

More information

The Gaussian free field, Gibbs measures and NLS on planar domains

The Gaussian free field, Gibbs measures and NLS on planar domains The Gaussian free field, Gibbs measures and on planar domains N. Burq, joint with L. Thomann (Nantes) and N. Tzvetkov (Cergy) Université Paris Sud, Laboratoire de Mathématiques d Orsay, CNRS UMR 8628 LAGA,

More information

The Codimension of the Zeros of a Stable Process in Random Scenery

The Codimension of the Zeros of a Stable Process in Random Scenery The Codimension of the Zeros of a Stable Process in Random Scenery Davar Khoshnevisan The University of Utah, Department of Mathematics Salt Lake City, UT 84105 0090, U.S.A. davar@math.utah.edu http://www.math.utah.edu/~davar

More information

Part II Probability and Measure

Part II Probability and Measure Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

First Passage Percolation Has Sublinear Distance Variance

First Passage Percolation Has Sublinear Distance Variance arxiv:math/23262v5 [math.pr 25 May 27 First Passage Percolation Has Sublinear Distance Variance Itai Benjamini Gil Kalai Oded Schramm October 21, 22 Abstract Let < a < b

More information

I. ANALYSIS; PROBABILITY

I. ANALYSIS; PROBABILITY ma414l1.tex Lecture 1. 12.1.2012 I. NLYSIS; PROBBILITY 1. Lebesgue Measure and Integral We recall Lebesgue measure (M411 Probability and Measure) λ: defined on intervals (a, b] by λ((a, b]) := b a (so

More information

Introduction and Preliminaries

Introduction and Preliminaries Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis

More information

ON THE ZERO-ONE LAW AND THE LAW OF LARGE NUMBERS FOR RANDOM WALK IN MIXING RAN- DOM ENVIRONMENT

ON THE ZERO-ONE LAW AND THE LAW OF LARGE NUMBERS FOR RANDOM WALK IN MIXING RAN- DOM ENVIRONMENT Elect. Comm. in Probab. 10 (2005), 36 44 ELECTRONIC COMMUNICATIONS in PROBABILITY ON THE ZERO-ONE LAW AND THE LAW OF LARGE NUMBERS FOR RANDOM WALK IN MIXING RAN- DOM ENVIRONMENT FIRAS RASSOUL AGHA Department

More information

Some superconcentration inequalities for extrema of stationary Gaussian processes

Some superconcentration inequalities for extrema of stationary Gaussian processes Some superconcentration inequalities for extrema of stationary Gaussian processes Kevin Tanguy University of Toulouse, France Kevin Tanguy is with the Institute of Mathematics of Toulouse (CNRS UMR 5219).

More information

ON A NONHIERARCHICAL VERSION OF THE GENERALIZED RANDOM ENERGY MODEL 1. BY ERWIN BOLTHAUSEN AND NICOLA KISTLER Universität Zürich

ON A NONHIERARCHICAL VERSION OF THE GENERALIZED RANDOM ENERGY MODEL 1. BY ERWIN BOLTHAUSEN AND NICOLA KISTLER Universität Zürich The Annals of Applied Probability 2006, Vol. 16, No. 1, 1 14 DOI: 10.1214/105051605000000665 Institute of Mathematical Statistics, 2006 ON A NONHIERARCHICAL VERSION OF THE GENERALIZED RANDOM ENERGY MODEL

More information

Scaling Limits of Waves in Convex Scalar Conservation Laws under Random Initial Perturbations

Scaling Limits of Waves in Convex Scalar Conservation Laws under Random Initial Perturbations Scaling Limits of Waves in Convex Scalar Conservation Laws under Random Initial Perturbations Jan Wehr and Jack Xin Abstract We study waves in convex scalar conservation laws under noisy initial perturbations.

More information

Convergence at first and second order of some approximations of stochastic integrals

Convergence at first and second order of some approximations of stochastic integrals Convergence at first and second order of some approximations of stochastic integrals Bérard Bergery Blandine, Vallois Pierre IECN, Nancy-Université, CNRS, INRIA, Boulevard des Aiguillettes B.P. 239 F-5456

More information

Almost sure asymptotics for the random binary search tree

Almost sure asymptotics for the random binary search tree AofA 10 DMTCS proc. AM, 2010, 565 576 Almost sure asymptotics for the rom binary search tree Matthew I. Roberts Laboratoire de Probabilités et Modèles Aléatoires, Université Paris VI Case courrier 188,

More information

SOME CONVERSE LIMIT THEOREMS FOR EXCHANGEABLE BOOTSTRAPS

SOME CONVERSE LIMIT THEOREMS FOR EXCHANGEABLE BOOTSTRAPS SOME CONVERSE LIMIT THEOREMS OR EXCHANGEABLE BOOTSTRAPS Jon A. Wellner University of Washington The bootstrap Glivenko-Cantelli and bootstrap Donsker theorems of Giné and Zinn (990) contain both necessary

More information

Conditional independence, conditional mixing and conditional association

Conditional independence, conditional mixing and conditional association Ann Inst Stat Math (2009) 61:441 460 DOI 10.1007/s10463-007-0152-2 Conditional independence, conditional mixing and conditional association B. L. S. Prakasa Rao Received: 25 July 2006 / Revised: 14 May

More information

Concentration, self-bounding functions

Concentration, self-bounding functions Concentration, self-bounding functions S. Boucheron 1 and G. Lugosi 2 and P. Massart 3 1 Laboratoire de Probabilités et Modèles Aléatoires Université Paris-Diderot 2 Economics University Pompeu Fabra 3

More information

FLUCTUATION EXPONENTS AND LARGE DEVIATIONS FOR DIRECTED POLYMERS IN A RANDOM ENVIRONMENT

FLUCTUATION EXPONENTS AND LARGE DEVIATIONS FOR DIRECTED POLYMERS IN A RANDOM ENVIRONMENT FLUCTUATION EXPONENTS AND LARGE DEVIATIONS FOR DIRECTED POLYMERS IN A RANDOM ENVIRONMENT PHILIPPE CARMONA AND YUEYUN HU Abstract. For the model of directed polymers i a gaussia radom eviromet itroduced

More information

Zeros of lacunary random polynomials

Zeros of lacunary random polynomials Zeros of lacunary random polynomials Igor E. Pritsker Dedicated to Norm Levenberg on his 60th birthday Abstract We study the asymptotic distribution of zeros for the lacunary random polynomials. It is

More information

Ergodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.

Ergodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R. Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions

More information

SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE

SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE FRANÇOIS BOLLEY Abstract. In this note we prove in an elementary way that the Wasserstein distances, which play a basic role in optimal transportation

More information

Multiple points of the Brownian sheet in critical dimensions

Multiple points of the Brownian sheet in critical dimensions Multiple points of the Brownian sheet in critical dimensions Robert C. Dalang Ecole Polytechnique Fédérale de Lausanne Based on joint work with: Carl Mueller Multiple points of the Brownian sheet in critical

More information

δ xj β n = 1 n Theorem 1.1. The sequence {P n } satisfies a large deviation principle on M(X) with the rate function I(β) given by

δ xj β n = 1 n Theorem 1.1. The sequence {P n } satisfies a large deviation principle on M(X) with the rate function I(β) given by . Sanov s Theorem Here we consider a sequence of i.i.d. random variables with values in some complete separable metric space X with a common distribution α. Then the sample distribution β n = n maps X

More information

IEOR 6711: Stochastic Models I Fall 2013, Professor Whitt Lecture Notes, Thursday, September 5 Modes of Convergence

IEOR 6711: Stochastic Models I Fall 2013, Professor Whitt Lecture Notes, Thursday, September 5 Modes of Convergence IEOR 6711: Stochastic Models I Fall 2013, Professor Whitt Lecture Notes, Thursday, September 5 Modes of Convergence 1 Overview We started by stating the two principal laws of large numbers: the strong

More information

Scaling Limits of Waves in Convex Scalar Conservation Laws Under Random Initial Perturbations

Scaling Limits of Waves in Convex Scalar Conservation Laws Under Random Initial Perturbations Journal of Statistical Physics, Vol. 122, No. 2, January 2006 ( C 2006 ) DOI: 10.1007/s10955-005-8006-x Scaling Limits of Waves in Convex Scalar Conservation Laws Under Random Initial Perturbations Jan

More information

Probability and Measure

Probability and Measure Probability and Measure Robert L. Wolpert Institute of Statistics and Decision Sciences Duke University, Durham, NC, USA Convergence of Random Variables 1. Convergence Concepts 1.1. Convergence of Real

More information

On the convergence of sequences of random variables: A primer

On the convergence of sequences of random variables: A primer BCAM May 2012 1 On the convergence of sequences of random variables: A primer Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM May 2012 2 A sequence a :

More information

THE CENTER OF MASS OF THE ISE AND THE WIENER INDEX OF TREES

THE CENTER OF MASS OF THE ISE AND THE WIENER INDEX OF TREES Elect. Comm. in Probab. 9 (24), 78 87 ELECTRONIC COMMUNICATIONS in PROBABILITY THE CENTER OF MASS OF THE ISE AND THE WIENER INDEX OF TREES SVANTE JANSON Departement of Mathematics, Uppsala University,

More information

17. Convergence of Random Variables

17. Convergence of Random Variables 7. Convergence of Random Variables In elementary mathematics courses (such as Calculus) one speaks of the convergence of functions: f n : R R, then lim f n = f if lim f n (x) = f(x) for all x in R. This

More information

Brownian Motion and Conditional Probability

Brownian Motion and Conditional Probability Math 561: Theory of Probability (Spring 2018) Week 10 Brownian Motion and Conditional Probability 10.1 Standard Brownian Motion (SBM) Brownian motion is a stochastic process with both practical and theoretical

More information

A Note on the Central Limit Theorem for a Class of Linear Systems 1

A Note on the Central Limit Theorem for a Class of Linear Systems 1 A Note on the Central Limit Theorem for a Class of Linear Systems 1 Contents Yukio Nagahata Department of Mathematics, Graduate School of Engineering Science Osaka University, Toyonaka 560-8531, Japan.

More information

arxiv:math/ v2 [math.pr] 1 Oct 2008

arxiv:math/ v2 [math.pr] 1 Oct 2008 The nnals of Probability 2008, Vol. 36, No. 4, 209 220 DOI: 0.24/07-OP352 c Institute of Mathematical Statistics, 2008 arxiv:math/06369v2 [math.pr] Oct 2008 SUBCRITICL REGIMES IN THE POISSON BOOLEN MODEL

More information

P (A G) dp G P (A G)

P (A G) dp G P (A G) First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume

More information

On planar random recurrence equations

On planar random recurrence equations On planar random recurrence equations Martin Drapatz March 1, 2016 Abstract We consider planar random recurrence equations of type Y (i, j) = A 1 (i, j)y (i 1, j) + A 2 (i, j)y (i, j 1) + B(i, j), i, j,

More information

Lecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales.

Lecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales. Lecture 2 1 Martingales We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales. 1.1 Doob s inequality We have the following maximal

More information

Analysis Qualifying Exam

Analysis Qualifying Exam Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,

More information

Random Process Lecture 1. Fundamentals of Probability

Random Process Lecture 1. Fundamentals of Probability Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus

More information

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989), Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer

More information

< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1

< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1 List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question

More information

Lecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1

Lecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1 Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).

More information

Selected Exercises on Expectations and Some Probability Inequalities

Selected Exercises on Expectations and Some Probability Inequalities Selected Exercises on Expectations and Some Probability Inequalities # If E(X 2 ) = and E X a > 0, then P( X λa) ( λ) 2 a 2 for 0 < λ

More information

M. Ledoux Université de Toulouse, France

M. Ledoux Université de Toulouse, France ON MANIFOLDS WITH NON-NEGATIVE RICCI CURVATURE AND SOBOLEV INEQUALITIES M. Ledoux Université de Toulouse, France Abstract. Let M be a complete n-dimensional Riemanian manifold with non-negative Ricci curvature

More information

UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES

UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES Applied Probability Trust 7 May 22 UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES HAMED AMINI, AND MARC LELARGE, ENS-INRIA Abstract Upper deviation results are obtained for the split time of a

More information

1 Take-home exam and final exam study guide

1 Take-home exam and final exam study guide Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number

More information

STAT 200C: High-dimensional Statistics

STAT 200C: High-dimensional Statistics STAT 200C: High-dimensional Statistics Arash A. Amini May 30, 2018 1 / 59 Classical case: n d. Asymptotic assumption: d is fixed and n. Basic tools: LLN and CLT. High-dimensional setting: n d, e.g. n/d

More information

Monte-Carlo MMD-MA, Université Paris-Dauphine. Xiaolu Tan

Monte-Carlo MMD-MA, Université Paris-Dauphine. Xiaolu Tan Monte-Carlo MMD-MA, Université Paris-Dauphine Xiaolu Tan tan@ceremade.dauphine.fr Septembre 2015 Contents 1 Introduction 1 1.1 The principle.................................. 1 1.2 The error analysis

More information

The Canonical Gaussian Measure on R

The Canonical Gaussian Measure on R The Canonical Gaussian Measure on R 1. Introduction The main goal of this course is to study Gaussian measures. The simplest example of a Gaussian measure is the canonical Gaussian measure P on R where

More information

INTRODUCTION TO STATISTICAL MECHANICS Exercises

INTRODUCTION TO STATISTICAL MECHANICS Exercises École d hiver de Probabilités Semaine 1 : Mécanique statistique de l équilibre CIRM - Marseille 4-8 Février 2012 INTRODUCTION TO STATISTICAL MECHANICS Exercises Course : Yvan Velenik, Exercises : Loren

More information

Math 328 Course Notes

Math 328 Course Notes Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the

More information

Mathematical Analysis Outline. William G. Faris

Mathematical Analysis Outline. William G. Faris Mathematical Analysis Outline William G. Faris January 8, 2007 2 Chapter 1 Metric spaces and continuous maps 1.1 Metric spaces A metric space is a set X together with a real distance function (x, x ) d(x,

More information

Tools from Lebesgue integration

Tools from Lebesgue integration Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given

More information

7 Convergence in R d and in Metric Spaces

7 Convergence in R d and in Metric Spaces STA 711: Probability & Measure Theory Robert L. Wolpert 7 Convergence in R d and in Metric Spaces A sequence of elements a n of R d converges to a limit a if and only if, for each ǫ > 0, the sequence a

More information

arxiv: v1 [math.pr] 6 Jan 2014

arxiv: v1 [math.pr] 6 Jan 2014 Recurrence for vertex-reinforced random walks on Z with weak reinforcements. Arvind Singh arxiv:40.034v [math.pr] 6 Jan 04 Abstract We prove that any vertex-reinforced random walk on the integer lattice

More information

Superconcentration inequalities for centered Gaussian stationnary processes

Superconcentration inequalities for centered Gaussian stationnary processes Superconcentration inequalities for centered Gaussian stationnary processes Kevin Tanguy Toulouse University June 21, 2016 1 / 22 Outline What is superconcentration? Convergence of extremes (Gaussian case).

More information

Concentration behavior of the penalized least squares estimator

Concentration behavior of the penalized least squares estimator Concentration behavior of the penalized least squares estimator Penalized least squares behavior arxiv:1511.08698v2 [math.st] 19 Oct 2016 Alan Muro and Sara van de Geer {muro,geer}@stat.math.ethz.ch Seminar

More information

DETECTING PHASE TRANSITION FOR GIBBS MEASURES. By Francis Comets 1 University of California, Irvine

DETECTING PHASE TRANSITION FOR GIBBS MEASURES. By Francis Comets 1 University of California, Irvine The Annals of Applied Probability 1997, Vol. 7, No. 2, 545 563 DETECTING PHASE TRANSITION FOR GIBBS MEASURES By Francis Comets 1 University of California, Irvine We propose a new empirical procedure for

More information

Notes 6 : First and second moment methods

Notes 6 : First and second moment methods Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative

More information

Preliminary Exam: Probability 9:00am 2:00pm, Friday, January 6, 2012

Preliminary Exam: Probability 9:00am 2:00pm, Friday, January 6, 2012 Preliminary Exam: Probability 9:00am 2:00pm, Friday, January 6, 202 The exam lasts from 9:00am until 2:00pm, with a walking break every hour. Your goal on this exam should be to demonstrate mastery of

More information

9 Brownian Motion: Construction

9 Brownian Motion: Construction 9 Brownian Motion: Construction 9.1 Definition and Heuristics The central limit theorem states that the standard Gaussian distribution arises as the weak limit of the rescaled partial sums S n / p n of

More information

Krzysztof Burdzy University of Washington. = X(Y (t)), t 0}

Krzysztof Burdzy University of Washington. = X(Y (t)), t 0} VARIATION OF ITERATED BROWNIAN MOTION Krzysztof Burdzy University of Washington 1. Introduction and main results. Suppose that X 1, X 2 and Y are independent standard Brownian motions starting from 0 and

More information

Brownian motion. Samy Tindel. Purdue University. Probability Theory 2 - MA 539

Brownian motion. Samy Tindel. Purdue University. Probability Theory 2 - MA 539 Brownian motion Samy Tindel Purdue University Probability Theory 2 - MA 539 Mostly taken from Brownian Motion and Stochastic Calculus by I. Karatzas and S. Shreve Samy T. Brownian motion Probability Theory

More information

Susceptible-Infective-Removed Epidemics and Erdős-Rényi random

Susceptible-Infective-Removed Epidemics and Erdős-Rényi random Susceptible-Infective-Removed Epidemics and Erdős-Rényi random graphs MSR-Inria Joint Centre October 13, 2015 SIR epidemics: the Reed-Frost model Individuals i [n] when infected, attempt to infect all

More information

Zeros of Polynomials with Random Coefficients

Zeros of Polynomials with Random Coefficients Zeros of Polynomials with Random Coefficients Igor E. Pritsker Department of Mathematics, Oklahoma State University Stilwater, OK 74078 USA igor@math.okstate.edu Aaron M. Yeager Department of Mathematics,

More information

arxiv: v2 [math.pr] 30 Sep 2009

arxiv: v2 [math.pr] 30 Sep 2009 Upper and Lower Bounds in Exponential Tauberian Theorems Jochen Voss 3th September 9 arxiv:98.64v [math.pr] 3 Sep 9 Abstract In this text we study, for positive random variables, the relation between the

More information

AN EXTREME-VALUE ANALYSIS OF THE LIL FOR BROWNIAN MOTION 1. INTRODUCTION

AN EXTREME-VALUE ANALYSIS OF THE LIL FOR BROWNIAN MOTION 1. INTRODUCTION AN EXTREME-VALUE ANALYSIS OF THE LIL FOR BROWNIAN MOTION DAVAR KHOSHNEVISAN, DAVID A. LEVIN, AND ZHAN SHI ABSTRACT. We present an extreme-value analysis of the classical law of the iterated logarithm LIL

More information

Universal convex coverings

Universal convex coverings Bull. London Math. Soc. 41 (2009) 987 992 C 2009 London Mathematical Society doi:10.1112/blms/bdp076 Universal convex coverings Roland Bacher Abstract In every dimension d 1, we establish the existence

More information

Inverse Brascamp-Lieb inequalities along the Heat equation

Inverse Brascamp-Lieb inequalities along the Heat equation Inverse Brascamp-Lieb inequalities along the Heat equation Franck Barthe and Dario Cordero-Erausquin October 8, 003 Abstract Adapting Borell s proof of Ehrhard s inequality for general sets, we provide

More information

Integration by Parts and Its Applications

Integration by Parts and Its Applications Integration by Parts and Its Applications The following is an immediate consequence of Theorem 4.7 [page 5] and the chain rule [Lemma.7, p. 3]. Theorem.. For every D (P ) and D (P ), Cov( ()) = E [(D)()

More information

Logical Connectives and Quantifiers

Logical Connectives and Quantifiers Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then

More information

Large deviation theory and applications

Large deviation theory and applications Large deviation theory and applications Peter Mörters November 0, 2008 Abstract Large deviation theory deals with the decay of the probability of increasingly unlikely events. It is one of the key techniques

More information

The Ising model Summary of L12

The Ising model Summary of L12 The Ising model Summary of L2 Aim: Study connections between macroscopic phenomena and the underlying microscopic world for a ferromagnet. How: Study the simplest possible model of a ferromagnet containing

More information

. Find E(V ) and var(v ).

. Find E(V ) and var(v ). Math 6382/6383: Probability Models and Mathematical Statistics Sample Preliminary Exam Questions 1. A person tosses a fair coin until she obtains 2 heads in a row. She then tosses a fair die the same number

More information

Czechoslovak Mathematical Journal

Czechoslovak Mathematical Journal Czechoslovak Mathematical Journal Oktay Duman; Cihan Orhan µ-statistically convergent function sequences Czechoslovak Mathematical Journal, Vol. 54 (2004), No. 2, 413 422 Persistent URL: http://dml.cz/dmlcz/127899

More information

Expansion and Isoperimetric Constants for Product Graphs

Expansion and Isoperimetric Constants for Product Graphs Expansion and Isoperimetric Constants for Product Graphs C. Houdré and T. Stoyanov May 4, 2004 Abstract Vertex and edge isoperimetric constants of graphs are studied. Using a functional-analytic approach,

More information

Asymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½

Asymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½ University of Pennsylvania ScholarlyCommons Statistics Papers Wharton Faculty Research 1998 Asymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½ Lawrence D. Brown University

More information

Considering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.

Considering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial. Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

Lecture 22: Variance and Covariance

Lecture 22: Variance and Covariance EE5110 : Probability Foundations for Electrical Engineers July-November 2015 Lecture 22: Variance and Covariance Lecturer: Dr. Krishna Jagannathan Scribes: R.Ravi Kiran In this lecture we will introduce

More information

RATE-OPTIMAL GRAPHON ESTIMATION. By Chao Gao, Yu Lu and Harrison H. Zhou Yale University

RATE-OPTIMAL GRAPHON ESTIMATION. By Chao Gao, Yu Lu and Harrison H. Zhou Yale University Submitted to the Annals of Statistics arxiv: arxiv:0000.0000 RATE-OPTIMAL GRAPHON ESTIMATION By Chao Gao, Yu Lu and Harrison H. Zhou Yale University Network analysis is becoming one of the most active

More information

MAJORIZING MEASURES WITHOUT MEASURES. By Michel Talagrand URA 754 AU CNRS

MAJORIZING MEASURES WITHOUT MEASURES. By Michel Talagrand URA 754 AU CNRS The Annals of Probability 2001, Vol. 29, No. 1, 411 417 MAJORIZING MEASURES WITHOUT MEASURES By Michel Talagrand URA 754 AU CNRS We give a reformulation of majorizing measures that does not involve measures,

More information

A note on the convex infimum convolution inequality

A note on the convex infimum convolution inequality A note on the convex infimum convolution inequality Naomi Feldheim, Arnaud Marsiglietti, Piotr Nayar, Jing Wang Abstract We characterize the symmetric measures which satisfy the one dimensional convex

More information

Connection to Branching Random Walk

Connection to Branching Random Walk Lecture 7 Connection to Branching Random Walk The aim of this lecture is to prepare the grounds for the proof of tightness of the maximum of the DGFF. We will begin with a recount of the so called Dekking-Host

More information

A Note On Large Deviation Theory and Beyond

A Note On Large Deviation Theory and Beyond A Note On Large Deviation Theory and Beyond Jin Feng In this set of notes, we will develop and explain a whole mathematical theory which can be highly summarized through one simple observation ( ) lim

More information

The Azéma-Yor Embedding in Non-Singular Diffusions

The Azéma-Yor Embedding in Non-Singular Diffusions Stochastic Process. Appl. Vol. 96, No. 2, 2001, 305-312 Research Report No. 406, 1999, Dept. Theoret. Statist. Aarhus The Azéma-Yor Embedding in Non-Singular Diffusions J. L. Pedersen and G. Peskir Let

More information