Random walk on the torus Jean-Baptiste Boyer (IMB / ModalX) May 16, - - PowerPoint PPT Presentation

random walk on the torus
SMART_READER_LITE
LIVE PREVIEW

Random walk on the torus Jean-Baptiste Boyer (IMB / ModalX) May 16, - - PowerPoint PPT Presentation

Random walk on the torus Jean-Baptiste Boyer (IMB / ModalX) May 16, 2016 Jean-Baptiste Boyer (IMB / ModalX) Random walk on the torus May 16, 2016 1 / 18 Products of random matrices 1 Linear random walks on the torus 2 What about the


slide-1
SLIDE 1

Random walk on the torus

Jean-Baptiste Boyer (IMB / Modal’X) May 16, 2016

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 1 / 18

slide-2
SLIDE 2

1

Products of random matrices

2

Linear random walks on the torus

3

What about the variance ?

4

And now ... ?

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 2 / 18

slide-3
SLIDE 3

Let ρ be a borelian probability measure on G := SL2(R) = a b c d

  • ad − bc = 1
  • .

For any x ∈ R2 \ {0} we consider the random walk defined by

  • X0

= x Xn+1 = gn+1Xn where (gn) is an iid sequence of law ρ. As the norm is submultiplicative, it’s logarithm is subadditive and so we expect 1

n ln Xn to converge to something.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 3 / 18

slide-4
SLIDE 4

If the support of ρ is a subset of

  • Eb =

1 b 1

  • b ∈ R
  • then, as

Eb1Eb2 = Eb1+b2 what we have is a random walk on R rather than a random walk on SL2(R).

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 4 / 18

slide-5
SLIDE 5

If the support of ρ is a subset of

  • Eb =

1 b 1

  • b ∈ R
  • then, as

Eb1Eb2 = Eb1+b2 what we have is a random walk on R rather than a random walk on SL2(R). So, we have to make assumptions on suppρ.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 4 / 18

slide-6
SLIDE 6

Definition

We say that a closed subgroup H < G is strongly irreducible if it doesn’t fix any finite union of lines in R2.

Example

a b a−1

  • ,

a a−1 −a−1 a

  • ,

are not strongly irreducible (but the last one is irreducible)

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 5 / 18

slide-7
SLIDE 7

We also don’t want the group to be compact so we make the following

Definition

We say that a closed subgroup H < G is proximal if there is some h ∈ H whose spectral radius r(h) satisfies r(h) > 1.

Remark

This is stronger than asking the group generated by suppρ to be non compact (consider a unipotent matrix)

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 6 / 18

slide-8
SLIDE 8

Example

If ρ = 1

2δA + 1 2δB with

A = 2 1 1 1

  • and B =

1 1 1 2

  • then suppρ generates a strongly irreducible and proximal subgroup : it is

proximal since both matrices are proximal and strongly irreducible since the matrices are diagonalisable and have different eigenvectors.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 7 / 18

slide-9
SLIDE 9

In the sequel, we will note Gρ the closure of the subgroup of G generated by the support of ρ (it is still a group and it is strongly irreducible and proximal if and only if so is the group generated by the support of ρ)

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 8 / 18

slide-10
SLIDE 10

Theorem (Furstenberg-Kesten, . . . )

Let ρ be a borelian probability measure on G such that

  • G | ln g|dρ(g) is

finite and Gρ is strongly irreducible and proximal. Then, there is λ1 > 0 such that lim

n

1 n ln gn . . . g1 = λ1 ρ⊗N-ae. Moreover, for any x ∈ R2 \ {0}, lim

n

1 n ln gn . . . g1x = λ1 ρ⊗N-ae. In particular, the walk on R2 \ {0} is transient.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 9 / 18

slide-11
SLIDE 11

Remark

If we add moment conditions on ρ, we can get the central limit theorem, the law of the iterated logarithm and large deviations inequalities.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 10 / 18

slide-12
SLIDE 12

From now on, we note Γ = SL2(Z). This groups acts on the torus T2 = R2/Z2 and this allows us to define a random walk : we fix a probability measure ρ on SL2(Z), and then, starting at some point x ∈ T2, we consider

  • X0

= x Xn+1 = gn+1Xn where (gn) is an iid sequence of law ρ.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 11 / 18

slide-13
SLIDE 13

From now on, we note Γ = SL2(Z). This groups acts on the torus T2 = R2/Z2 and this allows us to define a random walk : we fix a probability measure ρ on SL2(Z), and then, starting at some point x ∈ T2, we consider

  • X0

