Weak convergence and large deviation theory

Size: px
Start display at page:

Download "Weak convergence and large deviation theory"

Transcription

1 First Prev Next Go To Go Back Full Screen Close Quit 1 Weak convergence and large deviation theory Large deviation principle Convergence in distribution The Bryc-Varadhan theorem Tightness and Prohorov s theorem Exponential tightness Tightness for processes (Exponential) tightness and results for finite dimensional distributions Conditions for (exponential) tightness Joint work with Jin Feng Second Lecture

2 First Prev Next Go To Go Back Full Screen Close Quit 2 Large deviation principle (S, d) X n, n = 1, 2,... a (complete, separable) metric space. S-valued random variables {X n } satisfies a large deviation principle (LDP) if there exists a lower semicontinuous function I : S [0, ] such that for each open set A, lim inf n and for each closed set B, lim sup n 1 n log P {X n A} inf x A I(x) 1 n log P {X n B} inf x B I(x).

3 First Prev Next Go To Go Back Full Screen Close Quit 3 The rate function I is called the rate function for the large deviation principle. A rate function is good if for each a [0, ), {x : I(x) a} is compact. If I is a rate function for {X n }, then I (x) = lim ɛ 0 inf I(y) y B ɛ (x) is also a rate function for {X n }. I is lower semicontinuous. If the large deviation principle holds with lower semicontinuous rate I function, then I(x) = lim lim inf ɛ 0 n 1 n log P {X 1 n B ɛ (x)} = lim lim sup ɛ 0 n n log P {X n B ɛ (x)}

4 First Prev Next Go To Go Back Full Screen Close Quit 4 Convergence in distribution {X n } converges in distribution to X if and only if for each f C b (S) lim E[f(X n)] = E[f(X)] n

5 First Prev Next Go To Go Back Full Screen Close Quit 5 Equivalent statements: Large deviation principle {X n } satisfies an LDP with a good rate function if and only if {X n } is exponentially tight and for each f C b (S). Then 1 Λ(f) lim n n log E[enf(X n) ] I(x) = sup {f(x) Λ(f)} C b (S) and Λ(f) = sup{f(x) I(x)} x S Bryc, Varadhan

6 First Prev Next Go To Go Back Full Screen Close Quit 6 Equivalent statements: Convergence in distribution {X n } converges in distribution to X if and only if or equivalently lim inf n P {X n A} P {X A}, each open A, lim sup P {X n B} P {X B}, each closed B n LDP

7 First Prev Next Go To Go Back Full Screen Close Quit 7 Tightness A sequence {X n } is tight if for each ɛ > 0, there exists a compact set K ɛ S such that sup P {X n / K ɛ } ɛ. n Prohorov s theorem Theorem 1 Suppose that {X n } is tight. Then there exists a subsequence {n(k)} along which the sequence converges in distribution.

8 First Prev Next Go To Go Back Full Screen Close Quit 8 Exponential tightness {X n } is exponentially tight if for each a > 0, there exists a compact set K a S such that lim sup n 1 n log P {X n / K a } a. Analog of Prohorov s theorem Theorem 2 (Puhalskii, O Brien and Vervaat, de Acosta) Suppose that {X n } is exponentially tight. Then there exists a subsequence {n(k)} along which the large deviation principle holds with a good rate function.

9 First Prev Next Go To Go Back Full Screen Close Quit 9 Stochastic processes in D E [0, ) (E, r) complete, separable metric space S = D E [0, ) Modulus of continuity: w (x, δ, T ) = inf max {t i } i sup s,t [t i 1,t i ) r(x(s), x(t)) where the infimum is over {t i } satisfying 0 = t 0 < t 1 < < t m 1 < T t m and min 1 i n (t i t i 1 ) > δ X n stochastic process with sample paths in D E [0, ) X n adapted to {F n t }: For each t 0, X n (t) is F n t -measurable.

10 First Prev Next Go To Go Back Full Screen Close Quit 10 Tightness in D E [0, ) Theorem 3 (Skorohod) Suppose that for t T 0, a dense subset of [0, ), {X n (t)} is tight. Then {X n } is tight if and only if for each ɛ > 0 and T > 0 lim δ 0 lim sup P {w (X n, δ, T ) > ɛ} = 0. n Theorem 4 (Puhalskii) Suppose that for t T 0, a dense subset of [0, ), {X n (t)} is exponentially tight. Then {X n } is exponentially tight if and only if for each ɛ > 0 and T > 0 1 lim lim sup δ 0 n n log P {w (X n, δ, T ) > ɛ} =.

11 First Prev Next Go To Go Back Full Screen Close Quit 11 Identification of limit distribution Theorem 5 If {X n } is tight in D E [0, ) and (X n (t 1 ),..., X n (t k )) (X(t 1 ),..., X(t k )) for t 1,..., t k T 0, T 0 dense in [0, ), then X n X. Identification of rate function Theorem 6 If {X n } is exponentially tight in D E [0, ) and for each 0 t 1 < < t m, {(X n (t 1 ),..., X n (t m ))} satisfies the large deviation principle in E m with rate function I t1,...,t m, then {X n } satisfies the large deviation principle in D E [0, ) with good rate function I(x) = sup {t i } c x I t1,...,t m (x(t 1 ),..., x(t m )), where x is the set of discontinuities of x.

12 First Prev Next Go To Go Back Full Screen Close Quit 12 Conditions for tightness S n 0 (T ) collection of discrete {F n t }-stopping times q(x, y) = 1 r(x, y) Suppose that for t T 0, a dense subset of [0, ), {X n (t)} is tight. Then the following are equivalent. a) {X n } is tight in D E [0, ).

13 Conditions for tightness b) For T > 0, there exist β > 0 and random variables γ n (δ, T ), δ > 0, satisfying E[q β (X n (t + u), X n (t)) q β (X n (t), X n (t v)) F n t ] E[γ n (δ, T ) F n t ] (1) for 0 t T, 0 u δ, and 0 v t δ such that and lim δ 0 lim δ 0 lim sup E[γ n (δ, T )] = 0 n lim sup E[q β (X n (δ), X n (0))] = 0. (2) n Kurtz First Prev Next Go To Go Back Full Screen Close Quit 13

14 Conditions for tightness c) Condition (2) holds, and for each T > 0, there exists β > 0 such that C n (δ, T ) sup sup τ S0 n(t ) u δ E[ sup q β (X n (τ + u), X n (τ)) v δ τ satisfies lim δ 0 lim sup n C n (δ, T ) = 0. q β (X n (τ), X n (τ v))] Aldous First Prev Next Go To Go Back Full Screen Close Quit 14

15 First Prev Next Go To Go Back Full Screen Close Quit 15 Conditions for exponential tightness S n 0 (T ) collection of discrete {F n t }-stopping times q(x, y) = 1 r(x, y) Suppose that for t T 0, a dense subset of [0, ), {X n (t)} is exponentially tight. Then the following are equivalent. a) {X n } is exponentially tight in D E [0, ).

