Large Deviations and Slowdown Asymptotics of Excited Random Walks - - PowerPoint PPT Presentation

large deviations and slowdown asymptotics of excited
SMART_READER_LITE
LIVE PREVIEW

Large Deviations and Slowdown Asymptotics of Excited Random Walks - - PowerPoint PPT Presentation

LDP for Excited Random Walks Large Deviations and Slowdown Asymptotics of Excited Random Walks Jonathon Peterson Department of Mathematics Purdue University September 4, 2012 Jonathon Peterson 9/4/2012 1 / 13 LDP for Excited Random Walks


slide-1
SLIDE 1

LDP for Excited Random Walks

Large Deviations and Slowdown Asymptotics of Excited Random Walks

Jonathon Peterson

Department of Mathematics Purdue University

September 4, 2012

Jonathon Peterson 9/4/2012 1 / 13

slide-2
SLIDE 2

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

(M, p) Cookie Random Walk Initially M cookies at each site.

Jonathon Peterson 9/4/2012 2 / 13

slide-3
SLIDE 3

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

(M, p) Cookie Random Walk Initially M cookies at each site.

◮ Cookie available: Eat cookie. Move right with probability

p ∈ (0, 1)

1 − p p

Jonathon Peterson 9/4/2012 2 / 13

slide-4
SLIDE 4

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

(M, p) Cookie Random Walk Initially M cookies at each site.

◮ Cookie available: Eat cookie. Move right with probability

p ∈ (0, 1)

Jonathon Peterson 9/4/2012 2 / 13

slide-5
SLIDE 5

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

(M, p) Cookie Random Walk Initially M cookies at each site.

◮ Cookie available: Eat cookie. Move right with probability

p ∈ (0, 1)

1 − p p

Jonathon Peterson 9/4/2012 2 / 13

slide-6
SLIDE 6

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

(M, p) Cookie Random Walk Initially M cookies at each site.

◮ Cookie available: Eat cookie. Move right with probability

p ∈ (0, 1)

◮ No cookies: Move right/left with probability 1 2.

Jonathon Peterson 9/4/2012 2 / 13

slide-7
SLIDE 7

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

(M, p) Cookie Random Walk Initially M cookies at each site.

◮ Cookie available: Eat cookie. Move right with probability

p ∈ (0, 1)

◮ No cookies: Move right/left with probability 1 2.

1 2 1 2 Jonathon Peterson 9/4/2012 2 / 13

slide-8
SLIDE 8

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

Unequal cookies

◮ M cookies at each site. ◮ Cookie strengths p1, p2, . . . , pM ∈ (0, 1).

Jonathon Peterson 9/4/2012 3 / 13

slide-9
SLIDE 9

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

Unequal cookies

◮ M cookies at each site. ◮ Cookie strengths p1, p2, . . . , pM ∈ (0, 1). 1 − p1 p1

Jonathon Peterson 9/4/2012 3 / 13

slide-10
SLIDE 10

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

Unequal cookies

◮ M cookies at each site. ◮ Cookie strengths p1, p2, . . . , pM ∈ (0, 1).

Jonathon Peterson 9/4/2012 3 / 13

slide-11
SLIDE 11

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

Unequal cookies

◮ M cookies at each site. ◮ Cookie strengths p1, p2, . . . , pM ∈ (0, 1). 1 − p1 p1

Jonathon Peterson 9/4/2012 3 / 13

slide-12
SLIDE 12

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

Unequal cookies

◮ M cookies at each site. ◮ Cookie strengths p1, p2, . . . , pM ∈ (0, 1).

Jonathon Peterson 9/4/2012 3 / 13

slide-13
SLIDE 13

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

Unequal cookies

◮ M cookies at each site. ◮ Cookie strengths p1, p2, . . . , pM ∈ (0, 1). 1 − p2 p2

Jonathon Peterson 9/4/2012 3 / 13

slide-14
SLIDE 14

LDP for Excited Random Walks Excited Random Walks

Excited (Cookie) Random Walks

Random i.i.d. cookie environments

◮ M cookies per site. ◮ ωx(j) – strength of j-th cookie at site x. ◮ Cookie environment ω = {ωx} is i.i.d.

Cookies within a stack may be dependent.

Jonathon Peterson 9/4/2012 4 / 13

slide-15
SLIDE 15

LDP for Excited Random Walks Excited Random Walks

Recurrence/Transience and LLN

Average drift per site δ = E  

M

  • j=1

(2ω0(j) − 1)   Theorem ( Zerner ’05, Zerner & Kosygina ’08) The cookie RW is recurrent if and only if δ ∈ [−1, 1].

