Random matrices and history dependent stochastic processes. - - PowerPoint PPT Presentation

random matrices and history dependent stochastic processes
SMART_READER_LITE
LIVE PREVIEW

Random matrices and history dependent stochastic processes. - - PowerPoint PPT Presentation

Random matrices and history dependent stochastic processes. Margherita DISERTORI Bonn University & Hausdorff Center for Mathematics History dependent stochastic processes memory effects, self-learning. . . ex: ants looking for the best


slide-1
SLIDE 1

Random matrices and history dependent stochastic processes.

Margherita DISERTORI Bonn University & Hausdorff Center for Mathematics

slide-2
SLIDE 2

History dependent stochastic processes memory effects, self-learning. . . ex: ants looking for the best route nest-food Lattice random Schr¨

  • dinger operators

quantum diffusion for disordered materials These subjects are connected!

slide-3
SLIDE 3

History dependent stochastic processes Example: linearly edge-reinforced random walk (ERRW )

(Diaconis 1986)

discrete time process (Xn)n≥0, Xn ∈ Zd or Λ ⊂⊂ Zd

slide-4
SLIDE 4

History dependent stochastic processes Example: linearly edge-reinforced random walk (ERRW )

(Diaconis 1986)

discrete time process (Xn)n≥0, Xn ∈ Zd or Λ ⊂⊂ Zd Construction: jump only to nearest neighbors

  • set X0 = i0 starting point

ωij(0) = a > 0 ∀|i − j| = 1 initial weights P(X1 = i1|X0 = i0) =

a 2da = 1 2d

∀|i0 − i1| = 1

slide-5
SLIDE 5

History dependent stochastic processes Example: linearly edge-reinforced random walk (ERRW )

(Diaconis 1986)

discrete time process (Xn)n≥0, Xn ∈ Zd or Λ ⊂⊂ Zd Construction: jump only to nearest neighbors

  • set X0 = i0 starting point

ωij(0) = a > 0 ∀|i − j| = 1 initial weights P(X1 = i1|X0 = i0) =

a 2da = 1 2d

∀|i0 − i1| = 1

  • update the weights ωij(1) =

a+1 i0i1 a

  • th.
slide-6
SLIDE 6

History dependent stochastic processes Example: linearly edge-reinforced random walk (ERRW )

(Diaconis 1986)

discrete time process (Xn)n≥0, Xn ∈ Zd or Λ ⊂⊂ Zd Construction: jump only to nearest neighbors

  • set X0 = i0 starting point

ωij(0) = a > 0 ∀|i − j| = 1 initial weights P(X1 = i1|X0 = i0) =

a 2da = 1 2d

∀|i0 − i1| = 1

  • update the weights ωij(1) =

a+1 i0i1 a

  • th.
  • set X0 = i0, X1 = i1,

P(X2 = i0|X0, X1) =

a+1 2da+1 > a 2da+1

= P(X2 = i2|X0, X1) ∀|i2 − i1| = 1, i2 = i1

slide-7
SLIDE 7

History dependent stochastic processes Example: linearly edge-reinforced random walk (ERRW )

(Diaconis 1986)

discrete time process (Xn)n≥0, Xn ∈ Zd or Λ ⊂⊂ Zd Construction: jump only to nearest neighbors

  • set X0 = i0 starting point

ωij(0) = a > 0 ∀|i − j| = 1 initial weights P(X1 = i1|X0 = i0) =

a 2da = 1 2d

∀|i0 − i1| = 1

  • update the weights ωij(1) =

a+1 i0i1 a

  • th.
  • set X0 = i0, X1 = i1,

P(X2 = i0|X0, X1) =

a+1 2da+1 > a 2da+1

= P(X2 = i2|X0, X1) ∀|i2 − i1| = 1, i2 = i1 prefers to come back!

slide-8
SLIDE 8

after n steps P(Xn+1 = j|Xn = i, (Xm)m≤n) = 1|i−j|=1 ωij(n)

  • k,|k−j|=1 ωik(n)

ωe(n) = a + #crossings of e up to time n

slide-9
SLIDE 9

after n steps P(Xn+1 = j|Xn = i, (Xm)m≤n) = 1|i−j|=1 ωij(n)

  • k,|k−j|=1 ωik(n)