16 First Prev Next Go To Go Back Full Screen Close Quit 16 Conditions for exponential tightness b) For T > 0, there exist β > 0 and random variables γ n (δ, λ, T ), δ, λ > 0, satisfying E[e nλqβ (X n (t+u),x n (t)) q β (X n (t),x n (t v)) F n t ] E[e γ n(δ,λ,t ) F n t ] for 0 t T, 0 u δ, and 0 v t δ such that and 1 lim lim sup δ 0 n n log E[eγ n(δ,λ,t ) ] = 0, 1 lim lim sup δ 0 n n log (X n (δ),x n (0)) ] = 0. (3) E[enλqβ

17 First Prev Next Go To Go Back Full Screen Close Quit 17 Conditions for exponential tightness c) Condition (3) holds, and for each T > 0, there exists β > 0 such that for each λ > 0 C n (δ, λ, T ) sup sup τ S0 n(t ) u δ E[ sup e nλqβ (X n (τ+u),x n (τ)) q β (X n (τ),x n (τ v)) ] v δ τ satisfies lim δ 0 lim sup n 1 n log C n(δ, λ, T ) = 0.

18 First Prev Next Go To Go Back Full Screen Close Quit 18 Example W standard Brownian motion X n = 1 n W E[e nλ X n(t+u) X n (t) F W t ] = E[e λ n W (t+u) W (t) F W t ] 2e 1 2 nλ2 u so 1 lim lim sup δ 0 n n log E[eγ n(δ,λ,t ) 1 ] = lim δ 0 2 λ2 δ = 0.

19 First Prev Next Go To Go Back Full Screen Close Quit 19 Equivalence to tightness for functions Theorem 7 {X n } is tight in D E [0, ) if and only if a) (Compact containment condition) For each T > 0 and ɛ > 0, there exists a compact K ɛ,t E such that lim sup P ( t T X n (t) K ɛ,t ) ɛ n b) There exists a family of functions F C(E) that is closed under addition and separates points in E such that for each f F, {f(x n )} is tight in D R [0, ). Kurtz, Jakubowski

20 First Prev Next Go To Go Back Full Screen Close Quit 20 Equivalence to exponential tightness for functions Theorem 8 {X n } is exponentially tight in D E [0, ) if and only if a) For each T > 0 and a > 0, there exists a compact K a,t E such that 1 lim sup n n log P ( t T X n(t) K a,t ) a (4) b) There exists a family of functions F C(E) that is closed under addition and separates points in E such that for each f F, {f(x n )} is exponentially tight in D R [0, ). Schied

21 First Prev Next Go To Go Back Full Screen Close Quit 21 Large Deviations for Markov Processes Martingale problems and semigroups Semigroup convergence and the LDP Control representation of the rate function Viscosity solutions and semigroup convergence Summary of method

22 First Prev Next Go To Go Back Full Screen Close Quit 22 Markov processes X n = {X n (t), t 0} is a Markov process if E[g(X n (t + s)) F n t ] = E[g(X n (t + s)) X n (t)] The generator of a Markov process determines its short time behavior E[g(X n (t + t)) g(x n (t)) F t ] A n g(x n (t)) t

23 First Prev Next Go To Go Back Full Screen Close Quit 23 Martingale problems X n is a solution of the martingale problem for A n if and only if g(x n (t)) g(x n (0)) t is an {F n t }-martingale for each g D(A n ). 0 A n g(x n (s))ds (5) If g is bounded away from zero, (5) is a martingale if and only if g(x n (t)) exp{ t 0 A n g(x n (s)) g(x n (s)) ds} is a martingale. (You can always add a constant to g.)

24 First Prev Next Go To Go Back Full Screen Close Quit 24 Nonlinear generator Define D(H n ) = {f B(E) : e nf D(A n )} and set H n f = 1 n e nf A n e nf. Then exp{nf(x n (t)) nf(x(0)) is a {Ft n }-martingale. t 0 nh n f(x(s))ds}

25 First Prev Next Go To Go Back Full Screen Close Quit 25 Tightness for solutions of MGPs E[f(X n (t + u)) f(x n (t)) F n t ] = E[ t+u t A n f(x n (s))ds F n t ] u A n f For γ n (δ, T ) = δ( A n f f A n f ) (see (1)) E[(f(X n (t + u)) f(x n (t))) 2 F n t ] = E[ t+u t A n f 2 (X n (s))ds F n t ] 2f(X n (t))e[ t+u t A n f(x n (s))ds F n t ] u( A n f f A n f ) γ n (δ, T )

26 First Prev Next Go To Go Back Full Screen Close Quit 26 Exponential tightness E[e n(λf(x n(t+u)) λf(x n (t)) t+u t H n [λf](x n (s))ds F n t ] = 1 so and E[e nλ(f(x n(t+u)) f(x n (t))) F n t ] e nu H nλf γ n (δ, λ, T ) = δn( H n [λf] + H n [ λf] ) ET Conditions

27 First Prev Next Go To Go Back Full Screen Close Quit 27 The Markov process semigroup Assume that the martingale problem for A n is well-posed. Define T n (t)f(x) = E[f(X n (t)) X n (0) = x] By the Markov property T n (s)t n (t)f(x) = T n (t + s)f(x) T n (t)f(x) f(x) lim t 0 t = A n f(x)

28 Iterating the semigroup For 0 t 1 t 2, E[f 1 (X n (t 1 ))f 2 (X n (t 2 )) X n (0) = x] = T n (t 1 )(f 1 T n (t 2 t 1 )f 2 )(x) and in general E[f 1 (X n (t 1 )) f k (X n (t k )) X n (0) = x] = E[f 1 (X n (t 1 )) f k 1 (X n (t k 1 )) T n (t k t k 1 )f k (X n (t k 1 )) X n (0) = x] Convergence of the semigroups implies convergence of the finite dimensional distributions. First Prev Next Go To Go Back Full Screen Close Quit 28

29 First Prev Next Go To Go Back Full Screen Close Quit 29 A nonlinear semigroup (Fleming) Assume that the martingale problem for A n is well-posed. Define V n (t)f(x) = 1 n log E x[e nf(xn(t)) ] By the Markov property V n (s)v n (t)f(x) = V n (t + s)f(x) V n (t)f(x) f(x) lim t 0 t = 1 n e nf A n e nf (x) = H n f(x) Exponential generator

30 Iterating the semigroup For 0 t 1 t 2, define V n (t 1, t 2, f 1, f 2 )(x) = V n (t 1 )(f 1 + V n (t 2 t 1 )f 2 )(x) and inductively V n (t 1,..., t k, f 1,..., f k )(x) = V n (t 1 )(f 1 + V n (t 2,..., t k, f 2,..., f k ))(x). Then E[e n(f 1(X n (t 1 ))+ +f k (X n (t k ))) ] = E[e nv n(t 1,...,t k,f 1,...,f k )(X n (0)) ] By the Bryc-Varadhan result, convergence of semigroup should imply the finite dimensional LDP First Prev Next Go To Go Back Full Screen Close Quit 30

31 First Prev Next Go To Go Back Full Screen Close Quit 31 Weaker conditions for the LDP A collection of functions D C b (S) isolates points in S, if for each x S, each ɛ > 0, and each compact K S, there exists f D satisfying f(x) < ɛ, sup y K f(y) 0, and sup f(y) < 1 y K B ɛ. ɛ(x) c A collection of functions D C b (S) is bounded above if sup f D sup y f(y) <.

32 First Prev Next Go To Go Back Full Screen Close Quit 32 A rate determining class Proposition 9 Suppose {X n } is exponentially tight, and let 1 Γ = {f C b (S) : Λ(f) = lim n n log E[enf(X n) ] exists}. If D Γ is bounded above and isolates points, then Γ = C b (S) and I(x) = sup{f(x) Λ(f)}. f D

33 First Prev Next Go To Go Back Full Screen Close Quit 33 Semigroup convergence and the LDP Suppose D C b (E) contains a set that is bounded above and isolates points. Suppose X n (0) = x and {X n (t)} is exponentially tight. If V n (t)f(x) V (t)f(x) for each f D, then {X n (t)} satisfies a LDP with rate function I t (y x) = sup{f(y) V (t)f(x)}, f D and hence V (t)f(x) = sup{f(y) I t (y x)} y Think of I t (y x) as the large deviation analog of a transition density.

34 Iterating the semigroup Suppose D is closed under addition, V (t) : D D, t 0, and 0 t 1 t 2. Define and inductively V (t 1, t 2, f 1, f 2 )(x) = V (t 1 )(f 1 + V (t 2 t 1 )f 2 )(x) V (t 1,..., t k, f 1,..., f k )(x) = V (t 1 )(f 1 + V (t 2,..., t k, f 2,..., f k ))(x) First Prev Next Go To Go Back Full Screen Close Quit 34

35 First Prev Next Go To Go Back Full Screen Close Quit 35 Semigroup convergence and the LDP Theorem 10 For each n, let A n C b (E) B(E), and suppose that existence and uniqueness holds for the D E [0, )-martingale problem for (A n, µ) for each initial distribution µ P(E). Let D C b (E) be closed under addition and contain a set that is bounded above and isolates points, and suppose that there exists an operator semigroup {V (t)} on D such that for each compact K E sup V (t)f(x) V n (t)f(x) 0, f D. x K

36 Suppose that {X n } is exponentially tight, and that {X n (0)} satisfies a large deviation principle with good rate function I 0. Define 1 Λ 0 (f) = lim n n log E[enf(X n(0)) ], f C b (E). a) For each 0 t 1 < < t k and f 1,..., f k D, Recall 1 lim n n log E[enf 1(X n (t 1 ))+...+nf k (X n (t k )) ] = Λ 0 (V (t 1,..., t k, f 1,..., f k )). E[e n(f 1(X n (t 1 ))+ +f k (X n (t k ))) ] = E[e nv n(t 1,...,t k,f 1,...,f k )(X n (0)) ] First Prev Next Go To Go Back Full Screen Close Quit 36