Jonathon Peterson 9/4/2012 5 / 13

slide-16
SLIDE 16

LDP for Excited Random Walks Excited Random Walks

Recurrence/Transience and LLN

Average drift per site δ = E  

M

  • j=1

(2ω0(j) − 1)   Theorem ( Zerner ’05, Zerner & Kosygina ’08) The cookie RW is recurrent if and only if δ ∈ [−1, 1]. Theorem (Basdevant & Singh ’07, Zerner & Kosygina ’08) limn→∞ Xn/n = v0, and v0 > 0 ⇐ ⇒ δ > 2. No explicit formula is known for v0.

Jonathon Peterson 9/4/2012 5 / 13

slide-17
SLIDE 17

LDP for Excited Random Walks Excited Random Walks

Limiting Distributions for Excited Random Walks

Theorem (Basdevant & Singh ’08, Kosygina & Zerner ’08, Dolgopyat ’11) Excited random walks have the following limiting distributions. Regime Re-scaling Limiting Distribution δ ∈ (1, 2)

Xn nδ/2

δ

2-stable

−δ/2 δ ∈ (2, 4)

Xn−nv0 n2/δ

Totally asymmetric δ

2-stable

δ > 4

Xn−nv0 A√n

Gaussian Results are also known for other values of δ. Note: δ > 1 results similar to transient RWRE.

Jonathon Peterson 9/4/2012 6 / 13

slide-18
SLIDE 18

LDP for Excited Random Walks Excited Random Walks

Limiting Distributions for Excited Random Walks

Theorem (Basdevant & Singh ’08, Kosygina & Zerner ’08, Dolgopyat ’11) Hitting times Tn = min{k ≥ 0 : Xk = n} of excited random walks have the following limiting distributions. Regime Re-scaling Limiting Distribution δ ∈ (1, 2)

Tn n2/δ

Totally asymmetric δ

2-stable

δ ∈ (2, 4)

Tn−n/v0 n2/δ

Totally asymmetric δ

2-stable

δ > 4

Tn−n/v0 A√n

Gaussian Results are also known for other values of δ. Note: δ > 1 results similar to transient RWRE.

Jonathon Peterson 9/4/2012 7 / 13

slide-19
SLIDE 19

LDP for Excited Random Walks Excited Random Walks

Large Deviations for Excited Random Walks

Theorem (P . ’12) Xn/n has a large deviation principle with rate function IX(x). That is, for any open G ⊂ [−1, 1] lim inf

n→∞

1 n log P(Xn/n ∈ G) ≥ − inf

x∈G IX(x)

and for any closed F ⊂ [−1, 1] lim sup

n→∞

1 n log P(Xn/n ∈ F) ≤ − inf

x∈F IX(x)

Informally, P(Xn ≈ xn) ≈ e−nIX (x).

Jonathon Peterson 9/4/2012 8 / 13

slide-20
SLIDE 20

LDP for Excited Random Walks Excited Random Walks

Large Deviations for Hitting Times of Excited Random Walks

Tx = inf{n ≥ 0 : Xn = x}, x ∈ Z. Theorem (P . ’12) Tn/n has a large deviation principle with rate function IT(t).

Jonathon Peterson 9/4/2012 9 / 13

slide-21
SLIDE 21

LDP for Excited Random Walks Excited Random Walks

Large Deviations for Hitting Times of Excited Random Walks

Tx = inf{n ≥ 0 : Xn = x}, x ∈ Z. Theorem (P . ’12) Tn/n has a large deviation principle with rate function IT(t). T−n/n has a large deviation principle with rate function IT(t).

Jonathon Peterson 9/4/2012 9 / 13

slide-22
SLIDE 22

LDP for Excited Random Walks Excited Random Walks

Large Deviations for Hitting Times of Excited Random Walks

Tx = inf{n ≥ 0 : Xn = x}, x ∈ Z. Theorem (P . ’12) Tn/n has a large deviation principle with rate function IT(t). T−n/n has a large deviation principle with rate function IT(t). Implies LDP for Xn/n. P(Xn > xn) ≈ P(Txn < n). IX(x) =      xIT(1/x) x ∈ (0, 1] x = 0 |x|IT(1/|x|) x ∈ [−1, 0)

Jonathon Peterson 9/4/2012 9 / 13

slide-23
SLIDE 23

LDP for Excited Random Walks Excited Random Walks

Properties of the rate function IX(x)

1 −1 x2 v0 x1 x2