ωe(n) = a + #crossings of e up to time n

a reinforcement parameter

the first time e is crossed a → a + 1 ≫ a if a ≪ 1 strong reinforcement ≃ a if a ≫ 1 weak reinforcement

slide-10
SLIDE 10

after n steps P(Xn+1 = j|Xn = i, (Xm)m≤n) = 1|i−j|=1 ωij(n)

  • k,|k−j|=1 ωik(n)

ωe(n) = a + #crossings of e up to time n

a reinforcement parameter

the first time e is crossed a → a + 1 ≫ a if a ≪ 1 strong reinforcement ≃ a if a ≫ 1 weak reinforcement

Generalizations

Λ any locally finite graph variable initial weights ae

slide-11
SLIDE 11

Vertex-reinforced jump process (VRJP )

(Werner 2000, Volkov, Davis)

slide-12
SLIDE 12

Vertex-reinforced jump process (VRJP )

(Werner 2000, Volkov, Davis)

  • continuous time jump process (Yt)t≥0, Yt ∈ Zd or Λ ⊂⊂ Zd
slide-13
SLIDE 13

Vertex-reinforced jump process (VRJP )

(Werner 2000, Volkov, Davis)

  • continuous time jump process (Yt)t≥0, Yt ∈ Zd or Λ ⊂⊂ Zd
  • conditioned on (Ys)s≤t jump from Yt = i to |j − i| = 1 with rate

ωjk(t) = W (1+Lj(t))

  • W >0

initial weight

Lj(t)

local time at j

slide-14
SLIDE 14

Vertex-reinforced jump process (VRJP )

(Werner 2000, Volkov, Davis)

  • continuous time jump process (Yt)t≥0, Yt ∈ Zd or Λ ⊂⊂ Zd
  • conditioned on (Ys)s≤t jump from Yt = i to |j − i| = 1 with rate

ωjk(t) = W (1+Lj(t))

  • W >0

initial weight

Lj(t)

local time at j

  • process prefers to come back, W plays the same role as a
slide-15
SLIDE 15

Vertex-reinforced jump process (VRJP )

(Werner 2000, Volkov, Davis)

  • continuous time jump process (Yt)t≥0, Yt ∈ Zd or Λ ⊂⊂ Zd
  • conditioned on (Ys)s≤t jump from Yt = i to |j − i| = 1 with rate

ωjk(t) = W (1+Lj(t))

  • W >0

initial weight

Lj(t)

local time at j

  • process prefers to come back, W plays the same role as a
  • generalization to variable initial rates We and

random initial rates

slide-16
SLIDE 16

Vertex-reinforced jump process (VRJP )

(Werner 2000, Volkov, Davis)

  • continuous time jump process (Yt)t≥0, Yt ∈ Zd or Λ ⊂⊂ Zd
  • conditioned on (Ys)s≤t jump from Yt = i to |j − i| = 1 with rate

ωjk(t) = W (1+Lj(t))

  • W >0

initial weight

Lj(t)

local time at j

  • process prefers to come back, W plays the same role as a
  • generalization to variable initial rates We and

random initial rates

Connections with

ERRW

[Sabot-Tarr` es 2013]

hitting times for interacting Brownian motions nonlinear sigma models and statistical mechanics random matrices

[Sabot-Tarr` es-Zeng 2015] [Sabot-Zeng 2015]

slide-17
SLIDE 17

transience/recurrence for VRJP and ERRW as Λ → Zd

positive recurrence

at strong reinforcement: ERRW and VRJP for any d ≥ 1

[Merkl-Rolles 2009], [D.-Spencer 2010] [Sabot-Tarr` es 2013] [Angel-Crawford-Kozma.Angel 2014]

for any reinforcement: ERRW and VRJP in d = 1 and strips

[Merkl-Rolles 2009], [D.-Spencer 2010] [Sabot-Tarr` es 2013] [D.-Merkl-Rolles 2014]

recurrence in d = 2

ERRW for any reinforcement, partial results for VRJP

[Merkl-Rolles 2009], [Sabot-Zeng 2015] [Bauerschmidt-Helmuth-Swan 2018]

transience in d ≥ 3

at weak reinforcement: ERRW and VRJP