37 First Prev Next Go To Go Back Full Screen Close Quit 37 b) For 0 t 1 <... < t k {(X n (t 1 ),..., X n (t k ))} satisfies the large deviation principle with rate function I t1,...,t k (x 1,..., x k ) (6) = sup {f 1 (x 1 ) f k (x k ) f 1,...,f k D C b (E) Λ 0 (V (t 1,..., t k, f 1,..., f k ))} = inf x 0 E (I 0(x 0 ) + k I ti t i 1 (x i x i 1 )) i=1 c) {X n } satisfies the large deviation principle in D E [0, ) with rate function I(x) = sup {t i } c x I t1,...,t k (x(t 1 ),..., x(t k )) k = sup {t i } c x (I 0 (x(0)) + I ti t i 1 (x(t i ) x(t i 1 ))) i=1

38 First Prev Next Go To Go Back Full Screen Close Quit 38 Example: Freidlin and Wentzell small diffusion Let X n satisfying the Itô equation X n (t) = x + 1 n t 0 σ(x n (s ))dw (s) + and define a(x) = σ T (x) σ(x). Then A n g(x) = 1 a ij (x) i j g(x) + 2n i ij t 0 b(x n (s))ds, b i (x) i g(x), Take D(A n ) to be the collection of functions of the form c + f, c R and f C 2 c (R d ).

39 First Prev Next Go To Go Back Full Screen Close Quit 39 Convergence of the nonlinear generator H n f(x) = 1 2n and Hf = lim n H n f is a ij (x) ij f(x) + 1 a ij (x) i f(x) j f(x) 2 ij ij + i b i (x) i f(x). Hf(x) = 1 2 ( f(x))t a(x) f(x) + b(x) f(x).

40 First Prev Next Go To Go Back Full Screen Close Quit 40 A control problem Let (E, r) and (U, q) be complete, separable metric spaces, and let A : D(A) C b (E) C(E U) Let H be as above, and suppose that that there is a nonnegative, lower semicontinuous function L on E U such that Hf(x) = sup(af(x, u) L(x, u)). u U {V (t)} should be the Nisio semigroup corresponding to an optimal control problem with reward function L. (cf. Book by Dupuis and Ellis)

41 First Prev Next Go To Go Back Full Screen Close Quit 41 Dynamics of control problem Require f(x(t)) f(x(0)) U [0,t] Af(x(s), u)λ s (du ds) = 0, for each f D(A) and t 0, where x D E [0, ) and λ M m (U), the space of measures on U [0, ) satisfying λ(u [0, t]) = t.) For each x 0 E, we should have V (t)g(x 0 ) = sup (x,λ) J t x 0 {g(x(t)) [0,t] U L(x(s), u)λ(du ds)}

42 First Prev Next Go To Go Back Full Screen Close Quit 42 Representation theorem Theorem 11 Suppose (E, r) and (U, q) are complete, separable, metric spaces. Let A : D(A) C b (E) C(E U) and lower semicontinuous L(x, u) 0 satisfy 1. D(A) is convergence determining. 2. For each x 0 E, there exists (x, λ) J such that x(0) = x 0 and L(x(s), u)λ(du ds) = 0, t 0. U [0,t] 3. For each f D(A), there exists a nondecreasing function ψ f : [0, ) [0, ) such that Af(x, u) ψ f (L(x, u)), (x, u) E U, and lim r r 1 ψ f (r) = 0.

43 First Prev Next Go To Go Back Full Screen Close Quit There exists a tightness function Φ on E U, such that Φ(x, u) L(x, u) for (x, u) E U. Let {V (t)} be an LDP limit semigroup and satisfy the control identity. Then I(x) = I 0 (x(0)) + inf { L(x(s), u)λ(du ds)}. λ:(x,λ) J U [0, )

