Quenched Limit Laws for Transient, One-Dimensional Random Walk in Random Environment
|
|
- Irene Watson
- 5 years ago
- Views:
Transcription
1 Quenched Limit Laws for Transient, One-Dimensional Random Walk in Random Environment Jonathon Peterson School of Mathematics University of Minnesota April 8, 2008 Jonathon Peterson 4/8/ / 19
2 Background RWRE in Z with i.i.d. environment An environment ω = {ω x } x Z Ω = [0, 1] Z. P a product measure on Ω. Quenched law P ω : fix an environment. X n a random walk: X 0 = x, and P ω X n+1 = y + 1 X n = y := ω y Annealed law P: average over environments. PG := P ω GdPω Ω Jonathon Peterson 4/8/ / 19
3 Background RWRE in Z with i.i.d. environment An environment ω = {ω x } x Z Ω = [0, 1] Z. P a product measure on Ω. Quenched law P ω : fix an environment. X n a random walk: X 0 = x, and P ω X n+1 = y + 1 X n = y := ω y Annealed law P: average over environments. PG := P ω GdPω Ω Jonathon Peterson 4/8/ / 19
4 Background RWRE in Z with i.i.d. environment An environment ω = {ω x } x Z Ω = [0, 1] Z. P a product measure on Ω. Quenched law P ω : fix an environment. X n a random walk: X 0 = x, and P ω X n+1 = y + 1 X n = y := ω y Annealed law P: average over environments. PG := P ω GdPω Ω Jonathon Peterson 4/8/ / 19
5 Recurrence / Transience Background A crucial statistic is: ρ x := 1 ω x ω x Theorem Solomon 75 Transience or recurrence is determined by E P log ρ 0 : a E P log ρ 0 < 0 lim X n = +, n P a.s. b E P log ρ 0 > 0 lim X n =, n P a.s. c E P log ρ 0 = 0 X n is recurrent, P a.s. Jonathon Peterson 4/8/ / 19
6 Law of Large Numbers Background Assume E P log ρ < 0 transience to the right. Assume E P ρ s = 1 for some s > 0. Theorem LLN, Solomon 75 P a.s.: X n a s > 1 E P ρ < 1 lim n n = 1 E Pρ 1 + E P ρ > 0 X n b s 1 E P ρ 1 lim n n = 0 Denote lim n X n n =: v P. Jonathon Peterson 4/8/ / 19
7 Annealed Limit Laws Annealed Limit Laws Theorem Kesten, Kozlov, Spitzer 75 There exists a constant b such that Xn a s 0, 1 lim P n n s x = 1 L s,b x 1/s Xn nv b s 1, 2 lim P P n n 1/s x = 1 L s,b x Xn nv c s > 2 lim P P n b x = Φx n where L s,b is an s-stable distribution function. Proof: First prove stable limit laws for hitting times T n := inf{k 0 : X k = n} Jonathon Peterson 4/8/ / 19
8 Annealed Limit Laws Annealed Limit Laws Theorem Kesten, Kozlov, Spitzer 75 There exists a constant b such that Xn a s 0, 1 lim P n n s x = 1 L s,b x 1/s Xn nv b s 1, 2 lim P P n n 1/s x = 1 L s,b x Xn nv c s > 2 lim P P n b x = Φx n where L s,b is an s-stable distribution function. Proof: First prove stable limit laws for hitting times T n := inf{k 0 : X k = n} Jonathon Peterson 4/8/ / 19
9 Annealed Limit Laws Annealed Limit Laws Theorem Kesten, Kozlov, Spitzer 75 There exists a constant b such that a s 0, 1 lim b s 1, 2 lim n P c s > 2 lim n P Tn P n Tn nv 1 P n 1/s Tn nv 1 P b n where L s,b is an s-stable distribution function. n 1/s x = L s,b x x x = L s,b x = Φx Jonathon Peterson 4/8/ / 19
10 Annealed Limit Laws Characteristic Function of L s,b : exp { b t s 1 i } t t tanπs/2 Jonathon Peterson 4/8/ / 19
11 Quenched Limit Laws Quenched Limit Laws Gaussian Regime Theorem Goldsheid 06, P. 06 If s > 2 then lim n P ω Tn E ω T n σ n x = Φx, P a.s. where σ 2 = E P Var ω T 1, and lim n P ω X n nv P + Z n ω v 3/2 P σ n x where Z n ω depends only on the environment. Question: What happens when s < 2? Do we get quenched stable laws? = Φx, P a.s. Jonathon Peterson 4/8/ / 19
12 Quenched Limit Laws Quenched Limit Laws Gaussian Regime Theorem Goldsheid 06, P. 06 If s > 2 then lim n P ω Tn E ω T n σ n x = Φx, P a.s. where σ 2 = E P Var ω T 1, and lim n P ω X n nv P + Z n ω v 3/2 P σ n x where Z n ω depends only on the environment. Question: What happens when s < 2? Do we get quenched stable laws? = Φx, P a.s. Jonathon Peterson 4/8/ / 19
13 Traps Traps Define the potential of the environmnet i 1 k=0 log ρ k, i > 0 V i := 0, i = 0 1 k=i log ρ k, i < 0 Trap: An atypical section of environment where the potential is increasing. Time to cross a trap is exponential in the height of the uphill. Largest uphill of V in [0, n] is 1 s log n Erdös & Renyi 70. scaling of n 1/s in annealed limit laws of T n. Jonathon Peterson 4/8/ / 19
14 Traps Traps Define the potential of the environmnet i 1 k=0 log ρ k, i > 0 V i := 0, i = 0 1 k=i log ρ k, i < 0 Trap: An atypical section of environment where the potential is increasing. Time to cross a trap is exponential in the height of the uphill. Largest uphill of V in [0, n] is 1 s log n Erdös & Renyi 70. scaling of n 1/s in annealed limit laws of T n. Jonathon Peterson 4/8/ / 19
15 Blocks of the environment Traps Ladder locations {ν n } defined by ν 0 = 0, ν n := inf{i > ν n 1 : V i < V ν n 1 } ν n := sup{j < ν n+1 : V k > V j k < j} ν 3 ν 2 ν 1 ν 1 ν 2 ν 3 ν 4 ν 5 ν 6 ν 5 ν ν 0 4 Define a new measure on environments Q = P {V i > 0, i < 0} Under Q, the environment is stationary under shifts of the ν i. Jonathon Peterson 4/8/ / 19
16 Blocks of the environment Traps Ladder locations {ν n } defined by ν 0 = 0, ν n := inf{i > ν n 1 : V i < V ν n 1 } ν n := sup{j < ν n+1 : V k > V j k < j} ν 3 ν 2 ν 1 ν 1 ν 2 ν 3 ν 4 ν 5 ν 6 ν 5 ν ν 0 4 Define a new measure on environments Q = P {V i > 0, i < 0} Under Q, the environment is stationary under shifts of the ν i. Jonathon Peterson 4/8/ / 19
17 Quenched Analysis of T νn Heuristics of Quenched Limit Laws T νn = n T νi T νi 1 Law i=1 where µ i,ω = E ω T νi T νi 1 Quenched CLT? Only if n expµ i,ω i=1 Var ω T νi T νi 1. lim max µ 2 i,ω = 0, P a.s. n i n Var ω T νn Exponential limit if lim max µ 2 i,ω = 1, P a.s. n i n Var ω T νn Jonathon Peterson 4/8/ / 19
18 Quenched Analysis of T νn Heuristics of Quenched Limit Laws T νn = n T νi T νi 1 Law i=1 where µ i,ω = E ω T νi T νi 1 Quenched CLT? Only if n expµ i,ω i=1 Var ω T νi T νi 1. lim max µ 2 i,ω = 0, P a.s. n i n Var ω T νn Exponential limit if lim max µ 2 i,ω = 1, P a.s. n i n Var ω T νn Jonathon Peterson 4/8/ / 19
19 Quenched Analysis of T νn Heuristics of Quenched Limit Laws T νn = n T νi T νi 1 Law i=1 where µ i,ω = E ω T νi T νi 1 Quenched CLT? Only if n expµ i,ω i=1 Var ω T νi T νi 1. lim max µ 2 i,ω = 0, P a.s. n i n Var ω T νn Exponential limit if lim max µ 2 i,ω = 1, P a.s. n i n Var ω T νn Jonathon Peterson 4/8/ / 19
20 Quenched Analysis of T νn Heuristics of Quenched Limit Laws T νn = n T νi T νi 1 Law i=1 where µ i,ω = E ω T νi T νi 1 Quenched CLT? Only if n expµ i,ω i=1 Var ω T νi T νi 1. lim max µ 2 i,ω = 0, P a.s. n i n Var ω T νn Exponential limit if lim max µ 2 i,ω = 1, P a.s. n i n Var ω T νn Jonathon Peterson 4/8/ / 19
21 Quenched Analysis of T νn Theorem P. 07 Assume s < 2. Then b > 0 s.t. lim Q Varω T νn n n 2/s x = L s,bx. 2 α-stable process with α < 1 has jumps. This hints that when s < 2 lim inf n Q max i n µ 2 i,ω Var ω T νn < δ > 0 and lim inf n Q max i n µ 2 i,ω Var ω T νn > 1 δ > 0 Jonathon Peterson 4/8/ / 19
22 Quenched Analysis of T νn Theorem P. 07 Assume s < 2. Then b > 0 s.t. lim Q Varω T νn n n 2/s x = L s,bx. 2 α-stable process with α < 1 has jumps. This hints that when s < 2 lim inf n Q max i n µ 2 i,ω Var ω T νn < δ > 0 and lim inf n Q max i n µ 2 i,ω Var ω T νn > 1 δ > 0 Jonathon Peterson 4/8/ / 19
23 Quenched Limit Laws Quenched Limit Laws sub-gaussian regime Theorem P. 07 If s < 2 then P a.s. there exist random subsequences n k = n k ω, and m k = m k ω such that T nk E ω T nk a lim P ω x = Φx k Varω T nk b lim k P ω T mk E ω T mk Varω T mk Contrast with the annealed results: s 0, 1 lim n P s 1, 2 lim n P x Tn = { 0 if x < 1 1 e x 1 if x 1 n 1/s x = L s,b x Tn nv 1 P n 1/s x = L s,b x Jonathon Peterson 4/8/ / 19
24 Quenched Limit Laws Quenched Limit Laws sub-gaussian regime Theorem P. 07 If s < 2 then P a.s. there exist random subsequences n k = n k ω, and m k = m k ω such that T nk E ω T nk a lim P ω x = Φx k Varω T nk b lim k P ω T mk E ω T mk Varω T mk Contrast with the annealed results: s 0, 1 lim n P s 1, 2 lim n P x Tn = { 0 if x < 1 1 e x 1 if x 1 n 1/s x = L s,b x Tn nv 1 P n 1/s x = L s,b x Jonathon Peterson 4/8/ / 19
25 Quenched Limit Laws Quenched Limit Laws ballistic, sub-gaussian regime Theorem P. 07 If s 1, 2 then P a.s. there exist random subsequences n k = n k ω and m k = m k ω such that X tk n k a lim P ω x = Φx k v P Varω T nk Xt b lim P m { k e x 1 if x < 1 k ω < x = k v P Varω T mk 1 if x 1, where t k = E ω T nk and t k = E ωt mk. Contrast with lim P Xn nv P n n 1/s x = 1 L s,b x Jonathon Peterson 4/8/ / 19
26 Quenched Limit Laws Quenched Limit Laws ballistic, sub-gaussian regime Theorem P. 07 If s 1, 2 then P a.s. there exist random subsequences n k = n k ω and m k = m k ω such that X tk n k a lim P ω x = Φx k v P Varω T nk Xt b lim P m { k e x 1 if x < 1 k ω < x = k v P Varω T mk 1 if x 1, where t k = E ω T nk and t k = E ωt mk. Contrast with lim P Xn nv P n n 1/s x = 1 L s,b x Jonathon Peterson 4/8/ / 19
27 Quenched Limit Laws Quenched Limit Laws Zero-Speed Regime Theorem P., Zeitouni 07 If s 0, 1, then P a.s. there exist random subsequences n k = n k ω, m k = m k ω, t k = t k ω, and u k = u k ω s.t. { Xnk 0 x 0 a lim P ω x = k m 1 k 2 0 < x < and b lim k P ω log m lim k = s k log n k Xtk u k log 2 t k [ δ, δ] = 1, δ > 0. Contrast with lim P Xn n n s x = 1 L s,b x 1/s Jonathon Peterson 4/8/ / 19
28 Quenched Limit Laws Quenched Limit Laws Zero-Speed Regime Theorem P., Zeitouni 07 If s 0, 1, then P a.s. there exist random subsequences n k = n k ω, m k = m k ω, t k = t k ω, and u k = u k ω s.t. { Xnk 0 x 0 a lim P ω x = k m 1 k 2 0 < x < and b lim k P ω log m lim k = s k log n k Xtk u k log 2 t k [ δ, δ] = 1, δ > 0. Contrast with lim P Xn n n s x = 1 L s,b x 1/s Jonathon Peterson 4/8/ / 19
29 Proofs Proof of Stable Limits for the Quenched Variance Theorem P., Zeitouni 07 lim Q Varω T νn n n 2/s x = L s,bx. 2 Assume that E P log ρ < 0. For any s > 0, there exists a constant K > 0 s.t. QVar ω T ν > x QE ω T ν 2 > x Kx s/2. That PE ω T 1 > x K x s follows from a result of Kesten 73. The proof of the above mimics the proof of Kesten, Kozlov, and Spitzer 75. Jonathon Peterson 4/8/ / 19
30 Proofs Proof of Stable Limits for the Quenched Variance Theorem P., Zeitouni 07 lim Q Varω T νn n n 2/s x = L s,bx. 2 Assume that E P log ρ < 0. For any s > 0, there exists a constant K > 0 s.t. QVar ω T ν > x QE ω T ν 2 > x Kx s/2. That PE ω T 1 > x K x s follows from a result of Kesten 73. The proof of the above mimics the proof of Kesten, Kozlov, and Spitzer 75. Jonathon Peterson 4/8/ / 19
31 Proofs Var ω T νi T νi 1 in domain of attraction of s 2-stable distribution. But... not independent. H i the height of the block [ν i 1, ν i. Var ω T ν E ω T ν 2 e 2H 1. Iglehart 72: Pe H i > x Cx s. Binomial counting argument: Analyzing T νn, only crossing times of blocks with e H i > n 1 ε/s matter. Blocks with e H i > n 1 ε/s are well seperated Var ω T νi T νi 1 that are large are approximately independent. Jonathon Peterson 4/8/ / 19
32 Proofs Var ω T νi T νi 1 in domain of attraction of s 2-stable distribution. But... not independent. H i the height of the block [ν i 1, ν i. Var ω T ν E ω T ν 2 e 2H 1. Iglehart 72: Pe H i > x Cx s. Binomial counting argument: Analyzing T νn, only crossing times of blocks with e H i > n 1 ε/s matter. Blocks with e H i > n 1 ε/s are well seperated Var ω T νi T νi 1 that are large are approximately independent. Jonathon Peterson 4/8/ / 19
33 Proofs Var ω T νi T νi 1 in domain of attraction of s 2-stable distribution. But... not independent. H i the height of the block [ν i 1, ν i. Var ω T ν E ω T ν 2 e 2H 1. Iglehart 72: Pe H i > x Cx s. Binomial counting argument: Analyzing T νn, only crossing times of blocks with e H i > n 1 ε/s matter. Blocks with e H i > n 1 ε/s are well seperated Var ω T νi T νi 1 that are large are approximately independent. Jonathon Peterson 4/8/ / 19
34 Proofs Var ω T νi T νi 1 in domain of attraction of s 2-stable distribution. But... not independent. H i the height of the block [ν i 1, ν i. Var ω T ν E ω T ν 2 e 2H 1. Iglehart 72: Pe H i > x Cx s. Binomial counting argument: Analyzing T νn, only crossing times of blocks with e H i > n 1 ε/s matter. Blocks with e H i > n 1 ε/s are well seperated Var ω T νi T νi 1 that are large are approximately independent. Jonathon Peterson 4/8/ / 19
35 Finding the subsequences: Proofs With strictly positive probability uniformly in n find... One Large Block: One block i n with Then Var ω Tνi T νi 1 µi,ω > Mn 2/s j i Var ω Tνj Var ω T νj 1 n 2/s. µ2 i,ω Var ωt ν n > M2 M 2 +1 = 1 1 M No Dominating Blocks: Subset J {1, 2,..., n} of size 2k with i J Var ω Tνi T νi 1 µ 2 i,ω [n 2/s, 2n 2/s ] j / J Var ω Tνj T νj 1 < n 2/s Then µ2 i,ω Var ωt ν n < 2n2/s 2kn 2/s = 1 k. Jonathon Peterson 4/8/ / 19
36 Finding the subsequences: Proofs With strictly positive probability uniformly in n find... One Large Block: One block i n with Then Var ω Tνi T νi 1 µi,ω > Mn 2/s j i Var ω Tνj Var ω T νj 1 n 2/s. µ2 i,ω Var ωt ν n > M2 M 2 +1 = 1 1 M No Dominating Blocks: Subset J {1, 2,..., n} of size 2k with i J Var ω Tνi T νi 1 µ 2 i,ω [n 2/s, 2n 2/s ] j / J Var ω Tνj T νj 1 < n 2/s Then µ2 i,ω Var ωt ν n < 2n2/s 2kn 2/s = 1 k. Jonathon Peterson 4/8/ / 19
37 References References 1. H. Kesten, M. V. Kozlov, and F. Spitzer, A limit law for random walk in a random environment, Comp. Math , pp J. Peterson and O. Zeitouni, Quenched Limits for Transient, Zero-Speed One-Dimensional Random Walk in Random Environment, preprint 2007, arxiv:math/ v1 [math.pr] 3. J. Peterson, Quenched Limits for Transient, Ballistic, Sub-Gaussian One-Dimensional Random Walk in Random Environment, preprint 2007, arxiv: [mathpr] Jonathon Peterson 4/8/ / 19
Weak quenched limiting distributions of a one-dimensional random walk in a random environment
Weak quenched limiting distributions of a one-dimensional random walk in a random environment Jonathon Peterson Cornell University Department of Mathematics Joint work with Gennady Samorodnitsky September
More informationarxiv:math/ v1 [math.pr] 24 Apr 2003
ICM 2002 Vol. III 1 3 arxiv:math/0304374v1 [math.pr] 24 Apr 2003 Random Walks in Random Environments Ofer Zeitouni Abstract Random walks in random environments (RWRE s) have been a source of surprising
More informationExcited random walks in cookie environments with Markovian cookie stacks
Excited random walks in cookie environments with Markovian cookie stacks Jonathon Peterson Department of Mathematics Purdue University Joint work with Elena Kosygina December 5, 2015 Jonathon Peterson
More informationLecture Notes on Random Walks in Random Environments
Lecture Notes on Random Walks in Random Environments Jonathon Peterson Purdue University February 2, 203 This lecture notes arose out of a mini-course I taught in January 203 at Instituto Nacional de Matemática
More informationAsymptotic properties of the maximum likelihood estimator for a ballistic random walk in a random environment
Asymptotic properties of the maximum likelihood estimator for a ballistic random walk in a random environment Catherine Matias Joint works with F. Comets, M. Falconnet, D.& O. Loukianov Currently: Laboratoire
More informationQuenched Limits for Transient, Zero Speed One-Dimensional Random Walk in Random Environment
Quenched Limits for Transient, Zero Speed One-Dimensional Random Wal in Random Environment Jonathon Peterson Ofer Zeitouni April 13, 007 Abstract We consider a nearest-neighbor, one dimensional random
More informationJONATHON PETERSON AND GENNADY SAMORODNITSKY
WEAK WEAK QUENCHED LIMITS FOR THE PATH-VALUED PROCESSES OF HITTING TIMES AND POSITIONS OF A TRANSIENT, ONE-DIMENSIONAL RANDOM WALK IN A RANDOM ENVIRONMENT JONATHON PETERSON AND GENNADY SAMORODNITSKY Abstract.
More informationarxiv: v1 [math.pr] 20 Jul 2007
Encyclopedia of Mathematical Physics (J.-P. Françoise, G. Naber, and S. T. Tsou, eds.) Vol. 4, pp. 353 371. Elsevier, Oxford, 2006. Random Walks in Random Environments arxiv:0707.3160v1 [math.pr] 20 Jul
More informationarxiv: v2 [math.pr] 23 Feb 2011
The Annals of Probability 2009, Vol. 37, No. 1, 143 188 DOI: 10.1214/08-AOP399 c Institute of Mathematical Statistics, 2009 arxiv:0704.1778v2 [math.pr] 23 Feb 2011 QUENCHED LIMITS FOR TRANSIENT, ZERO SPEED
More informationSpider walk in a random environment
Graduate Theses and Dissertations Iowa State University Capstones, Theses and Dissertations 2017 Spider walk in a random environment Tetiana Takhistova Iowa State University Follow this and additional
More informationPreliminary 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 informationErgodic 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 informationFUNCTIONAL CENTRAL LIMIT (RWRE)
FUNCTIONAL CENTRAL LIMIT THEOREM FOR BALLISTIC RANDOM WALK IN RANDOM ENVIRONMENT (RWRE) Timo Seppäläinen University of Wisconsin-Madison (Joint work with Firas Rassoul-Agha, Univ of Utah) RWRE on Z d RWRE
More informationA log-scale limit theorem for one-dimensional random walks in random environments
A log-scale limit theorem for one-dimensional random walks in random environments Alexander Roitershtein August 3, 2004; Revised April 1, 2005 Abstract We consider a transient one-dimensional random walk
More informationLecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.
1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if
More informationPrime numbers and Gaussian random walks
Prime numbers and Gaussian random walks K. Bruce Erickson Department of Mathematics University of Washington Seattle, WA 9895-4350 March 24, 205 Introduction Consider a symmetric aperiodic random walk
More informationChapter 6: Random Processes 1
Chapter 6: Random Processes 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.
More informationRandom Walk in Periodic Environment
Tdk paper Random Walk in Periodic Environment István Rédl third year BSc student Supervisor: Bálint Vető Department of Stochastics Institute of Mathematics Budapest University of Technology and Economics
More informationOn the recurrence of some random walks in random environment
ALEA, Lat. Am. J. Probab. Math. Stat. 11 2, 483 502 2014 On the recurrence of some random walks in random environment Nina Gantert, Michael Kochler and Françoise Pène Nina Gantert, Technische Universität
More informationInvariant measure for random walks on ergodic environments on a strip
Invariant measure for random walks on ergodic environments on a strip Dmitry Dolgopyat and Ilya Goldsheid Department of Mathematics and Institute of Physical Science & Technology University of Maryland
More informationBiased random walk on percolation clusters. Noam Berger, Nina Gantert and Yuval Peres
Biased random walk on percolation clusters Noam Berger, Nina Gantert and Yuval Peres Related paper: [Berger, Gantert & Peres] (Prob. Theory related fields, Vol 126,2, 221 242) 1 The Model Percolation on
More informationRandom Walks in Random Environments
Random Walks in Random Environments Erwin Bolthausen IHP, Paris, 2008 Contents 1 Introduction 1 2 The quasi one-dimensional case 3 2.1 Transience and recurrence........................... 3 2.2 The Sinai-behavior:
More informationON 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 informationErnesto Mordecki. Talk presented at the. Finnish Mathematical Society
EXACT RUIN PROBABILITIES FOR A CLASS Of LÉVY PROCESSES Ernesto Mordecki http://www.cmat.edu.uy/ mordecki Montevideo, Uruguay visiting Åbo Akademi, Turku Talk presented at the Finnish Mathematical Society
More informationCENTRAL LIMIT THEOREM FOR RECURRENT RANDOM WALKS ON A STRIP WITH BOUNDED POTENTIAL
CENTRAL LIMIT THEOREM FOR RECURRENT RANDOM WALKS ON A STRIP WITH BOUNDED POTENTIAL D. DOLGOPYAT AND I. GOLDSHEID Abstract. We prove that a recurrent random walk (RW) in i.i.d. random environment (RE) on
More informationA 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 informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationProbability and Statistics
Probability and Statistics 1 Contents some stochastic processes Stationary Stochastic Processes 2 4. Some Stochastic Processes 4.1 Bernoulli process 4.2 Binomial process 4.3 Sine wave process 4.4 Random-telegraph
More informationAsymptotic Normality and Efficiency of the Maximum Likelihood Estimator for the Parameter of a Ballistic Random Walk in a Random Environment
ISSN 066-5307, Mathematical Methods of Statistics, 204, Vol. 23, No., pp. 9. c Allerton Press, Inc., 204. Asymptotic Normality and Efficiency of the Maximum Likelihood Estimator for the Parameter of a
More informationOscillations of quenched slowdown asymptotics for ballistic, one-dimensional RWRE
Oscillatios of queched slowdow asymptotics for ballistic, oe-dimesioal RWRE Joatho Peterso Purdue Uiversity Departmet of Mathematics Joit work with Sug Wo Ah May 28, 2016 Joatho Peterso 5/28/2016 1 / 25
More informationThe parabolic Anderson model on Z d with time-dependent potential: Frank s works
Weierstrass Institute for Applied Analysis and Stochastics The parabolic Anderson model on Z d with time-dependent potential: Frank s works Based on Frank s works 2006 2016 jointly with Dirk Erhard (Warwick),
More informationSTA205 Probability: Week 8 R. Wolpert
INFINITE COIN-TOSS AND THE LAWS OF LARGE NUMBERS The traditional interpretation of the probability of an event E is its asymptotic frequency: the limit as n of the fraction of n repeated, similar, and
More informationDirectionally Reinforced Random Walks
advances in mathematics 117, 239252 (1996) article no. 0011 Directionally Reinforced Random Walks R. Daniel Mauldin*, - and Michael Monticino - Department of Mathematics, University of North Texas, P.O.
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
More informationSection 27. The Central Limit Theorem. Po-Ning Chen, Professor. Institute of Communications Engineering. National Chiao Tung University
Section 27 The Central Limit Theorem Po-Ning Chen, Professor Institute of Communications Engineering National Chiao Tung University Hsin Chu, Taiwan 3000, R.O.C. Identically distributed summands 27- Central
More informationUniversal examples. Chapter The Bernoulli process
Chapter 1 Universal examples 1.1 The Bernoulli process First description: Bernoulli random variables Y i for i = 1, 2, 3,... independent with P [Y i = 1] = p and P [Y i = ] = 1 p. Second description: Binomial
More information1 Continuous-time chains, finite state space
Université Paris Diderot 208 Markov chains Exercises 3 Continuous-time chains, finite state space Exercise Consider a continuous-time taking values in {, 2, 3}, with generator 2 2. 2 2 0. Draw the diagramm
More informationStationary independent increments. 1. Random changes of the form X t+h X t fixed h > 0 are called increments of the process.
Stationary independent increments 1. Random changes of the form X t+h X t fixed h > 0 are called increments of the process. 2. If each set of increments, corresponding to non-overlapping collection of
More informationUniqueness of random gradient states
p. 1 Uniqueness of random gradient states Codina Cotar (Based on joint work with Christof Külske) p. 2 Model Interface transition region that separates different phases p. 2 Model Interface transition
More informationLet (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t
2.2 Filtrations Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of σ algebras {F t } such that F t F and F t F t+1 for all t = 0, 1,.... In continuous time, the second condition
More informationX 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 informationRANDOM WALKS AND PERCOLATION IN A HIERARCHICAL LATTICE
RANDOM WALKS AND PERCOLATION IN A HIERARCHICAL LATTICE Luis Gorostiza Departamento de Matemáticas, CINVESTAV October 2017 Luis GorostizaDepartamento de Matemáticas, RANDOM CINVESTAV WALKS Febrero AND 2017
More informationMATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015
ID NAME SCORE MATH 56/STAT 555 Applied Stochastic Processes Homework 2, September 8, 205 Due September 30, 205 The generating function of a sequence a n n 0 is defined as As : a ns n for all s 0 for which
More informationRW in dynamic random environment generated by the reversal of discrete time contact process
RW in dynamic random environment generated by the reversal of discrete time contact process Andrej Depperschmidt joint with Matthias Birkner, Jiří Černý and Nina Gantert Ulaanbaatar, 07/08/2015 Motivation
More informationA D VA N C E D P R O B A B I L - I T Y
A N D R E W T U L L O C H A D VA N C E D P R O B A B I L - I T Y T R I N I T Y C O L L E G E T H E U N I V E R S I T Y O F C A M B R I D G E Contents 1 Conditional Expectation 5 1.1 Discrete Case 6 1.2
More informationSTAT 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 informationRandom Processes. DS GA 1002 Probability and Statistics for Data Science.
Random Processes DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Aim Modeling quantities that evolve in time (or space)
More informationECE534, Spring 2018: Solutions for Problem Set #4 Due Friday April 6, 2018
ECE534, Spring 2018: s for Problem Set #4 Due Friday April 6, 2018 1. MMSE Estimation, Data Processing and Innovations The random variables X, Y, Z on a common probability space (Ω, F, P ) are said to
More informationIn terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3.
1. GAUSSIAN PROCESSES A Gaussian process on a set T is a collection of random variables X =(X t ) t T on a common probability space such that for any n 1 and any t 1,...,t n T, the vector (X(t 1 ),...,X(t
More informationConvergence Rates for Renewal Sequences
Convergence Rates for Renewal Sequences M. C. Spruill School of Mathematics Georgia Institute of Technology Atlanta, Ga. USA January 2002 ABSTRACT The precise rate of geometric convergence of nonhomogeneous
More informationarxiv: v2 [math.pr] 4 Sep 2017
arxiv:1708.08576v2 [math.pr] 4 Sep 2017 On the Speed of an Excited Asymmetric Random Walk Mike Cinkoske, Joe Jackson, Claire Plunkett September 5, 2017 Abstract An excited random walk is a non-markovian
More informationarxiv: 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 informationBranching processes. Chapter Background Basic definitions
Chapter 5 Branching processes Branching processes arise naturally in the study of stochastic processes on trees and locally tree-like graphs. After a review of the basic extinction theory of branching
More informationRandom walk delayed on percolation clusters
Random walk delayed on percolation clusters arxiv:0710.2320v1 [math.pr] 11 Oct 2007 Francis Comets 1 February 2, 2008 François Simenhaus 2 1 Université Paris Diderot Paris 7, UFR de Mathématiques, Case
More informationLectures 16-17: Poisson Approximation. Using Lemma (2.4.3) with θ = 1 and then Lemma (2.4.4), which is valid when max m p n,m 1/2, we have
Lectures 16-17: Poisson Approximation 1. The Law of Rare Events Theorem 2.6.1: For each n 1, let X n,m, 1 m n be a collection of independent random variables with PX n,m = 1 = p n,m and PX n,m = = 1 p
More informationSharpness of second moment criteria for branching and tree-indexed processes
Sharpness of second moment criteria for branching and tree-indexed processes Robin Pemantle 1, 2 ABSTRACT: A class of branching processes in varying environments is exhibited which become extinct almost
More informationarxiv: v2 [math.pr] 22 Aug 2017
Submitted to the Annals of Probability PHASE TRANSITION FOR THE ONCE-REINFORCED RANDOM WALK ON Z D -LIKE TREES arxiv:1604.07631v2 math.pr] 22 Aug 2017 By Daniel Kious and Vladas Sidoravicius, Courant Institute
More informationA LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH
A LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH AMIR DEMBO AND EYAL LUBETZKY Abstract. Starting with the large deviation principle (ldp) for the Erdős Rényi binomial random graph G(n,
More informationBootstrap random walks
Bootstrap random walks Kais Hamza Monash University Joint work with Andrea Collevecchio & Meng Shi Introduction The two and three dimensional processes Higher Iterations An extension any (prime) number
More informationGradient Gibbs measures with disorder
Gradient Gibbs measures with disorder Codina Cotar University College London April 16, 2015, Providence Partly based on joint works with Christof Külske Outline 1 The model 2 Questions 3 Known results
More informationRandom trees and branching processes
Random trees and branching processes Svante Janson IMS Medallion Lecture 12 th Vilnius Conference and 2018 IMS Annual Meeting Vilnius, 5 July, 2018 Part I. Galton Watson trees Let ξ be a random variable
More informationCover times of random searches
Cover times of random searches by Chupeau et al. NATURE PHYSICS www.nature.com/naturephysics 1 I. DEFINITIONS AND DERIVATION OF THE COVER TIME DISTRIBUTION We consider a random walker moving on a network
More information12 Markov chains The Markov property
12 Markov chains Summary. The chapter begins with an introduction to discrete-time Markov chains, and to the use of matrix products and linear algebra in their study. The concepts of recurrence and transience
More informationDiffusivity and Ballistic Behavior of Random Walk in Random Environment
Diffusivity and Ballistic Behavior of Random Walk in Random Environment A DISSERTATION SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Xiaoqin Guo IN PARTIAL FULFILLMENT
More informationGlauber Dynamics for Ising Model I AMS Short Course
Glauber Dynamics for Ising Model I AMS Short Course January 2010 Ising model Let G n = (V n, E n ) be a graph with N = V n < vertices. The nearest-neighbor Ising model on G n is the probability distribution
More informationGradient interfaces with and without disorder
Gradient interfaces with and without disorder Codina Cotar University College London September 09, 2014, Toronto Outline 1 Physics motivation Example 1: Elasticity Recap-Gaussian Measure Example 2: Effective
More informationRecurrence of Simple Random Walk on Z 2 is Dynamically Sensitive
arxiv:math/5365v [math.pr] 3 Mar 25 Recurrence of Simple Random Walk on Z 2 is Dynamically Sensitive Christopher Hoffman August 27, 28 Abstract Benjamini, Häggström, Peres and Steif [2] introduced the
More informationProbability 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 informationStochastic 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 informationBrownian Motion. Chapter Definition of Brownian motion
Chapter 5 Brownian Motion Brownian motion originated as a model proposed by Robert Brown in 1828 for the phenomenon of continual swarming motion of pollen grains suspended in water. In 1900, Bachelier
More informationBrownian Bridge and Self-Avoiding Random Walk.
Brownian Bridge and Self-Avoiding Random Walk. arxiv:math/02050v [math.pr] 9 May 2002 Yevgeniy Kovchegov Email: yevgeniy@math.stanford.edu Fax: -650-725-4066 November 2, 208 Abstract We derive the Brownian
More informationLecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321
Lecture 11: Introduction to Markov Chains Copyright G. Caire (Sample Lectures) 321 Discrete-time random processes A sequence of RVs indexed by a variable n 2 {0, 1, 2,...} forms a discretetime random process
More informationChapter 6. Convergence. Probability Theory. Four different convergence concepts. Four different convergence concepts. Convergence in probability
Probability Theory Chapter 6 Convergence Four different convergence concepts Let X 1, X 2, be a sequence of (usually dependent) random variables Definition 1.1. X n converges almost surely (a.s.), or with
More informationApproximate Counting and Markov Chain Monte Carlo
Approximate Counting and Markov Chain Monte Carlo A Randomized Approach Arindam Pal Department of Computer Science and Engineering Indian Institute of Technology Delhi March 18, 2011 April 8, 2011 Arindam
More informationASYMPTOTIC DIRECTIONS IN RANDOM WALKS IN RANDOM ENVIRONMENT REVISITED
ASYMPTOTIC DIRECTIONS IN RANDOM WALKS IN RANDOM ENVIRONMENT REVISITED A. Drewitz,2,, A.F. Ramírez,, February 6, 2009 Facultad de Matemáticas, Pontificia Universidad Católica de Chile, Vicuña Macenna 4860,
More informationSpectra of Large Random Stochastic Matrices & Relaxation in Complex Systems
Spectra of Large Random Stochastic Matrices & Relaxation in Complex Systems Reimer Kühn Disordered Systems Group Department of Mathematics, King s College London Random Graphs and Random Processes, KCL
More informationBrownian Motion and Stochastic Calculus
ETHZ, Spring 17 D-MATH Prof Dr Martin Larsson Coordinator A Sepúlveda Brownian Motion and Stochastic Calculus Exercise sheet 6 Please hand in your solutions during exercise class or in your assistant s
More informationLogarithmic scaling of planar random walk s local times
Logarithmic scaling of planar random walk s local times Péter Nándori * and Zeyu Shen ** * Department of Mathematics, University of Maryland ** Courant Institute, New York University October 9, 2015 Abstract
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Steven J. Miller (MC 96) http://www.williams.edu/mathematics/sjmiller/public_html Yale University, April 14, 2014 Introduction Goals of the
More informationHEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES
HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES by Peter W. Glynn Department of Operations Research Stanford University Stanford, CA 94305-4022 and Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636
More informationWiener 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 informationConvergence in Distribution
Convergence in Distribution Undergraduate version of central limit theorem: if X 1,..., X n are iid from a population with mean µ and standard deviation σ then n 1/2 ( X µ)/σ has approximately a normal
More information1 Presessional Probability
1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional
More informationIII. Quantum ergodicity on graphs, perspectives
III. Quantum ergodicity on graphs, perspectives Nalini Anantharaman Université de Strasbourg 24 août 2016 Yesterday we focussed on the case of large regular (discrete) graphs. Let G = (V, E) be a (q +
More informationCritical behavior of the massless free field at the depinning transition
Critical behavior of the massless free field at the depinning transition Erwin Bolthausen Yvan Velenik August 27, 200 Abstract We consider the d-dimensional massless free field localized by a δ-pinning
More informationMETEOR PROCESS. Krzysztof Burdzy University of Washington
University of Washington Collaborators and preprints Joint work with Sara Billey, Soumik Pal and Bruce E. Sagan. Math Arxiv: http://arxiv.org/abs/1308.2183 http://arxiv.org/abs/1312.6865 Mass redistribution
More informationCONDITIONAL LIMIT THEOREMS FOR PRODUCTS OF RANDOM MATRICES
CONDITIONAL LIMIT THEOREMS FOR PRODUCTS OF RANDOM MATRICES ION GRAMA, EMILE LE PAGE, AND MARC PEIGNÉ Abstract. Consider the product G n = g n...g 1 of the random matrices g 1,..., g n in GL d, R and the
More informationGaussian Random Field: simulation and quantification of the error
Gaussian Random Field: simulation and quantification of the error EMSE Workshop 6 November 2017 3 2 1 0-1 -2-3 80 60 40 1 Continuity Separability Proving continuity without separability 2 The stationary
More informationIEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory. Fall 2009, Professor Whitt. Class Lecture Notes: Wednesday, September 9.
IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory Fall 2009, Professor Whitt Class Lecture Notes: Wednesday, September 9. Heavy-Traffic Limits for the GI/G/1 Queue 1. The GI/G/1 Queue We will
More information6 Markov Chain Monte Carlo (MCMC)
6 Markov Chain Monte Carlo (MCMC) The underlying idea in MCMC is to replace the iid samples of basic MC methods, with dependent samples from an ergodic Markov chain, whose limiting (stationary) distribution
More informationBiased random walks on subcritical percolation clusters with an infinite open path
Biased random walks on subcritical percolation clusters with an infinite open path Application for Transfer to DPhil Student Status Dissertation Annika Heckel March 3, 202 Abstract We consider subcritical
More informationProbability Models. 4. What is the definition of the expectation of a discrete random variable?
1 Probability Models The list of questions below is provided in order to help you to prepare for the test and exam. It reflects only the theoretical part of the course. You should expect the questions
More informationStochastic Models (Lecture #4)
Stochastic Models (Lecture #4) Thomas Verdebout Université libre de Bruxelles (ULB) Today Today, our goal will be to discuss limits of sequences of rv, and to study famous limiting results. Convergence
More informationP(X 0 = j 0,... X nk = j k )
Introduction to Probability Example Sheet 3 - Michaelmas 2006 Michael Tehranchi Problem. Let (X n ) n 0 be a homogeneous Markov chain on S with transition matrix P. Given a k N, let Z n = X kn. Prove that
More informationWeak 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 informationSelected 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 informationLecture 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 informationGaussian Random Fields
Gaussian Random Fields Mini-Course by Prof. Voijkan Jaksic Vincent Larochelle, Alexandre Tomberg May 9, 009 Review Defnition.. Let, F, P ) be a probability space. Random variables {X,..., X n } are called
More informationMidterm 2 Review. CS70 Summer Lecture 6D. David Dinh 28 July UC Berkeley
Midterm 2 Review CS70 Summer 2016 - Lecture 6D David Dinh 28 July 2016 UC Berkeley Midterm 2: Format 8 questions, 190 points, 110 minutes (same as MT1). Two pages (one double-sided sheet) of handwritten
More informationµ X (A) = P ( X 1 (A) )
1 STOCHASTIC PROCESSES This appendix provides a very basic introduction to the language of probability theory and stochastic processes. We assume the reader is familiar with the general measure and integration
More information