[D.-Spencer-Zirnbauer 2010], [D.-Sabot-Tarr` es 2015]

⇒ phase transition in d ≥ 3

slide-18
SLIDE 18

Random matrices

slide-19
SLIDE 19

Random matrices

  • set up: Λ ⊂ Zd finite, HΛ ∈ CΛ×Λ

H∗

Λ = HΛ

HΛ random with some probability dPΛ(H) Question: limΛ→Zd dPΛ(H) =? spectral properties of the limit operator?

slide-20
SLIDE 20

Random matrices

  • set up: Λ ⊂ Zd finite, HΛ ∈ CΛ×Λ

H∗

Λ = HΛ

HΛ random with some probability dPΛ(H) Question: limΛ→Zd dPΛ(H) =? spectral properties of the limit operator?

  • special case: random Schr¨
  • dinger HΛ = −∆Λ + λ ˆ

V

[Anderson 1958 ]

−∆Λ lattice Laplacian, λ > 0 parameter ˆ V = diag({Vx}x∈Λ), V ∈ RΛ random vector dPΛ(V ) motivation: quantum mechanics, disordered conductors

slide-21
SLIDE 21

random Schr¨

  • dinger HΛ = −∆Λ + λ ˆ

V

two limit cases: λ = 0 : H = −∆ : l2(Zd) → l2(Zd) extended states: H has only generalized eigenfunctions ψλ(k)(x) = eik·x ∈ l2(Zd) conductor λ ≫ 1 : H ≃ ˆ V diagonal matrix ⇒ localized eigenfunctions insulator

slide-22
SLIDE 22

random Schr¨

  • dinger HΛ = −∆Λ + λ ˆ

V

two limit cases: λ = 0 : H = −∆ : l2(Zd) → l2(Zd) extended states: H has only generalized eigenfunctions ψλ(k)(x) = eik·x ∈ l2(Zd) conductor λ ≫ 1 : H ≃ ˆ V diagonal matrix ⇒ localized eigenfunctions insulator

results/conjectures in d ≥ 2

Assume V independent or short range correlated: large disorder λ ≫ 1 : exponentially localized eigenfunctions ∀d ≥ 2

[Fr¨

  • hlich-Spencer 1983], [Aizenman-Molchanov 1993 ] and many other results later. . .

d = 2 exponentially localized eigenfunctions ∀λ (conjecture) d ≥ 3 phase transition at weak disorder (conjecture)

slide-23
SLIDE 23

A special example of random Schr¨

  • dinger operator: HW (β) := 2ˆ

β − WP

−P = −∆ − 2dId (off-set Laplacian) Pij = 1|i−j|=1 β ∈ RΛ random vector with distribution 1H(β)>0 2

π

|Λ|/2 eW 2d|Λ|e−

j∈Λ βj

1 (det HW (β))

1 2 dβΛ

slide-24
SLIDE 24

A special example of random Schr¨

  • dinger operator: HW (β) := 2ˆ

β − WP

−P = −∆ − 2dId (off-set Laplacian) Pij = 1|i−j|=1 β ∈ RΛ random vector with distribution 1H(β)>0 2

π

|Λ|/2 eW 2d|Λ|e−

j∈Λ βj

1 (det HW (β))

1 2 dβΛ

features

βx > 0 ∀x a.s

slide-25
SLIDE 25

A special example of random Schr¨

  • dinger operator: HW (β) := 2ˆ

β − WP

−P = −∆ − 2dId (off-set Laplacian) Pij = 1|i−j|=1 β ∈ RΛ random vector with distribution 1H(β)>0 2

π

|Λ|/2 eW 2d|Λ|e−

j∈Λ βj

1 (det HW (β))

1 2 dβΛ

features

βx > 0 ∀x a.s short range correlations! E[e−

j λjβj] = e−W |i−j|=1(√1+λi√

1+λj−1) j(

  • 1 + λj)−1
slide-26
SLIDE 26

A special example of random Schr¨

  • dinger operator: HW (β) := 2ˆ

β − WP

−P = −∆ − 2dId (off-set Laplacian) Pij = 1|i−j|=1 β ∈ RΛ random vector with distribution 1H(β)>0 2

π

|Λ|/2 eW 2d|Λ|e−

j∈Λ βj

1 (det HW (β))

1 2 dβΛ

features

βx > 0 ∀x a.s short range correlations! E[e−

j λjβj] = e−W |i−j|=1(√1+λi√

1+λj−1) j(

  • 1 + λj)−1

for wired boundary conditions limΛ→Zd dPΛ(β) exists

slide-27
SLIDE 27

A special example of random Schr¨

  • dinger operator: HW (β) := 2ˆ

β − WP

−P = −∆ − 2dId (off-set Laplacian) Pij = 1|i−j|=1 β ∈ RΛ random vector with distribution 1H(β)>0 2

π

|Λ|/2 eW 2d|Λ|e−

j∈Λ βj

1 (det HW (β))

1 2 dβΛ

features

βx > 0 ∀x a.s short range correlations! E[e−

j λjβj] = e−W |i−j|=1(√1+λi√

1+λj−1) j(

  • 1 + λj)−1

for wired boundary conditions limΛ→Zd dPΛ(β) exists HW (β) ≡ −∆ + λ ˆ V with λ =

1 W :

HW (β) = W (−∆ + 1

W ˆ

V ), Vx = 2βx − 2dW E[Vx] = 2E[βx] − 2dW = (2dW + 1) − 2dW = 1.

slide-28
SLIDE 28

connection between RS and VRJP

set Λ ⊂ Zd finite

slide-29
SLIDE 29

connection between RS and VRJP

set Λ ⊂ Zd finite

  • (Zσ)σ≥0 time changed VRJP with jump rate ωij(σ) = W

2

1+Tj(σ)

1+Ti(σ)

Zσ same recurrence/transience properties as Yt

slide-30
SLIDE 30

connection between RS and VRJP

set Λ ⊂ Zd finite

  • (Zσ)σ≥0 time changed VRJP with jump rate ωij(σ) = W

2

1+Tj(σ)

1+Ti(σ)

Zσ same recurrence/transience properties as Yt

  • Zσ is a mixture of Markov jump processes:

PZ

Λ[·] = Eu[ Pω(u) Λ

[·] ] u ∈ RΛ random vector Pω(u)

Λ

[·] MJP with rate ωij(u) = W

2 euj−ui

slide-31
SLIDE 31

connection between RS and VRJP

set Λ ⊂ Zd finite

  • (Zσ)σ≥0 time changed VRJP with jump rate ωij(σ) = W

2

1+Tj(σ)

1+Ti(σ)

Zσ same recurrence/transience properties as Yt

  • Zσ is a mixture of Markov jump processes:

PZ

Λ[·] = Eu[ Pω(u) Λ

[·] ] u ∈ RΛ random vector Pω(u)

Λ

[·] MJP with rate ωij(u) = W

2 euj−ui

  • for fixed u the generator of the MJP is

(Lu,W f )(x) =

y,|y−x|=1(fx − fy)W euy−ux

slide-32
SLIDE 32

connection between RS and VRJP

set Λ ⊂ Zd finite

  • (Zσ)σ≥0 time changed VRJP with jump rate ωij(σ) = W

2

1+Tj(σ)

1+Ti(σ)

Zσ same recurrence/transience properties as Yt

  • Zσ is a mixture of Markov jump processes:

PZ

Λ[·] = Eu[ Pω(u) Λ

[·] ] u ∈ RΛ random vector Pω(u)

Λ

[·] MJP with rate ωij(u) = W

2 euj−ui

  • for fixed u the generator of the MJP is

(Lu,W f )(x) =

y,|y−x|=1(fx − fy)W euy−ux

  • Lu,W = eˆ

uHW (β(u))e−ˆ u with βx(u) = y,|y−x|=1 W 2 euy−ux

dP(u) → dP(β) coordinate change!

slide-33
SLIDE 33

connection between RS and VRJP

additional nice features

1 W = λ ⇒ strong/weak reinforcement ≡ strong/weak disorder

ground state for HW (β) ← → recurrence/transience for VRJP

[Sabot-Zeng 2015]

β short range ⇒ standard fractional moment methods for RS apply

[Collevecchio-Zeng 2018]

still a lot to explore!

slide-34
SLIDE 34

THANK YOU