44 First Prev Next Go To Go Back Full Screen Close Quit 44 Small diffusion Hf(x) = 1 2 ( f(x))t a(x) f(x) + b(x) f(x) For and Af(x, u) = u f(x) L(x, u) = 1 2 (u b(x)a(x) 1 (u b(x)), I(x) = 0 Hf(x) = sup u R d (Af(x, u) L(x, u)) 1 2 (ẋ(s) b(x(s))a(x(s)) 1 (ẋ(s) b(x(s)))ds

45 First Prev Next Go To Go Back Full Screen Close Quit 45 Alternative representation For and again Af(x, u) = (u T σ(x) + b(x)) f(x) L(x, u) = 1 2 u 2, Hf(x) = sup(af(x, u) L(x, u)) u R d 1 I(x) = inf{ 0 2 u(s) 2 ds : ẋ(t) = u T (t)σ(x(t)) + b(x(t))}

46 First Prev Next Go To Go Back Full Screen Close Quit 46 Legendre transform approach If Hf(x) = H(x, f(x)), where H(x, p) is convex and continuous in p, then L(x, u) = sup p R d {p u H(x, p)} and H(x, p) = sup{p u L(x, u)}, u R d so taking Af(x, u) = u f(x), Hf(x) = sup u R d {u f(x) L(x, u)}

47 First Prev Next Go To Go Back Full Screen Close Quit 47 Viscosity solutions Let E be compact, H C(E) B(E), and (f, g) H imply (f +c, g) H. Fix h C(E) and α > 0. f B(E) is a viscosity subsolution of f αhf = h (7) if and only if f is upper semicontinuous and for each (f 0, g 0 ) H there exists x 0 E satisfying (f f 0 )(x 0 ) = sup x (f(x) f 0 (x)) and or equivalently f(x 0 ) h(x 0 ) α (g 0 ) (x 0 ) f(x 0 ) α(g 0 ) (x 0 ) + h(x 0 )

48 First Prev Next Go To Go Back Full Screen Close Quit 48 f B(E) is a viscosity supersolution of (7) if and only if f is lower semicontinuous and for each (f 0, g 0 ) H there exists x 0 E satisfying (f 0 f)(x 0 ) = sup x (f 0 (x) f(x)) and or f(x 0 ) h(x 0 ) (g 0 ) (x 0 ) α f(x 0 ) α(g 0 ) (x 0 ) + h(x 0 ) A function f C(E) is a viscosity solution of f αhf = h if it is both a subsolution and a supersolution.

49 First Prev Next Go To Go Back Full Screen Close Quit 49 Comparison principle The equation f αhf = h satisfies a comparison principle, if f a viscosity subsolution and f a viscosity supersolution implies f f on E.

50 First Prev Next Go To Go Back Full Screen Close Quit 50 Viscosity approach to semigroup convergence Theorem 12 Let (E, r) be a compact metric space, and for n = 1, 2,..., assume that the martingale problem for A n B(E) B(E) is well-posed. Let H n f = 1 n e nf A n e nf, e nf D(A n ), and let H C(E) B(E) with D(H) dense in C(E). Suppose that for each (f, g) H, there exists (f n, g n ) H n such that f f n 0 and g g n 0.

51 First Prev Next Go To Go Back Full Screen Close Quit 51 Fix α 0 > 0. Suppose that for each 0 < α < α 0, there exists a dense subset D α C(E) such that for each h D α, the comparison principle holds for (I αh)f = h. Then there exists {V (t)} on C(E) such that sup V (t)f(x) V n (t)f(x) 0, f C(E). x If {X n (0)} satisfies a large deviation principle with a good rate function. Then {X n } is exponentially tight and satisfies a large deviation principle with rate function I given above (6).

52 First Prev Next Go To Go Back Full Screen Close Quit 52 Proof of a large deviation principle 1. Verify convergence of the sequence of operators H n and derive the limit operator H. In general, convergence will be in the extended limit or graph sense. 2. Verify exponential tightness. Given the convergence of H n, exponential tightness typically follows provided one can verify the exponential compact containment condition. 3. Verify the range condition or the comparison principle for the limiting operator H. The rate function is characterized by the limiting semigroup. 4. Construct a variational representation for H. This representation typically gives a more explicit representation of the rate function.

53 First Prev Next Go To Go Back Full Screen Close Quit 53 R d -valued processes Let a = σσ T, and define A n f(x) = n (f(x + 1 R d n z) f(x) 1 z f(x))η(x, dz) n +b(x) f(x) + 1 a ij (x) i j f(x) 2n ij

54 First Prev Next Go To Go Back Full Screen Close Quit 54 Nonlinear generator The operator H n f = 1 n e nf A n e nf is given by H n f(x) = (e n(f(x+ 1 z) f(x)) n 1 z f(x))η(x, dz) R d + 1 a ij (x) i j f(x) 2n ij + 1 a ij (x) i f(x) j f(x) + b(x) f(x) 2 ij

55 First Prev Next Go To Go Back Full Screen Close Quit 55 Limiting operator Hf(x) = (e f(x) z 1 z f(x))η(x, dz) R d + 1 a ij (x) i f(x) j f(x) + b(x) f(x) 2 ij Note that H has the form Hf(x) = H(x, f(x)) for H(x, p) = 1 2 σt (x)p 2 + b(x) p + (e p z 1 p z)η(x, dz) R d pc

56 First Prev Next Go To Go Back Full Screen Close Quit 56 Gradient limit operators Condition For each compact Γ R d, there exist µ m + and ω : (0, ) [0, ] such that {(x m, y m )} Γ Γ, µ m x m y m 2 0, and imply sup H (y m, µ m (x m y m )) < m lim inf m [λh (x m, µ m(x m y m ) ) H (y m, µ m (x m y m ))] ω(λ) λ and inf ω(λ) 0. lim ɛ 0 λ 1 ɛ 2. If x m and p m 0, then lim m H(x m, p m ) = 0.

57 First Prev Next Go To Go Back Full Screen Close Quit 57 Conditions for comparison principle Lemma 14 If Condition 13 is satisfied, then for h C(E) and α > 0, the comparison principle holds for (I αh)f = h.

58 First Prev Next Go To Go Back Full Screen Close Quit 58 Sufficient conditions Lemma 15 Suppose σ and b are bounded and Lipschitz and η = 0. Then Condition 13 holds with { 0 λ > 1 ω(λ) = λ 1. If H is continuous and for each x, p R d lim r H(x, rp) =, then Condition 13.1 holds with { 0 λ = 1 ω(λ) = λ 1. If σ and b are bounded and lim sup (e p z 1 p z)η(x, dz) = 0, p 0 x R d then Condition 13.2 holds.

59 First Prev Next Go To Go Back Full Screen Close Quit 59 Diffusions with periodic coefficients (Baldi) Let σ be periodic (for each 1 i d, there is a period p i > 0 such that σ(y) = σ(y + p i e i ) for all y R d ), and let X n satisfy the Itô equation dx n (t) = 1 n σ(α n X n (t))dw (t), where α n > 0 and lim n n 1 α n =. Let a = σσ T. Then and H n f(x) = 1 2n A n f(x) = 1 2 a ij (α n x) f(x), n x i x j ij a ij (α n x) ij f(x) + 1 a ij (α n x) i f(x) j f(x). 2 ij ij

60 First Prev Next Go To Go Back Full Screen Close Quit 60 Limit operator Let f n (x) = f(x) + ɛ n h(x, α n x), where ɛ n = nα 2 n. ɛ n α n = nα 1 n 0 If h has the same periods in y as the a ij and 1 ( ) 2 a ij (y) h(x, y) + i f(x) j f(x) = g(x) 2 y i y j ij for some g independent of y, then lim H nf n (x, y) = g(x). n

61 First Prev Next Go To Go Back Full Screen Close Quit 61 It follows that g(x) = 1 a ij i f(x) j f(x), 2 ij where a ij is the average of a ij with respect to the stationary distribution for the diffusion on [0, p 1 ] [0, p d ] whose generator is A 0 f(y) = 1 2 a ij (y) f(y) 2 y i y j with periodic boundary conditions. In particular, h(x, y) = 1 h ij (y) i f(x) j f(x), 2 where h ij satisfies ij i,j A 0 h ij (y) = a ij a ij (y).

LARGE DEVIATIONS FOR STOCHASTIC PROCESSES

LARGE DEVIATIONS FOR STOCHASTIC PROCESSES LARGE DEVIATIONS FOR STOCHASTIC PROCESSES By Stefan Adams Abstract: The notes are devoted to results on large deviations for sequences of Markov processes following closely the book by Feng and Kurtz ([FK06]).

More information

Large Deviations for Stochastic Processes. Jin Feng Thomas G. Kurtz

Large Deviations for Stochastic Processes. Jin Feng Thomas G. Kurtz Large Deviations for Stochastic Processes Jin Feng Thomas G. Kurtz Department of Mathematics and Statistics, University of Massachusetts, Amherst, MA 3-455 E-mail address: feng@math.umass.edu Departments

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

for all f satisfying E[ f(x) ] <.

for all f satisfying E[ f(x) ] <. . Let (Ω, F, P ) be a probability space and D be a sub-σ-algebra of F. An (H, H)-valued random variable X is independent of D if and only if P ({X Γ} D) = P {X Γ}P (D) for all Γ H and D D. Prove that if

More information

{σ x >t}p x. (σ x >t)=e at.

{σ x >t}p x. (σ x >t)=e at. 3.11. EXERCISES 121 3.11 Exercises Exercise 3.1 Consider the Ornstein Uhlenbeck process in example 3.1.7(B). Show that the defined process is a Markov process which converges in distribution to an N(0,σ

More information

Kai Lai Chung

Kai Lai Chung First Prev Next Go To Go Back Full Screen Close Quit 1 Kai Lai Chung 1917-29 Mathematicians are more inclined to build fire stations than to put out fires. Courses from Chung First Prev Next Go To Go Back

More information

Lecture 5: Importance sampling and Hamilton-Jacobi equations

Lecture 5: Importance sampling and Hamilton-Jacobi equations Lecture 5: Importance sampling and Hamilton-Jacobi equations Henrik Hult Department of Mathematics KTH Royal Institute of Technology Sweden Summer School on Monte Carlo Methods and Rare Events Brown University,

More information

Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence

Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations

More information

Large Deviations from the Hydrodynamic Limit for a System with Nearest Neighbor Interactions

Large Deviations from the Hydrodynamic Limit for a System with Nearest Neighbor Interactions Large Deviations from the Hydrodynamic Limit for a System with Nearest Neighbor Interactions Amarjit Budhiraja Department of Statistics & Operations Research University of North Carolina at Chapel Hill

More information

Reflected Brownian Motion

Reflected Brownian Motion Chapter 6 Reflected Brownian Motion Often we encounter Diffusions in regions with boundary. If the process can reach the boundary from the interior in finite time with positive probability we need to decide

More information

The Wiener Itô Chaos Expansion

The Wiener Itô Chaos Expansion 1 The Wiener Itô Chaos Expansion The celebrated Wiener Itô chaos expansion is fundamental in stochastic analysis. In particular, it plays a crucial role in the Malliavin calculus as it is presented in

More information

13 The martingale problem

13 The martingale problem 19-3-2012 Notations Ω complete metric space of all continuous functions from [0, + ) to R d endowed with the distance d(ω 1, ω 2 ) = k=1 ω 1 ω 2 C([0,k];H) 2 k (1 + ω 1 ω 2 C([0,k];H) ), ω 1, ω 2 Ω. F

More information

Some Properties of NSFDEs

Some Properties of NSFDEs Chenggui Yuan (Swansea University) Some Properties of NSFDEs 1 / 41 Some Properties of NSFDEs Chenggui Yuan Swansea University Chenggui Yuan (Swansea University) Some Properties of NSFDEs 2 / 41 Outline

More information

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

g 2 (x) (1/3)M 1 = (1/3)(2/3)M. COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is

More information

4.6 Example of non-uniqueness.

4.6 Example of non-uniqueness. 66 CHAPTER 4. STOCHASTIC DIFFERENTIAL EQUATIONS. 4.6 Example of non-uniqueness. If we try to construct a solution to the martingale problem in dimension coresponding to a(x) = x α with

More information

On continuous time contract theory

On continuous time contract theory Ecole Polytechnique, France Journée de rentrée du CMAP, 3 octobre, 218 Outline 1 2 Semimartingale measures on the canonical space Random horizon 2nd order backward SDEs (Static) Principal-Agent Problem

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear

More information

Math 735: Stochastic Analysis

Math 735: Stochastic Analysis First Prev Next Go To Go Back Full Screen Close Quit 1 Math 735: Stochastic Analysis 1. Introduction and review 2. Notions of convergence 3. Continuous time stochastic processes 4. Information and conditional

More information

p 1 ( Y p dp) 1/p ( X p dp) 1 1 p

p 1 ( Y p dp) 1/p ( X p dp) 1 1 p Doob s inequality Let X(t) be a right continuous submartingale with respect to F(t), t 1 P(sup s t X(s) λ) 1 λ {sup s t X(s) λ} X + (t)dp 2 For 1 < p

More information

MATH 6605: SUMMARY LECTURE NOTES

MATH 6605: SUMMARY LECTURE NOTES MATH 6605: SUMMARY LECTURE NOTES These notes summarize the lectures on weak convergence of stochastic processes. If you see any typos, please let me know. 1. Construction of Stochastic rocesses A stochastic

More information

ON THE POLICY IMPROVEMENT ALGORITHM IN CONTINUOUS TIME

ON THE POLICY IMPROVEMENT ALGORITHM IN CONTINUOUS TIME ON THE POLICY IMPROVEMENT ALGORITHM IN CONTINUOUS TIME SAUL D. JACKA AND ALEKSANDAR MIJATOVIĆ Abstract. We develop a general approach to the Policy Improvement Algorithm (PIA) for stochastic control problems

More information

Feller Processes and Semigroups

Feller Processes and Semigroups Stat25B: Probability Theory (Spring 23) Lecture: 27 Feller Processes and Semigroups Lecturer: Rui Dong Scribe: Rui Dong ruidong@stat.berkeley.edu For convenience, we can have a look at the list of materials

More information

Martingale Problems. Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi

Martingale Problems. Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi s Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi Lectures on Probability and Stochastic Processes III Indian Statistical Institute, Kolkata 20 24 November

More information

I forgot to mention last time: in the Ito formula for two standard processes, putting

I forgot to mention last time: in the Ito formula for two standard processes, putting I forgot to mention last time: in the Ito formula for two standard processes, putting dx t = a t dt + b t db t dy t = α t dt + β t db t, and taking f(x, y = xy, one has f x = y, f y = x, and f xx = f yy

More information

Proofs of the martingale FCLT

Proofs of the martingale FCLT Probability Surveys Vol. 4 (2007) 268 302 ISSN: 1549-5787 DOI: 10.1214/07-PS122 Proofs of the martingale FCLT Ward Whitt Department of Industrial Engineering and Operations Research Columbia University,

More information

Convergence of Markov Processes. Amanda Turner University of Cambridge

Convergence of Markov Processes. Amanda Turner University of Cambridge Convergence of Markov Processes Amanda Turner University of Cambridge 1 Contents 1 Introduction 2 2 The Space D E [, 3 2.1 The Skorohod Topology................................ 3 3 Convergence of Probability

More information

1. Stochastic equations for Markov processes

1. Stochastic equations for Markov processes First Prev Next Go To Go Back Full Screen Close Quit 1 1. Stochastic equations for Markov processes Filtrations and the Markov property Ito equations for diffusion processes Poisson random measures Ito

More information

The concentration of a drug in blood. Exponential decay. Different realizations. Exponential decay with noise. dc(t) dt.

The concentration of a drug in blood. Exponential decay. Different realizations. Exponential decay with noise. dc(t) dt. The concentration of a drug in blood Exponential decay C12 concentration 2 4 6 8 1 C12 concentration 2 4 6 8 1 dc(t) dt = µc(t) C(t) = C()e µt 2 4 6 8 1 12 time in minutes 2 4 6 8 1 12 time in minutes

More information

Random and Deterministic perturbations of dynamical systems. Leonid Koralov

Random and Deterministic perturbations of dynamical systems. Leonid Koralov Random and Deterministic perturbations of dynamical systems Leonid Koralov - M. Freidlin, L. Koralov Metastability for Nonlinear Random Perturbations of Dynamical Systems, Stochastic Processes and Applications

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS PROBABILITY: LIMIT THEOREMS II, SPRING 218. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please

More information

Large Deviations Principles for McKean-Vlasov SDEs, Skeletons, Supports and the law of iterated logarithm

Large Deviations Principles for McKean-Vlasov SDEs, Skeletons, Supports and the law of iterated logarithm Large Deviations Principles for McKean-Vlasov SDEs, Skeletons, Supports and the law of iterated logarithm Gonçalo dos Reis University of Edinburgh (UK) & CMA/FCT/UNL (PT) jointly with: W. Salkeld, U. of

More information

Nonlinear representation, backward SDEs, and application to the Principal-Agent problem

Nonlinear representation, backward SDEs, and application to the Principal-Agent problem Nonlinear representation, backward SDEs, and application to the Principal-Agent problem Ecole Polytechnique, France April 4, 218 Outline The Principal-Agent problem Formulation 1 The Principal-Agent problem

More information

Stochastic optimal control with rough paths

Stochastic optimal control with rough paths Stochastic optimal control with rough paths Paul Gassiat TU Berlin Stochastic processes and their statistics in Finance, Okinawa, October 28, 2013 Joint work with Joscha Diehl and Peter Friz Introduction

More information

Large deviations for stochastic Navier-Stokes equations with nonlinear viscosities

Large deviations for stochastic Navier-Stokes equations with nonlinear viscosities Louisiana State University LSU Digital Commons LSU Doctoral Dissertations Graduate School 213 Large deviations for stochastic Navier-Stokes equations with nonlinear viscosities Ming Tao Louisiana State

More information

Weak convergence and Brownian Motion. (telegram style notes) P.J.C. Spreij

Weak convergence and Brownian Motion. (telegram style notes) P.J.C. Spreij Weak convergence and Brownian Motion (telegram style notes) P.J.C. Spreij this version: December 8, 2006 1 The space C[0, ) In this section we summarize some facts concerning the space C[0, ) of real

More information

2a Large deviation principle (LDP) b Contraction principle c Change of measure... 10

2a Large deviation principle (LDP) b Contraction principle c Change of measure... 10 Tel Aviv University, 2007 Large deviations 5 2 Basic notions 2a Large deviation principle LDP......... 5 2b Contraction principle................ 9 2c Change of measure................. 10 The formalism

More information

Martingale problems and stochastic equations for Markov processes

Martingale problems and stochastic equations for Markov processes First Prev Next Go To Go Back Full Screen Close Quit 1 Martingale problems and stochastic equations for Markov processes 1. Basics of stochastic processes 2. Markov processes and generators 3. Martingale

More information

Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )

Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( ) Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca November 26th, 2014 E. Tanré (INRIA - Team Tosca) Mathematical

More information

OPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS

OPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS APPLICATIONES MATHEMATICAE 29,4 (22), pp. 387 398 Mariusz Michta (Zielona Góra) OPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS Abstract. A martingale problem approach is used first to analyze

More information

BSDEs and PDEs with discontinuous coecients Applications to homogenization K. Bahlali, A. Elouain, E. Pardoux. Jena, March 2009

BSDEs and PDEs with discontinuous coecients Applications to homogenization K. Bahlali, A. Elouain, E. Pardoux. Jena, March 2009 BSDEs and PDEs with discontinuous coecients Applications to homogenization K. Bahlali, A. Elouain, E. Pardoux. Jena, 16-20 March 2009 1 1) L p viscosity solution to 2nd order semilinear parabolic PDEs

More information

1. Stochastic Processes and filtrations

1. Stochastic Processes and filtrations 1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S

More information

Branching Processes II: Convergence of critical branching to Feller s CSB

Branching Processes II: Convergence of critical branching to Feller s CSB Chapter 4 Branching Processes II: Convergence of critical branching to Feller s CSB Figure 4.1: Feller 4.1 Birth and Death Processes 4.1.1 Linear birth and death processes Branching processes can be studied

More information

1 Independent increments

1 Independent increments Tel Aviv University, 2008 Brownian motion 1 1 Independent increments 1a Three convolution semigroups........... 1 1b Independent increments.............. 2 1c Continuous time................... 3 1d Bad

More information

Brownian Motion. 1 Definition Brownian Motion Wiener measure... 3

Brownian Motion. 1 Definition Brownian Motion Wiener measure... 3 Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................

More information

Differential Games II. Marc Quincampoix Université de Bretagne Occidentale ( Brest-France) SADCO, London, September 2011

Differential Games II. Marc Quincampoix Université de Bretagne Occidentale ( Brest-France) SADCO, London, September 2011 Differential Games II Marc Quincampoix Université de Bretagne Occidentale ( Brest-France) SADCO, London, September 2011 Contents 1. I Introduction: A Pursuit Game and Isaacs Theory 2. II Strategies 3.

More information

9.2 Branching random walk and branching Brownian motions

9.2 Branching random walk and branching Brownian motions 168 CHAPTER 9. SPATIALLY STRUCTURED MODELS 9.2 Branching random walk and branching Brownian motions Branching random walks and branching diffusions have a long history. A general theory of branching Markov

More information

Exercises Measure Theoretic Probability

Exercises Measure Theoretic Probability Exercises Measure Theoretic Probability 2002-2003 Week 1 1. Prove the folloing statements. (a) The intersection of an arbitrary family of d-systems is again a d- system. (b) The intersection of an arbitrary

More information

Real Analysis Problems

Real Analysis Problems Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.

More information

Exercises Measure Theoretic Probability

Exercises Measure Theoretic Probability Exercises Measure Theoretic Probability Chapter 1 1. Prove the folloing statements. (a) The intersection of an arbitrary family of d-systems is again a d- system. (b) The intersection of an arbitrary family

More information

Mañé s Conjecture from the control viewpoint

Mañé s Conjecture from the control viewpoint Mañé s Conjecture from the control viewpoint Université de Nice - Sophia Antipolis Setting Let M be a smooth compact manifold of dimension n 2 be fixed. Let H : T M R be a Hamiltonian of class C k, with

More information

1 Brownian Local Time

1 Brownian Local Time 1 Brownian Local Time We first begin by defining the space and variables for Brownian local time. Let W t be a standard 1-D Wiener process. We know that for the set, {t : W t = } P (µ{t : W t = } = ) =

More information

Theoretical Tutorial Session 2

Theoretical Tutorial Session 2 1 / 36 Theoretical Tutorial Session 2 Xiaoming Song Department of Mathematics Drexel University July 27, 216 Outline 2 / 36 Itô s formula Martingale representation theorem Stochastic differential equations

More information

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure

More information

4th Preparation Sheet - Solutions

4th Preparation Sheet - Solutions Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space

More information

Lipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator

Lipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator Lipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator Thi Tuyen Nguyen Ph.D student of University of Rennes 1 Joint work with: Prof. E. Chasseigne(University of

More information

Walsh Diffusions. Andrey Sarantsev. March 27, University of California, Santa Barbara. Andrey Sarantsev University of Washington, Seattle 1 / 1

Walsh Diffusions. Andrey Sarantsev. March 27, University of California, Santa Barbara. Andrey Sarantsev University of Washington, Seattle 1 / 1 Walsh Diffusions Andrey Sarantsev University of California, Santa Barbara March 27, 2017 Andrey Sarantsev University of Washington, Seattle 1 / 1 Walsh Brownian Motion on R d Spinning measure µ: probability

More information

1 Weak Convergence in R k

1 Weak Convergence in R k 1 Weak Convergence in R k Byeong U. Park 1 Let X and X n, n 1, be random vectors taking values in R k. These random vectors are allowed to be defined on different probability spaces. Below, for the simplicity

More information

Wiener Measure and Brownian Motion

Wiener Measure and Brownian Motion Chapter 16 Wiener Measure and Brownian Motion Diffusion of particles is a product of their apparently random motion. The density u(t, x) of diffusing particles satisfies the diffusion equation (16.1) u

More information

The Pedestrian s Guide to Local Time

The Pedestrian s Guide to Local Time The Pedestrian s Guide to Local Time Tomas Björk, Department of Finance, Stockholm School of Economics, Box 651, SE-113 83 Stockholm, SWEDEN tomas.bjork@hhs.se November 19, 213 Preliminary version Comments

More information

lim n C1/n n := ρ. [f(y) f(x)], y x =1 [f(x) f(y)] [g(x) g(y)]. (x,y) E A E(f, f),

lim n C1/n n := ρ. [f(y) f(x)], y x =1 [f(x) f(y)] [g(x) g(y)]. (x,y) E A E(f, f), 1 Part I Exercise 1.1. Let C n denote the number of self-avoiding random walks starting at the origin in Z of length n. 1. Show that (Hint: Use C n+m C n C m.) lim n C1/n n = inf n C1/n n := ρ.. Show that

More information

The large deviation principle for the Erdős-Rényi random graph

The large deviation principle for the Erdős-Rényi random graph The large deviation principle for the Erdős-Rényi random graph (Courant Institute, NYU) joint work with S. R. S. Varadhan Main objective: how to count graphs with a given property Only consider finite

More information

A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION

A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION O. SAVIN. Introduction In this paper we study the geometry of the sections for solutions to the Monge- Ampere equation det D 2 u = f, u

More information

A relative entropy characterization of the growth rate of reward in risk-sensitive control

A relative entropy characterization of the growth rate of reward in risk-sensitive control 1 / 47 A relative entropy characterization of the growth rate of reward in risk-sensitive control Venkat Anantharam EECS Department, University of California, Berkeley (joint work with Vivek Borkar, IIT

More information

Zangwill s Global Convergence Theorem

Zangwill s Global Convergence Theorem Zangwill s Global Convergence Theorem A theory of global convergence has been given by Zangwill 1. This theory involves the notion of a set-valued mapping, or point-to-set mapping. Definition 1.1 Given

More information

Selçuk Demir WS 2017 Functional Analysis Homework Sheet

Selçuk Demir WS 2017 Functional Analysis Homework Sheet Selçuk Demir WS 2017 Functional Analysis Homework Sheet 1. Let M be a metric space. If A M is non-empty, we say that A is bounded iff diam(a) = sup{d(x, y) : x.y A} exists. Show that A is bounded iff there

More information

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2) 14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence

More information

Stochastic Calculus February 11, / 33

Stochastic Calculus February 11, / 33 Martingale Transform M n martingale with respect to F n, n =, 1, 2,... σ n F n (σ M) n = n 1 i= σ i(m i+1 M i ) is a Martingale E[(σ M) n F n 1 ] n 1 = E[ σ i (M i+1 M i ) F n 1 ] i= n 2 = σ i (M i+1 M

More information

Stability of Stochastic Differential Equations

Stability of Stochastic Differential Equations Lyapunov stability theory for ODEs s Stability of Stochastic Differential Equations Part 1: Introduction Department of Mathematics and Statistics University of Strathclyde Glasgow, G1 1XH December 2010

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

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x

More information

Math 635: An Introduction to Brownian Motion and Stochastic Calculus

Math 635: An Introduction to Brownian Motion and Stochastic Calculus First Prev Next Go To Go Back Full Screen Close Quit 1 Math 635: An Introduction to Brownian Motion and Stochastic Calculus 1. Introduction and review 2. Notions of convergence and results from measure

More information

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Noèlia Viles Cuadros BCAM- Basque Center of Applied Mathematics with Prof. Enrico

More information

Poisson Jumps in Credit Risk Modeling: a Partial Integro-differential Equation Formulation

Poisson Jumps in Credit Risk Modeling: a Partial Integro-differential Equation Formulation Poisson Jumps in Credit Risk Modeling: a Partial Integro-differential Equation Formulation Jingyi Zhu Department of Mathematics University of Utah zhu@math.utah.edu Collaborator: Marco Avellaneda (Courant

More information

CONSTRUCTING STRONG MARKOV PROCESSES

CONSTRUCTING STRONG MARKOV PROCESSES CONSTRUCTING STRONG MARKOV PROCESSES ROBERT J. VANDERBEI Abstract. The construction presented in this paper can be briefly described as follows: starting from any finite-dimensional Markov transition function

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

Mean Field Games on networks

Mean Field Games on networks Mean Field Games on networks Claudio Marchi Università di Padova joint works with: S. Cacace (Rome) and F. Camilli (Rome) C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, 2017

More information

Nonlinear Systems Theory

Nonlinear Systems Theory Nonlinear Systems Theory Matthew M. Peet Arizona State University Lecture 2: Nonlinear Systems Theory Overview Our next goal is to extend LMI s and optimization to nonlinear systems analysis. Today we

More information

Lecture 3: Expected Value. These integrals are taken over all of Ω. If we wish to integrate over a measurable subset A Ω, we will write

Lecture 3: Expected Value. These integrals are taken over all of Ω. If we wish to integrate over a measurable subset A Ω, we will write Lecture 3: Expected Value 1.) Definitions. If X 0 is a random variable on (Ω, F, P), then we define its expected value to be EX = XdP. Notice that this quantity may be. For general X, we say that EX exists

More information

On the martingales obtained by an extension due to Saisho, Tanemura and Yor of Pitman s theorem

On the martingales obtained by an extension due to Saisho, Tanemura and Yor of Pitman s theorem On the martingales obtained by an extension due to Saisho, Tanemura and Yor of Pitman s theorem Koichiro TAKAOKA Dept of Applied Physics, Tokyo Institute of Technology Abstract M Yor constructed a family

More information

Exercises in stochastic analysis

Exercises in stochastic analysis Exercises in stochastic analysis Franco Flandoli, Mario Maurelli, Dario Trevisan The exercises with a P are those which have been done totally or partially) in the previous lectures; the exercises with

More information

LECTURE 2: LOCAL TIME FOR BROWNIAN MOTION

LECTURE 2: LOCAL TIME FOR BROWNIAN MOTION LECTURE 2: LOCAL TIME FOR BROWNIAN MOTION We will define local time for one-dimensional Brownian motion, and deduce some of its properties. We will then use the generalized Ray-Knight theorem proved in

More information

VISCOSITY SOLUTIONS. We follow Han and Lin, Elliptic Partial Differential Equations, 5.

VISCOSITY SOLUTIONS. We follow Han and Lin, Elliptic Partial Differential Equations, 5. VISCOSITY SOLUTIONS PETER HINTZ We follow Han and Lin, Elliptic Partial Differential Equations, 5. 1. Motivation Throughout, we will assume that Ω R n is a bounded and connected domain and that a ij C(Ω)

More information

16 1 Basic Facts from Functional Analysis and Banach Lattices

16 1 Basic Facts from Functional Analysis and Banach Lattices 16 1 Basic Facts from Functional Analysis and Banach Lattices 1.2.3 Banach Steinhaus Theorem Another fundamental theorem of functional analysis is the Banach Steinhaus theorem, or the Uniform Boundedness

More information

Stochastic Differential Equations

Stochastic Differential Equations CHAPTER 1 Stochastic Differential Equations Consider a stochastic process X t satisfying dx t = bt, X t,w t dt + σt, X t,w t dw t. 1.1 Question. 1 Can we obtain the existence and uniqueness theorem for

More information

Lecture 4: Ito s Stochastic Calculus and SDE. Seung Yeal Ha Dept of Mathematical Sciences Seoul National University

Lecture 4: Ito s Stochastic Calculus and SDE. Seung Yeal Ha Dept of Mathematical Sciences Seoul National University Lecture 4: Ito s Stochastic Calculus and SDE Seung Yeal Ha Dept of Mathematical Sciences Seoul National University 1 Preliminaries What is Calculus? Integral, Differentiation. Differentiation 2 Integral

More information

A probabilistic approach to second order variational inequalities with bilateral constraints

A probabilistic approach to second order variational inequalities with bilateral constraints Proc. Indian Acad. Sci. (Math. Sci.) Vol. 113, No. 4, November 23, pp. 431 442. Printed in India A probabilistic approach to second order variational inequalities with bilateral constraints MRINAL K GHOSH,

More information

BV functions in a Gelfand triple and the stochastic reflection problem on a convex set

BV functions in a Gelfand triple and the stochastic reflection problem on a convex set BV functions in a Gelfand triple and the stochastic reflection problem on a convex set Xiangchan Zhu Joint work with Prof. Michael Röckner and Rongchan Zhu Xiangchan Zhu ( Joint work with Prof. Michael

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS PROBABILITY: LIMIT THEOREMS II, SPRING 15. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please

More information

Bridging the Gap between Center and Tail for Multiscale Processes

Bridging the Gap between Center and Tail for Multiscale Processes Bridging the Gap between Center and Tail for Multiscale Processes Matthew R. Morse Department of Mathematics and Statistics Boston University BU-Keio 2016, August 16 Matthew R. Morse (BU) Moderate Deviations

More information

Existence and uniqueness of solutions for nonlinear ODEs

Existence and uniqueness of solutions for nonlinear ODEs Chapter 4 Existence and uniqueness of solutions for nonlinear ODEs In this chapter we consider the existence and uniqueness of solutions for the initial value problem for general nonlinear ODEs. Recall

More information

Math 209B Homework 2

Math 209B Homework 2 Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact

More information

Invariance Principle for Variable Speed Random Walks on Trees

Invariance Principle for Variable Speed Random Walks on Trees Invariance Principle for Variable Speed Random Walks on Trees Wolfgang Löhr, University of Duisburg-Essen joint work with Siva Athreya and Anita Winter Stochastic Analysis and Applications Thoku University,

More information

Chapter 1. Optimality Conditions: Unconstrained Optimization. 1.1 Differentiable Problems

Chapter 1. Optimality Conditions: Unconstrained Optimization. 1.1 Differentiable Problems Chapter 1 Optimality Conditions: Unconstrained Optimization 1.1 Differentiable Problems Consider the problem of minimizing the function f : R n R where f is twice continuously differentiable on R n : P

More information

Cores for generators of some Markov semigroups

Cores for generators of some Markov semigroups Cores for generators of some Markov semigroups Giuseppe Da Prato, Scuola Normale Superiore di Pisa, Italy and Michael Röckner Faculty of Mathematics, University of Bielefeld, Germany and Department of

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

Spatial Ergodicity of the Harris Flows

Spatial Ergodicity of the Harris Flows Communications on Stochastic Analysis Volume 11 Number 2 Article 6 6-217 Spatial Ergodicity of the Harris Flows E.V. Glinyanaya Institute of Mathematics NAS of Ukraine, glinkate@gmail.com Follow this and

More information

Solutions to the Exercises in Stochastic Analysis

Solutions to the Exercises in Stochastic Analysis Solutions to the Exercises in Stochastic Analysis Lecturer: Xue-Mei Li 1 Problem Sheet 1 In these solution I avoid using conditional expectations. But do try to give alternative proofs once we learnt conditional

More information

Convergence of Feller Processes

Convergence of Feller Processes Chapter 15 Convergence of Feller Processes This chapter looks at the convergence of sequences of Feller processes to a iting process. Section 15.1 lays some ground work concerning weak convergence of processes

More information

Viscosity Solutions of Path-dependent Integro-Differential Equations

Viscosity Solutions of Path-dependent Integro-Differential Equations Viscosity Solutions of Path-dependent Integro-Differential Equations Christian Keller University of Southern California Conference on Stochastic Asymptotics & Applications Joint with 6th Western Conference

More information

Stochastic Process (ENPC) Monday, 22nd of January 2018 (2h30)

Stochastic Process (ENPC) Monday, 22nd of January 2018 (2h30) Stochastic Process (NPC) Monday, 22nd of January 208 (2h30) Vocabulary (english/français) : distribution distribution, loi ; positive strictement positif ; 0,) 0,. We write N Z,+ and N N {0}. We use the

More information