Weak quenched limiting distributions of a one-dimensional random walk in a random environment
|
|
- Dennis Walton
- 5 years ago
- Views:
Transcription
1 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 13, 2010 Cornell University Jonathon Peterson 9/13/ / 27
2 Introduction RWRE in Z with i.i.d. environment An environment ω = {ω x } x Z Ω = [0, 1] Z. P an i.i.d. product measure on Ω. 1 ω x ω x x 1 x x + 1 Cornell University Jonathon Peterson 9/13/ / 27
3 Introduction RWRE in Z with i.i.d. environment An environment ω = {ω x } x Z Ω = [0, 1] Z. P an i.i.d. product measure on Ω. 1 ω x ω x x 1 x x + 1 Quenched law P ω : fix an environment. X n a random walk: X 0 = 0, and P ω (X n+1 = y + 1 X n = y) := ω y Cornell University Jonathon Peterson 9/13/ / 27
4 Introduction RWRE in Z with i.i.d. environment An environment ω = {ω x } x Z Ω = [0, 1] Z. P an i.i.d. product measure on Ω. 1 ω x ω x x 1 x x + 1 Quenched law P ω : fix an environment. X n a random walk: X 0 = 0, and P ω (X n+1 = y + 1 X n = y) := ω y Averaged law P: average over environments. P(G) := P ω (G)dP(ω) Ω Cornell University Jonathon Peterson 9/13/ / 27
5 Introduction Transience Criterion A crucial statistic is: ρ x := 1 ω x ω x Theorem (Solomon 75) 1 If E P (log ρ 0 ) < 0 then, lim n X n = +, P a.s. 2 If E P (log ρ 0 ) > 0 then, lim n X n =, P a.s. 3 If E P (log ρ 0 ) = 0 then, X n is recurrent. Cornell University Jonathon Peterson 9/13/ / 27
6 Introduction Transience Criterion A crucial statistic is: ρ x := 1 ω x ω x Theorem (Solomon 75) 1 If E P (log ρ 0 ) < 0 then, lim n X n = +, P a.s. 2 If E P (log ρ 0 ) > 0 then, lim n X n =, P a.s. 3 If E P (log ρ 0 ) = 0 then, X n is recurrent. Moreover, X n lim n n = v P > 0 E P ρ 0 < 1. Cornell University Jonathon Peterson 9/13/ / 27
7 Introduction Scale Parameter κ(p) for Transient RWRE Assume E P (log ρ) < 0 Define κ = κ(p) by (transience to the right). E P ρ κ = 1. E P [ρ p ] 1 κ p κ is related to the strength of the traps. Cornell University Jonathon Peterson 9/13/ / 27
8 Averaged limiting distribution Introduction Theorem (Kesten, Kozlov, Spitzer 75) There exists a constant b such that ( ) Xn (a) κ (0, 1) lim P n n κ x = 1 L κ,b (x 1/κ ) ( ) Xn nv (b) κ (1, 2) lim P P n n 1/κ x = 1 L κ,b ( x) ( ) Xn nv (c) κ > 2 lim P P n b x = Φ(x) n where L κ,b is an κ-stable distribution function. Remark: Also limiting distributions for κ = 1, 2 with log corrections to centering or scaling. Cornell University Jonathon Peterson 9/13/ / 27
9 Introduction Averaged Limiting Distribution (Hitting Times) T n := inf{k 0 : X k = n} Theorem (Kesten, Kozlov, Spitzer 75) There exists a constant b such that (a) κ (0, 1) lim (b) κ (1, 2) lim n P (c) κ > 2 lim n P ( Tn P n ( Tn nv 1 P n 1/κ ( Tn nv 1 P b n where L κ,b is an s-stable distribution function. ) n 1/κ x = L κ,b (x) ) x x ) = L κ,b (x) = Φ(x) Cornell University Jonathon Peterson 9/13/ / 27
10 Introduction Totally Asymmetric κ-stable Distribution Characteristic Function of L κ,b : ( exp { b t κ 1 i )} t t tan(πκ/2) Cornell University Jonathon Peterson 9/13/ / 27
11 Introduction Totally Asymmetric κ-stable Distribution Characteristic Function of L κ,b : ( exp { b t κ 1 i )} t t tan(πκ/2) If Y 0 and P(Y 1 > x) Cx κ, as x, then Y is in the domain of attraction of L κ,b. T n = n (T i T i 1 ) i=1 Cornell University Jonathon Peterson 9/13/ / 27
12 Quenched Limit Laws Quenched Limiting Distribution: Gaussian Regime Theorem (Goldsheid 06, P. 06) If κ > 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. ) = Φ(x), P a.s. Cornell University Jonathon Peterson 9/13/ / 27
13 Quenched Limit Laws Quenched Limiting Distribution: Gaussian Regime Theorem (Goldsheid 06, P. 06) If κ > 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. Cannot remove correction term Z n (ω). Scaling is different from averaged CLT. ) = Φ(x), P a.s. Cornell University Jonathon Peterson 9/13/ / 27
14 Quenched Limit Laws Quenched Limiting Distribution: Gaussian Regime Quenched CLT: T n = n i=1 (T i T i 1 ) Use Lindberg-Feller Condition Cornell University Jonathon Peterson 9/13/ / 27
15 Quenched Limit Laws Quenched Limiting Distribution: Gaussian Regime Quenched CLT: T n = n i=1 (T i T i 1 ) Use Lindberg-Feller Condition Quenched CLT Averaged CLT: T n n/v P n = T n E ω T n n E ωt n n/v P n Terms on right are asymptotically independent. (E ω T n n/v P )/ n is approximately mean zero Gaussian. Cornell University Jonathon Peterson 9/13/ / 27
16 Quenched Limit Laws Quenched Limiting Distribution: Gaussian Regime Quenched CLT: T n = n i=1 (T i T i 1 ) Use Lindberg-Feller Condition Quenched CLT Averaged CLT: T n n/v P n = T n E ω T n n E ωt n n/v P n Terms on right are asymptotically independent. (E ω T n n/v P )/ n is approximately mean zero Gaussian. Question What happens when κ < 2? Do we get quenched stable laws? Cornell University Jonathon Peterson 9/13/ / 27
17 Quenched Limits: κ < 2 Quenched Limit Laws Theorem (P. 07) If κ < 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 x ) = { 0 if x < 1 1 e x 1 if x 1 Cornell University Jonathon Peterson 9/13/ / 27
18 Quenched Limits: κ < 2 Quenched Limit Laws Theorem (P. 07) If κ < 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 FAQ (b) lim k P ω ( T mk E ω T mk Varω T mk Which limit is more likely? x ) = { 0 if x < 1 1 e x 1 if x 1 Cornell University Jonathon Peterson 9/13/ / 27
19 Quenched Limits: κ < 2 Quenched Limit Laws Theorem (P. 07) If κ < 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 FAQ (b) lim k P ω ( T mk E ω T mk Varω T mk Which limit is more likely? x What other subsequential limits are possible? ) = { 0 if x < 1 1 e x 1 if x 1 Cornell University Jonathon Peterson 9/13/ / 27
20 Quenched Limits: κ < 2 Quenched Limit Laws Theorem (P. 07) If κ < 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 FAQ (b) lim k P ω ( T mk E ω T mk Varω T mk Which limit is more likely? x What other subsequential limits are possible? Where do the κ-stable distributions come from. ) = { 0 if x < 1 1 e x 1 if x 1 Cornell University Jonathon Peterson 9/13/ / 27
21 Main Results Weak Quenched Limits: κ < 2 For any x R, is a random variable. P ω ( Tn E ω T n n 1/κ ) x Doesn t converge almost surely to a deterministic constant. Maybe converges in some weaker sense (in distribution). Cornell University Jonathon Peterson 9/13/ / 27
22 Random distributions Main Results M 1 = Probability distributions on R. - Equip with topology of convergence in distribution. Quenched distributions are M 1 -valued random variables. Quenched CLT (κ > 2): Then, µ n,ω (A) = P ω ( Tn E ω T n σ n lim µ n,ω = γ 0 M 1, n ) A. P a.s. where γ 0 M 1 is the standard normal distribution. Cornell University Jonathon Peterson 9/13/ / 27
23 Main Results Weak Quenched Limiting Distributions: κ < 2 µ n,ω (A) = P ω ( Tn E ω T n n 1/κ ) A Theorem (P. & Samorodnitsky 10) If κ < 2, then there exists a λ > 0 such that µ n,ω = n µ λ,κ, where µ λ,κ is a random probability distribution defined by ( ) µ λ,κ (A) = P a i (τ i 1) A a i, i 1 i=1 and N = i 1 δ a i is a non-homogeneous Poisson point process with intensity measure λκx κ 1 dx. Cornell University Jonathon Peterson 9/13/ / 27
24 Potential and Traps Trapping Effects i 1 k=0 log ρ k, i > 0 V (i) := 0, i = 0 1 k=i log ρ k, i < 0 Trap: Atypical section where the potential is increasing. Cornell University Jonathon Peterson 9/13/ / 27
25 Trapping Effects Cornell University Jonathon Peterson 9/13/ / 27
26 Blocks of the environment Trapping Effects Ladder locations {ν n } defined by ν 0 = 0, ν n := inf{i > ν n 1 : V (i) < V (ν n 1 )} ν 1 ν 2 ν 3 ν 4 ν 5 ν 6 ν 7 Cornell University Jonathon Peterson 9/13/ / 27
27 Blocks of the environment Trapping Effects Ladder locations {ν n } defined by ν 0 = 0, ν n := inf{i > ν n 1 : V (i) < V (ν n 1 )} ν 1 ν 2 ν 3 ν 4 ν 5 ν 6 ν 7 Q( ) = P ( {V (i) > 0, i < 0}) Under Q, the environment is stationary under shifts of the ν i. Cornell University Jonathon Peterson 9/13/ / 27
28 Trapping Effects Reduction to T νn ν n = n i=1 (ν i ν i 1 ). LLN implies ν n n ν = E Pν 1 Cornell University Jonathon Peterson 9/13/ / 27
29 Trapping Effects Reduction to T νn ν n = n i=1 (ν i ν i 1 ). LLN implies ν n n ν = E Pν 1 Enough to study ( ) Tνn E ω T νn φ n,ω ( ) = P ω n 1/κ Want to show φ n,ω = µ λ,κ for some λ. Cornell University Jonathon Peterson 9/13/ / 27
30 Escaping Traps Trapping Effects Probability of escaping a trap of Height H. P ω (T b < T 1 ) = b j=1 ev (j) V (b) = H 1 0 b Cornell University Jonathon Peterson 9/13/ / 27
31 Escaping Traps Trapping Effects Probability of escaping a trap of Height H. P ω (T b < T 1 ) = b j=1 ev (j) e V (b) = e H V (b) = H 1 0 b Cornell University Jonathon Peterson 9/13/ / 27
32 Escaping Traps Trapping Effects Probability of escaping a trap of Height H. P ω (T b < T 1 ) = b j=1 ev (j) e V (b) = e H Time to escape trap of height H Exp(e H ). V (b) = H 1 0 b Cornell University Jonathon Peterson 9/13/ / 27
33 Comparison with exponentials Want: T ν Law (Eω T ν )τ. Trapping Effects Cornell University Jonathon Peterson 9/13/ / 27
34 Trapping Effects Comparison with exponentials Want: T ν Law (Eω T ν )τ. Decompose T ν into trials Where T ν = S + G i=1 F i S (T ν T ν < T + 0 ) F i (T + 0 T + 0 < T ν) G Geo(p ω ), where p ω = P ω (T ν < T + 0 ) Cornell University Jonathon Peterson 9/13/ / 27
35 Comparison with exponentials Want: T ν Law (Eω T ν )τ. Decompose T ν into trials Trapping Effects Where T ν = S + G i=1 F i S (T ν T ν < T + 0 ) F i (T + 0 T + 0 < T ν) G Geo(p ω ), where p ω = P ω (T ν < T + 0 ) Couple G with an exponential τ G = τ log(1/(1 p ω )). Cornell University Jonathon Peterson 9/13/ / 27
36 Proofs Heuristics of Quenched Limit Laws n n T νn = (T νi T νi 1 ) Law β i τ i i=1 i=1 where τ i are i.i.d. Exp(1) random variables and β i = β i (ω) = E ω (T νi T νi 1 ) Cornell University Jonathon Peterson 9/13/ / 27
37 Proofs Heuristics of Quenched Limit Laws n n T νn = (T νi T νi 1 ) Law β i τ i i=1 i=1 where τ i are i.i.d. Exp(1) random variables and β i = β i (ω) = E ω (T νi T νi 1 ) Reduced to study of ( 1 σ n,ω ( ) = P ω n 1/κ ) n β i (τ i 1). i=1 where τ i are i.i.d. exponential(1). Cornell University Jonathon Peterson 9/13/ / 27
38 Proofs Properties of β i 1 {β i } is stationary under Q. 2 The β i have heavy tails. 3 {β i } has good mixing properties. Cornell University Jonathon Peterson 9/13/ / 27
39 Proofs Properties of β i 1 {β i } is stationary under Q. 2 The β i have heavy tails. 3 {β i } has good mixing properties. Theorem (P. & Zeitouni 08) There exists a constant C > 0 such that Q(β 1 > x) = Q(E ω T ν > x) Cx κ. Moreover, if κ < 1 then there exists a constant b > 0 such that ( ) lim Q 1 n n n 1/κ β i x = L κ,b (x). i=1 Cornell University Jonathon Peterson 9/13/ / 27
40 Proofs Properties of β i 1 {β i } is stationary under Q. 2 The β i have heavy tails. 3 {β i } has good mixing properties. Theorem (P. & Zeitouni 08) There exists a constant C > 0 such that Q(β 1 > x) = Q(E ω T ν > x) Cx κ. Moreover, if κ < 1 then there exists a constant b > 0 such that ( ) lim Q 1 n n n 1/κ β i x = L κ,b (x). i=1 Kesten showed that P(E ω T 1 > x) C x κ. Cornell University Jonathon Peterson 9/13/ / 27
41 Point Process Convergence Proofs M p = Point processes i 1 δ x i on (0, ). N n = N n (ω) = n i=1 δ βi /n 1/κ Cornell University Jonathon Peterson 9/13/ / 27
42 Proofs Point Process Convergence M p = Point processes i 1 δ x i on (0, ). N n = N n (ω) = n i=1 δ βi /n 1/κ Proposition (P. & Samorodnitsky 10) Let κ < 2. Then N n = N λ,κ, where N λ,κ is a non-homogeneous Poisson point process with intensity measure λκx κ 1 dx, for some λ > 0. Cornell University Jonathon Peterson 9/13/ / 27
43 Proofs Point Process Convergence M p = Point processes i 1 δ x i on (0, ). N n = N n (ω) = n i=1 δ βi /n 1/κ Proposition (P. & Samorodnitsky 10) Let κ < 2. Then N n = N λ,κ, where N λ,κ is a non-homogeneous Poisson point process with intensity measure λκx κ 1 dx, for some λ > 0. Remark: N λ,κ = i 1 δ a i can be constructed by letting a i = Γ 1/κ i, where Γ i are the arrivals of a homogeneous Poisson(λ) point process. Cornell University Jonathon Peterson 9/13/ / 27
44 Proofs Define H : M p M 1 by ζ = δ xi = H(ζ)(A) = P x i (τ i 1) A x i, i 1. i 1 i 1 Remark: Only defined if x 2 i <. Cornell University Jonathon Peterson 9/13/ / 27
45 Proofs Define H : M p M 1 by ζ = δ xi = H(ζ)(A) = P x i (τ i 1) A x i, i 1. i 1 i 1 Remark: Only defined if x 2 i <. Recall σ n,ω = H(N n ) µ λ,κ D = H(Nλ,κ ) Since N n = N λ,κ, would like to conclude that µ n,ω = H(N n ) = H(N λ,κ ). Cornell University Jonathon Peterson 9/13/ / 27
46 Proofs Define H : M p M 1 by ζ = δ xi = H(ζ)(A) = P x i (τ i 1) A x i, i 1. i 1 i 1 Remark: Only defined if x 2 i <. Recall σ n,ω = H(N n ) µ λ,κ D = H(Nλ,κ ) Since N n = N λ,κ, would like to conclude that H is NOT continuous. µ n,ω = H(N n ) = H(N λ,κ ). Cornell University Jonathon Peterson 9/13/ / 27
47 Proofs For ε > 0 let H ε : M p M 1 be defined by ζ = δ xi = H ε (ζ)(a) = P x i 1 {xi >ε}(τ i 1) A x i, i 1. i 1 i 1 Claim: H ε is continuous on {ζ M p : ζ({ε}) = 0} M p. Cornell University Jonathon Peterson 9/13/ / 27
48 Proofs For ε > 0 let H ε : M p M 1 be defined by ζ = δ xi = H ε (ζ)(a) = P x i 1 {xi >ε}(τ i 1) A x i, i 1. i 1 i 1 Claim: H ε is continuous on {ζ M p : ζ({ε}) = 0} M p. Let ζ n ζ with ζ({ε}) = 0. ζ [ε, ) = M i=1 δ x i. For n large ζ n [ε, ) = M i=1 δ x (n) i, and x (n) i x i for all i M. Cornell University Jonathon Peterson 9/13/ / 27
49 Proofs Since P(N({ε}) = 0) = 1, H ε (N n ) = H ε (N). It remains to show lim ε 0 lim ρ(h ε(n), H(N)) = 0, P a.s. (1) ε 0 lim sup Q (ρ(h ε (N n ), H(N n )) δ) = 0. (2) n Cornell University Jonathon Peterson 9/13/ / 27
50 Proofs Since P(N({ε}) = 0) = 1, H ε (N n ) = H ε (N). It remains to show lim ε 0 lim ρ(h ε(n), H(N)) = 0, P a.s. (1) ε 0 lim sup Q (ρ(h ε (N n ), H(N n )) δ) = 0. (2) n where ρ is the Prohorov metric on M 1. { } ρ(µ, π) = inf δ : µ(a) π(a (δ) ) + δ, for all Borel A Cornell University Jonathon Peterson 9/13/ / 27
51 H ε (N) H(N) Proofs H ε (N)(A) = P a i 1 {ai >ε}(τ i 1) A i 1 P a i (τ i 1) A (δ) + P a i 1 {ai ε}(τ i 1) i 1 i 1 δ H(N)(A (δ) ) + 1 δ 2 ai 2 1 {a i ε} i 1 Cornell University Jonathon Peterson 9/13/ / 27
52 H ε (N) H(N) Proofs H ε (N)(A) = P a i 1 {ai >ε}(τ i 1) A i 1 P a i (τ i 1) A (δ) + P a i 1 {ai ε}(τ i 1) i 1 i 1 δ H(N)(A (δ) ) + 1 δ 2 ai 2 1 {a i ε} i 1 Thus ρ(h ε (N), H(N)) ai 2 1 {a i ε} i 1 1/3 Cornell University Jonathon Peterson 9/13/ / 27
53 Proofs Similarly Q (ρ(h ε (N n ), H(N n )) > δ) Q 1 n 2/κ βi 2 1 {βi /n 1/κ ε} > δ3 i 1 n1 2/κ [ ] δ 3 E Q β1 2 1 {β 1 /n 1/κ ε} Cornell University Jonathon Peterson 9/13/ / 27
54 Proofs Similarly Q (ρ(h ε (N n ), H(N n )) > δ) Q 1 n 2/κ βi 2 1 {βi /n 1/κ ε} > δ3 i 1 n1 2/κ [ ] δ 3 E Q β1 2 1 {β 1 /n 1/κ ε} Control expectation with tail decay: ] E Q [β {β 1 /n 1/κ ε} C ε 1 κ/2 n 2/κ 1. Cornell University Jonathon Peterson 9/13/ / 27
55 Proofs Similarly Q (ρ(h ε (N n ), H(N n )) > δ) Q 1 n 2/κ βi 2 1 {βi /n 1/κ ε} > δ3 i 1 n1 2/κ [ ] δ 3 E Q β1 2 1 {β 1 /n 1/κ ε} Control expectation with tail decay: ] E Q [β {β 1 /n 1/κ ε} C ε 1 κ/2 n 2/κ 1. Thus, Q (ρ(h ε (N n ), H(N n )) > δ) C δ 3 ε1 κ/2. Cornell University Jonathon Peterson 9/13/ / 27
Quenched Limit Laws for Transient, One-Dimensional Random Walk in Random Environment
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/2008 1 / 19 Background
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 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 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 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 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 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 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 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 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 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 informationBeyond the color of the noise: what is memory in random phenomena?
Beyond the color of the noise: what is memory in random phenomena? Gennady Samorodnitsky Cornell University September 19, 2014 Randomness means lack of pattern or predictability in events according to
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 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 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 informationOn the convergence of sequences of random variables: A primer
BCAM May 2012 1 On the convergence of sequences of random variables: A primer Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM May 2012 2 A sequence a :
More 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 informationIntroduction to Rare Event Simulation
Introduction to Rare Event Simulation Brown University: Summer School on Rare Event Simulation Jose Blanchet Columbia University. Department of Statistics, Department of IEOR. Blanchet (Columbia) 1 / 31
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 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 informationInference for High Dimensional Robust Regression
Department of Statistics UC Berkeley Stanford-Berkeley Joint Colloquium, 2015 Table of Contents 1 Background 2 Main Results 3 OLS: A Motivating Example Table of Contents 1 Background 2 Main Results 3 OLS:
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 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 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 informationBrownian motion. Samy Tindel. Purdue University. Probability Theory 2 - MA 539
Brownian motion Samy Tindel Purdue University Probability Theory 2 - MA 539 Mostly taken from Brownian Motion and Stochastic Calculus by I. Karatzas and S. Shreve Samy T. Brownian motion Probability Theory
More 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 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 informationarxiv: v5 [math.pr] 5 Nov 2015
Shortest Path through Random Points Sung Jin Hwang Steven B. Damelin Alfred O. Hero III arxiv:1202.0045v5 [math.pr] 5 Nov 2015 University of Michigan Mathematical Reviews Abstract Let M, g 1 ) be a complete
More informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationBrownian survival and Lifshitz tail in perturbed lattice disorder
Brownian survival and Lifshitz tail in perturbed lattice disorder Ryoki Fukushima Kyoto niversity Random Processes and Systems February 16, 2009 6 B T 1. Model ) ({B t t 0, P x : standard Brownian motion
More informationMixing time for a random walk on a ring
Mixing time for a random walk on a ring Stephen Connor Joint work with Michael Bate Paris, September 2013 Introduction Let X be a discrete time Markov chain on a finite state space S, with transition matrix
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 informationMax stable Processes & Random Fields: Representations, Models, and Prediction
Max stable Processes & Random Fields: Representations, Models, and Prediction Stilian Stoev University of Michigan, Ann Arbor March 2, 2011 Based on joint works with Yizao Wang and Murad S. Taqqu. 1 Preliminaries
More informationQuenched invariance principle for random walks on Poisson-Delaunay triangulations
Quenched invariance principle for random walks on Poisson-Delaunay triangulations Institut de Mathématiques de Bourgogne Journées de Probabilités Université de Rouen Jeudi 17 septembre 2015 Introduction
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 informationEconomics 241B Review of Limit Theorems for Sequences of Random Variables
Economics 241B Review of Limit Theorems for Sequences of Random Variables Convergence in Distribution The previous de nitions of convergence focus on the outcome sequences of a random variable. Convergence
More informationAsymptotics for posterior hazards
Asymptotics for posterior hazards Pierpaolo De Blasi University of Turin 10th August 2007, BNR Workshop, Isaac Newton Intitute, Cambridge, UK Joint work with Giovanni Peccati (Université Paris VI) and
More informationLecture Notes 3 Convergence (Chapter 5)
Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let
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 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 informationNonparametric regression with martingale increment errors
S. Gaïffas (LSTA - Paris 6) joint work with S. Delattre (LPMA - Paris 7) work in progress Motivations Some facts: Theoretical study of statistical algorithms requires stationary and ergodicity. Concentration
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 information6.1 Moment Generating and Characteristic Functions
Chapter 6 Limit Theorems The power statistics can mostly be seen when there is a large collection of data points and we are interested in understanding the macro state of the system, e.g., the average,
More informationRandom Process Lecture 1. Fundamentals of Probability
Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus
More 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 informationAGING OF THE METROPOLIS DYNAMICS ON THE RANDOM ENERGY MODEL
AGIG OF THE METROPOLIS DYAMICS O THE RADOM EERGY MODEL JIŘÍ ČERÝ AD TOBIAS WASSMER Abstract. We study the Metropolis dynamics of the simplest mean-field spin glass model, the Random Energy Model. We show
More informationA Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback
A Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback Vincent Y. F. Tan (NUS) Joint work with Silas L. Fong (Toronto) 2017 Information Theory Workshop, Kaohsiung,
More informationLower Tail Probabilities and Normal Comparison Inequalities. In Memory of Wenbo V. Li s Contributions
Lower Tail Probabilities and Normal Comparison Inequalities In Memory of Wenbo V. Li s Contributions Qi-Man Shao The Chinese University of Hong Kong Lower Tail Probabilities and Normal Comparison Inequalities
More informationEstimating the efficient price from the order flow : a Brownian Cox process approach
Estimating the efficient price from the order flow : a Brownian Cox process approach - Sylvain DELARE Université Paris Diderot, LPMA) - Christian ROBER Université Lyon 1, Laboratoire SAF) - Mathieu ROSENBAUM
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 informationSome functional (Hölderian) limit theorems and their applications (II)
Some functional (Hölderian) limit theorems and their applications (II) Alfredas Račkauskas Vilnius University Outils Statistiques et Probabilistes pour la Finance Université de Rouen June 1 5, Rouen (Rouen
More informationNegative Association, Ordering and Convergence of Resampling Methods
Negative Association, Ordering and Convergence of Resampling Methods Nicolas Chopin ENSAE, Paristech (Joint work with Mathieu Gerber and Nick Whiteley, University of Bristol) Resampling schemes: Informal
More informationTail process and its role in limit theorems Bojan Basrak, University of Zagreb
Tail process and its role in limit theorems Bojan Basrak, University of Zagreb The Fields Institute Toronto, May 2016 based on the joint work (in progress) with Philippe Soulier, Azra Tafro, Hrvoje Planinić
More informationPoisson Cluster process as a model for teletraffic arrivals and its extremes
Poisson Cluster process as a model for teletraffic arrivals and its extremes Barbara González-Arévalo, University of Louisiana Thomas Mikosch, University of Copenhagen Gennady Samorodnitsky, Cornell University
More informationModern Discrete Probability Branching processes
Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson
More informationRegular Variation and Extreme Events for Stochastic Processes
1 Regular Variation and Extreme Events for Stochastic Processes FILIP LINDSKOG Royal Institute of Technology, Stockholm 2005 based on joint work with Henrik Hult www.math.kth.se/ lindskog 2 Extremes for
More informationEstimation of the functional Weibull-tail coefficient
1/ 29 Estimation of the functional Weibull-tail coefficient Stéphane Girard Inria Grenoble Rhône-Alpes & LJK, France http://mistis.inrialpes.fr/people/girard/ June 2016 joint work with Laurent Gardes,
More informationIntroducing the Normal Distribution
Department of Mathematics Ma 3/103 KC Border Introduction to Probability and Statistics Winter 2017 Lecture 10: Introducing the Normal Distribution Relevant textbook passages: Pitman [5]: Sections 1.2,
More informationIntroduction to Self-normalized Limit Theory
Introduction to Self-normalized Limit Theory Qi-Man Shao The Chinese University of Hong Kong E-mail: qmshao@cuhk.edu.hk Outline What is the self-normalization? Why? Classical limit theorems Self-normalized
More informationIntroduction 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 informationGaussian Random Fields: Excursion Probabilities
Gaussian Random Fields: Excursion Probabilities Yimin Xiao Michigan State University Lecture 5 Excursion Probabilities 1 Some classical results on excursion probabilities A large deviation result Upper
More informationExtended Renovation Theory and Limit Theorems for Stochastic Ordered Graphs
Markov Processes Relat. Fields 9, 413 468 (2003) Extended Renovation Theory and Limit Theorems for Stochastic Ordered Graphs S. Foss 1 and T. Konstantopoulos 2 1 Department of Actuarial Mathematics 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 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 informationSEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE
SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE FRANÇOIS BOLLEY Abstract. In this note we prove in an elementary way that the Wasserstein distances, which play a basic role in optimal transportation
More 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 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 informationHeavy Tailed Time Series with Extremal Independence
Heavy Tailed Time Series with Extremal Independence Rafa l Kulik and Philippe Soulier Conference in honour of Prof. Herold Dehling Bochum January 16, 2015 Rafa l Kulik and Philippe Soulier Regular variation
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 informationLecture 8: Information Theory and Statistics
Lecture 8: Information Theory and Statistics Part II: Hypothesis Testing and I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw December 23, 2015 1 / 50 I-Hsiang
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 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 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 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 informationLocal semicircle law, Wegner estimate and level repulsion for Wigner random matrices
Local semicircle law, Wegner estimate and level repulsion for Wigner random matrices László Erdős University of Munich Oberwolfach, 2008 Dec Joint work with H.T. Yau (Harvard), B. Schlein (Cambrigde) Goal:
More informationGaussian Limits for Random Measures in Geometric Probability
Gaussian Limits for Random Measures in Geometric Probability Yu. Baryshnikov and J. E. Yukich 1 September 22, 2004 bstract We establish Gaussian limits for measures induced by binomial and Poisson point
More information1. 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 informationExercises with solutions (Set D)
Exercises with solutions Set D. A fair die is rolled at the same time as a fair coin is tossed. Let A be the number on the upper surface of the die and let B describe the outcome of the coin toss, where
More informationInvariance 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 informationP (A G) dp G P (A G)
First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume
More informationExtremogram and Ex-Periodogram for heavy-tailed time series
Extremogram and Ex-Periodogram for heavy-tailed time series 1 Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia) and Yuwei Zhao (Ulm) 1 Jussieu, April 9, 2014 1 2 Extremal
More informationWEAK QUENCHED LIMITING DISTRIBUTIONS FOR TRANSIENT ONE-DIMENSIONAL RANDOM WALK IN A RANDOM ENVIRONMENT
WEAK QUENCHED LIMITING DISTRIBUTIONS FOR TRANSIENT ONE-DIMENSIONAL RANDOM WALK IN A RANDOM ENVIRONMENT JONATHON PETERSON AND GENNADY SAMORODNITSKY Abstract. We consder a one-dmensonal, transent random
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 informationDisjointness and Additivity
Midterm 2: Format Midterm 2 Review CS70 Summer 2016 - Lecture 6D David Dinh 28 July 2016 UC Berkeley 8 questions, 190 points, 110 minutes (same as MT1). Two pages (one double-sided sheet) of handwritten
More informationSuperconcentration inequalities for centered Gaussian stationnary processes
Superconcentration inequalities for centered Gaussian stationnary processes Kevin Tanguy Toulouse University June 21, 2016 1 / 22 Outline What is superconcentration? Convergence of extremes (Gaussian case).
More 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 informationExtremogram and ex-periodogram for heavy-tailed time series
Extremogram and ex-periodogram for heavy-tailed time series 1 Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia) and Yuwei Zhao (Ulm) 1 Zagreb, June 6, 2014 1 2 Extremal
More informationLecture 4: September Reminder: convergence of sequences
36-705: Intermediate Statistics Fall 2017 Lecturer: Siva Balakrishnan Lecture 4: September 6 In this lecture we discuss the convergence of random variables. At a high-level, our first few lectures focused
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 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 informationWeak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria
Weak Leiden University Amsterdam, 13 November 2013 Outline 1 2 3 4 5 6 7 Definition Definition Let µ, µ 1, µ 2,... be probability measures on (R, B). It is said that µ n converges weakly to µ, and we then
More informationProbability Theory. Richard F. Bass
Probability Theory Richard F. Bass ii c Copyright 2014 Richard F. Bass Contents 1 Basic notions 1 1.1 A few definitions from measure theory............. 1 1.2 Definitions............................. 2
More informationDifferent scaling regimes for geometric Poisson functionals
Different scaling regimes for geometric Poisson functionals Raphaël Lachièze-Rey, Univ. Paris 5 René Descartes Joint work with Giovanni Peccati, University of Luxembourg isson Point Processes: Malliavin
More informationConsistency of Modularity Clustering on Random Geometric Graphs
Consistency of Modularity Clustering on Random Geometric Graphs Erik Davis The University of Arizona May 10, 2016 Outline Introduction to Modularity Clustering Pointwise Convergence Convergence of Optimal
More informationTranslation Invariant Exclusion Processes (Book in Progress)
Translation Invariant Exclusion Processes (Book in Progress) c 2003 Timo Seppäläinen Department of Mathematics University of Wisconsin Madison, WI 53706-1388 December 11, 2008 Contents PART I Preliminaries
More informationarxiv: v2 [q-fin.tr] 11 Apr 2013
Estimating the efficient price from the order flow: a Brownian Cox process approach arxiv:131.3114v2 [q-fin.r] 11 Apr 213 Sylvain Delattre LPMA, Université Paris Diderot Paris 7) delattre@math.univ-paris-diderot.fr
More informationProbability and Measure
Chapter 4 Probability and Measure 4.1 Introduction In this chapter we will examine probability theory from the measure theoretic perspective. The realisation that measure theory is the foundation of probability
More informationGARCH processes continuous counterparts (Part 2)
GARCH processes continuous counterparts (Part 2) Alexander Lindner Centre of Mathematical Sciences Technical University of Munich D 85747 Garching Germany lindner@ma.tum.de http://www-m1.ma.tum.de/m4/pers/lindner/
More informationforms a complete separable metric space. The Hausdorff metric is subinvariant, i.e.,
Applied Probability Trust 13 August 2010) LARGE DEVIATIONS FOR MINKOWSKI SUMS OF HEAVY-TAILED GENERALLY NON-CONVEX RANDOM COMPACT SETS THOMAS MIKOSCH, University of Copenhagen ZBYNĚK PAWLAS, Charles University
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 information