δ > 2

1 −1 x2 x2

δ ∈ [−2, 2]

1

IX(x) is a convex function.

Jonathon Peterson 9/4/2012 10 / 13

slide-24
SLIDE 24

LDP for Excited Random Walks Excited Random Walks

Properties of the rate function IX(x)

1 −1 x2 v0 x1 x2

δ > 2

1 −1 x2 x2

δ ∈ [−2, 2]

1

IX(x) is a convex function.

2

Zero Set

◮ δ ∈ [−2, 2]:

IX(x) = 0 ⇐ ⇒ x = 0.

◮ δ > 2:

IX(x) = 0 ⇐ ⇒ x ∈ [0, v0].

Jonathon Peterson 9/4/2012 10 / 13

slide-25
SLIDE 25

LDP for Excited Random Walks Excited Random Walks

Properties of the rate function IX(x)

1 −1 x2 v0 x1 x2

δ > 2

1 −1 x2 x2

δ ∈ [−2, 2]

1

IX(x) is a convex function.

2

Zero Set

◮ δ ∈ [−2, 2]:

IX(x) = 0 ⇐ ⇒ x = 0.

◮ δ > 2:

IX(x) = 0 ⇐ ⇒ x ∈ [0, v0].

3

Derivatives

◮ I′

X(0) = limx→0 IX(x)/x = 0.

Jonathon Peterson 9/4/2012 10 / 13

slide-26
SLIDE 26

LDP for Excited Random Walks Excited Random Walks

Properties of the rate function IT(t)

1 t2 t1 1/v0 1 t2

δ > 2 δ ≤ 2

1

IT(t) is a convex function.

Jonathon Peterson 9/4/2012 11 / 13

slide-27
SLIDE 27

LDP for Excited Random Walks Excited Random Walks

Properties of the rate function IT(t)

1 t2 t1 1/v0 1 t2

δ > 2 δ ≤ 2

1

IT(t) is a convex function.

2

Zero Set

◮ δ ∈ [−2, 2]:

IT(t) > 0 but limt→∞ IT(t) = 0.

◮ δ > 2:

IT(t) = 0 ⇐ ⇒ t ≥ 1/v0.

Jonathon Peterson 9/4/2012 11 / 13

slide-28
SLIDE 28

LDP for Excited Random Walks Excited Random Walks

Slowdown probability asymptotics

IX(x) = 0 ⇐ ⇒ x ∈ [0, v0]. P(Xn < xn) decays sub-exponentially for x ∈ [0, v0].

Jonathon Peterson 9/4/2012 12 / 13

slide-29
SLIDE 29

LDP for Excited Random Walks Excited Random Walks

Slowdown probability asymptotics

IX(x) = 0 ⇐ ⇒ x ∈ [0, v0]. P(Xn < xn) decays sub-exponentially for x ∈ [0, v0]. Theorem (P . ’12) If δ > 2, then lim

n→∞

log P(Xn < xn) log n = 1 − δ 2, ∀x ∈ (0, v0) and lim

n→∞

log P(Tn > tn) log n = 1 − δ 2, ∀t > 1/v0. Similar to slowdown asymptotics for RWRE.

Jonathon Peterson 9/4/2012 12 / 13

slide-30
SLIDE 30

LDP for Excited Random Walks Branching Process with Migration

Associated branching process with migration

−1 1 2 3 4 5 −1 1 2 3 4 5 Jonathon Peterson 9/4/2012 13 / 13

slide-31
SLIDE 31

LDP for Excited Random Walks Branching Process with Migration

Associated branching process with migration

−1 1 2 3 4 5 D(5)

4

= 0 D(5)

3

= 1 D(5)

2

= 4 D(5)

1

= 2 D(5) = 1 D(5)

−1 = 2

D(5)

−2 = 0

−1 1 2 3 4 5

Tn = n + 2

  • i<n

D(n)

i

D(n)

i

= # steps ← from i before Tn

Jonathon Peterson 9/4/2012 13 / 13

slide-32
SLIDE 32

LDP for Excited Random Walks Branching Process with Migration

Associated branching process with migration

−1 1 2 3 4 5 V0 = 0 V1 = 1 V2 = 4 V3 = 2 V4 = 1 V5 = 2 V (5)

1

= 0 −1 1 2 3 4 5

Tn = n + 2

  • i<n

D(n)

i Law

= n + 2

n

  • i=1

Vi + 2

  • i=1

V (n)

i

D(n)

i

= # steps ← from i before Tn

Jonathon Peterson 9/4/2012 13 / 13