= x Xn+1 = gn+1Xn where (gn) is an iid sequence of law ρ. Rational points have a particular behaviour : 0 is fixed. More generally, if we start at p

q ∈ Qd/Zd, then the walk stays in 1 qZd/Zd. So we are just

looking at the random walk on a finite set (and in particular, (Xn) equidistributes in the orbit of x)

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 11 / 18

slide-14
SLIDE 14

What happens if the starting point is irrational ?

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 12 / 18

slide-15
SLIDE 15

What happens if the starting point is irrational ?

Theorem (Bourgain, Furmann, Lindenstrauss and Mozes)

Let ρ be a probability measure on Γ whose support generates a strongly irreducible and proximal subgroup and such that for some ε ∈ R∗

+,

  • γ∈Γ γερ(γ) is finite.

Note ν = Lebesgue’s measure on T2. Then, for any non rational point x ∈ T2 and any continuous function f , 1 n

n−1

  • k=0

f (Xk) − →

  • f dν ρ⊗N-a.e.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 12 / 18

slide-16
SLIDE 16

What about the CLT and the LIL ?

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 13 / 18

slide-17
SLIDE 17

What about the CLT and the LIL ?

Theorem

Same assumptions. For any γ ∈]0, 1] there is β0 ∈ R∗

+ such that for any

B ∈ R∗

+ and any β ∈]0, β0[ we have that for any x ∈ T2 such that

d

  • x, p

q

  • e−Bqβ

has only finitely many solutions p

q ∈ Qd/Zd we have that for any

γ−h¨

  • lder-continuous function f on the torus there is σ2(f ) ∈ R+ such that

1 √n

n−1

  • k=0

f (Xk) −

  • f dν L

− → N(0, σ2(f )) where we noted N(0, 0) the Dirac mass at 0. In particular (with the Jarn´ ık-Besicovitch theorem), the Hausdorff dimension of the set of points where the theorem doesn’t hold is 0.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 13 / 18

slide-18
SLIDE 18

How to prove such a theorem ?

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 14 / 18

slide-19
SLIDE 19

How to prove such a theorem ? We note P the Markov operator associated to the walk : Pf (x) =

  • γ∈Γ

f (γx)ρ(γ) If f = g − Pg with g ∈ C0(T2), then,

n−1

  • k=0

f (Xk) =

n−1

  • k=0

g(Xk+1) − Pg(Xk) + g(X0) − g(Xn) and, Mn = n−1

k=0 g(Xk+1) − Pg(Xk) is a martingale with bounded

increments so we can use the classical CLT.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 14 / 18

slide-20
SLIDE 20

How to prove such a theorem ? We note P the Markov operator associated to the walk : Pf (x) =

  • γ∈Γ

f (γx)ρ(γ) If f = g − Pg with g ∈ C0(T2), then,

n−1

  • k=0

f (Xk) =

n−1

  • k=0

g(Xk+1) − Pg(Xk) + g(X0) − g(Xn) and, Mn = n−1

k=0 g(Xk+1) − Pg(Xk) is a martingale with bounded

increments so we can use the classical CLT. = ⇒ the idea (which is called Gordin’s method) is to solve Poisson’s equation f = g − Pg +

  • f dν.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 14 / 18

slide-21
SLIDE 21

What happens if the variance vanishes ?

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 15 / 18

slide-22
SLIDE 22

What happens if the variance vanishes ? We can prove that g ∈ L2(T2, ν) and that, actually, if f = g − Pg, then the variance is given by σ2(f ) =

  • T2 |g|2 − |Pg|2dν

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 15 / 18

slide-23
SLIDE 23

Moreover, if g is continuous and σ2(f ) = 0, then, for any x ∈ T2 and ρ−a.e. (gn) ∈ ΓN,

n−1

  • k=0

g(Xk+1) − Pg(Xk) = 0 In particular,

n−1

  • k=0

f (Xk) = g(X0) − g(Xn) so, we get that if f = g − Pg with g continuous is such that σ2(f ) = 0, then, for any x ∈ T2,

n−1

  • k=0

f (Xk) is bounded in L∞(Px).

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 16 / 18

slide-24
SLIDE 24

The same works on Td with the same strong-irreducibility and proximality assumptions. If we add translations by diophantine numbers the situation is much more simple since then we don’t have the problem of finite orbits and we can prove that Pnf (x) converges exponentially fast to

  • f dν for

any H¨

  • lder continuous function. In particular, we also have the CLT,

LIL and even a LDP.

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 17 / 18

slide-25
SLIDE 25

Merci de votre attention !

Jean-Baptiste Boyer (IMB / Modal’X) Random walk on the torus May 16, 2016 18 / 18