Convex decay of Entropy for interacting systems

Size: px
Start display at page:

Download "Convex decay of Entropy for interacting systems"

Transcription

1 Convex decay of Entropy for interacting systems Paolo Dai Pra Università degli Studi di Padova Cambridge March 30, 2011 Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 1 / 33

2 Based on: BOUDOU A.S., CAPUTO P., D.P., POSTA G. (2006). Spectral gap estimates for interacting particle systems via a Bochner-type identity. JOURNAL OF FUNCTIONAL ANALYSIS, vol. 232; p CAPUTO P, D.P., POSTA G (2009). Convex Entropy Decay via the Bochner-Bakry-Emery approach. ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, vol. 45; p Some more recent progresses, with G. POSTA. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 2 / 33

3 Convergence to equilibrium Let π be the stationary distribution of an ergodic, continuous-time, Markov chain on a finite or countable set X, with semigroup S t = e tl. Denote by µs t the law at time t of the chain started from the law µ. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 3 / 33

4 Convergence to equilibrium Let π be the stationary distribution of an ergodic, continuous-time, Markov chain on a finite or countable set X, with semigroup S t = e tl. Denote by µs t the law at time t of the chain started from the law µ. Denoting by µ π TV := 1 µ(x) π(x) 2 x S the total variation distance, one of the aims of quantitative ergodic theory is to estimate the rate of convergence of as t +. µs t π TV 0 Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 3 / 33

5 It is usually simpler to obtain rates for other modes of convergence. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 4 / 33

6 It is usually simpler to obtain rates for other modes of convergence. For f : X R set π[f ] := x π(x)f (x). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 4 / 33

7 It is usually simpler to obtain rates for other modes of convergence. For f : X R set π[f ] := x π(x)f (x). L 2 convergence: S t π 2 2 := sup{ S t f π[f ] 2 : f 2 = 1}. where f 2 := π [f 2 ]. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 4 / 33

8 It is usually simpler to obtain rates for other modes of convergence. For f : X R set π[f ] := x π(x)f (x). L 2 convergence: S t π 2 2 := sup{ S t f π[f ] 2 : f 2 = 1}. where f 2 := π [f 2 ]. The following bound holds: letting π := min x π(x), sup δ x S t π TV 1 x S π S t π 2 2. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 4 / 33

9 Convergence in relative entropy: letting h(µ π) := ( ) µ(x) µ(x) [ µ π(x) log = π π(x) π(x) π log µ ]. π x one obtains bounds for sup h(δ x S t π). x S Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 5 / 33

10 Convergence in relative entropy: letting h(µ π) := ( ) µ(x) µ(x) [ µ π(x) log = π π(x) π(x) π log µ ]. π x one obtains bounds for sup h(δ x S t π). x S These bounds are then transferred to total variation by Czisar s inequality: sup x S h(δ x S t π) sup δ x S t π 2 TV x S Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 5 / 33

11 Functional inequalities We are therefore interested in the rate of convergence to zero of quantities as S t π 2 2 and h(δ x S t π). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 6 / 33

12 Functional inequalities We are therefore interested in the rate of convergence to zero of quantities as S t π 2 2 and h(δ x S t π). A key notion is that of Dirichlet form: E(f, g) := π [flg]. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 6 / 33

13 Functional inequalities We are therefore interested in the rate of convergence to zero of quantities as S t π 2 2 and h(δ x S t π). A key notion is that of Dirichlet form: E(f, g) := π [flg]. If the chain is reversible (i.e. π(x)l xy = π(y)l yx ) E(f, g) = 1 π [L xy (f (y) f (x))(g(y) g(x))] 2 y S (true for g = f without reversibility) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 6 / 33

14 Functional inequalities We are therefore interested in the rate of convergence to zero of quantities as S t π 2 2 and h(δ x S t π). A key notion is that of Dirichlet form: E(f, g) := π [flg]. If the chain is reversible (i.e. π(x)l xy = π(y)l yx ) E(f, g) = 1 π [L xy (f (y) f (x))(g(y) g(x))] 2 y S (true for g = f without reversibility) Also let, for f > 0 Ent π (f ) := π[f log f ] π[f ] log π[f ], so that h(µ π) = Ent π (dµ/dπ). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 6 / 33

15 Theorem S t π 2 2 e γt is equivalent to (PI) Var π [f ] := π [ f 2] π 2 [f ] 1 γ E(f, f ) for every f, which is called the Poincaré inequality. The best constant in (PI) is the spectral gap of L+L 2. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 7 / 33

16 Theorem S t π 2 2 e γt is equivalent to (PI) Var π [f ] := π [ f 2] π 2 [f ] 1 γ E(f, f ) for every f, which is called the Poincaré inequality. The best constant in (PI) is the spectral gap of L+L 2. Suppose the chain is reversible. Then h(µs t π) h(µ π)e αt for every initial distribution µ, is equivalent to (MLSI) Ent π (f ) 1 E(f, log f ), α for every f > 0. The inequality above is called the modified logarithmic Sobolev inequality. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 7 / 33

17 In particular (PI) implies max δ xs t π TV 1 x S π e γt. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 8 / 33

18 In particular (PI) implies max δ xs t π TV 1 x S π e γt. while (MLSI) and Czisar s inequality yield max δ xs t π TV x S log ( ) 1 π e αt/2 Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 8 / 33

19 In particular (PI) implies max δ xs t π TV 1 x S π e γt. while (MLSI) and Czisar s inequality yield max δ xs t π TV x S log ( ) 1 π e αt/2 It turns out that α 2γ. Thus the estimate obtained with the (MLSI) could be worse in the exponential rate, but for moderate times could be much better since, for large S, log ( ) 1 π 1 π. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 8 / 33

20 It is customary to deal with a third functional inequality, the logarithmic Sobolev inequality: for all f 0. (LSI) Ent π (f ) 1 s E( f, f ) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 9 / 33

21 It is customary to deal with a third functional inequality, the logarithmic Sobolev inequality: (LSI) Ent π (f ) 1 s E( f, f ) for all f 0. The deepest meaning of this inequality will not be dealt with here. We mention the fact that in the case of diffusion processes, i.e. when L is a second order differential operator, (MLSI) and (LSI) coincide. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 9 / 33

22 Theorem Consider an irreducible, reversible, finite state Markov chain, and let γ, α, s denote the largest constants in (PI), (MLSI) and (LSI) respectively. Then 2γ α 4s > 0 Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 10 / 33

23 Theorem Consider an irreducible, reversible, finite state Markov chain, and let γ, α, s denote the largest constants in (PI), (MLSI) and (LSI) respectively. Then 2γ α 4s > 0 For Markov chains with infinite state space the inequalities between the best constants still hold, but the constants may be zero. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 10 / 33

24 Main approaches to functional inequalities for Markov Chains Path (geometric) methods (Saloff-Coste, Roberto,...) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 11 / 33

25 Main approaches to functional inequalities for Markov Chains Path (geometric) methods (Saloff-Coste, Roberto,...) Easy to use to get rough bounds. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 11 / 33

26 Main approaches to functional inequalities for Markov Chains Path (geometric) methods (Saloff-Coste, Roberto,...) Easy to use to get rough bounds. Sometimes hard to get the right scaling of the constants in terms of the parameters of the model. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 11 / 33

27 Main approaches to functional inequalities for Markov Chains Path (geometric) methods (Saloff-Coste, Roberto,...) Easy to use to get rough bounds. Sometimes hard to get the right scaling of the constants in terms of the parameters of the model. For model with a spatial structure, one relates functional inequalities to spatial mixing properties (Stroock, Zegarlinski, Yau, Martinelli, Olivieri,...) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 11 / 33

28 Main approaches to functional inequalities for Markov Chains Path (geometric) methods (Saloff-Coste, Roberto,...) Easy to use to get rough bounds. Sometimes hard to get the right scaling of the constants in terms of the parameters of the model. For model with a spatial structure, one relates functional inequalities to spatial mixing properties (Stroock, Zegarlinski, Yau, Martinelli, Olivieri,...) Quite powerful but spatial mixing can be hard to prove. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 11 / 33

29 Main approaches to functional inequalities for Markov Chains Path (geometric) methods (Saloff-Coste, Roberto,...) Easy to use to get rough bounds. Sometimes hard to get the right scaling of the constants in terms of the parameters of the model. For model with a spatial structure, one relates functional inequalities to spatial mixing properties (Stroock, Zegarlinski, Yau, Martinelli, Olivieri,...) Quite powerful but spatial mixing can be hard to prove. Applications to inhomogeneous models may be problematic. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 11 / 33

30 Main approaches to functional inequalities for Markov Chains Path (geometric) methods (Saloff-Coste, Roberto,...) Easy to use to get rough bounds. Sometimes hard to get the right scaling of the constants in terms of the parameters of the model. For model with a spatial structure, one relates functional inequalities to spatial mixing properties (Stroock, Zegarlinski, Yau, Martinelli, Olivieri,...) Quite powerful but spatial mixing can be hard to prove. Applications to inhomogeneous models may be problematic. Lyapunov function methods (Cattiaux, Guillin). Natural approach, but effectiveness on models with spatial structure is still unclear (to me) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 11 / 33

31 The Bochner-Bakry-Emery approach to PI and MLSI In this section we assume reversibility of L. We recall that the proof that the rate of L 2 convergence to equilibrium is the best constant in (PI) is based on d dt Var π(s t f ) = 2E(S t f, S t f ). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 12 / 33

32 The Bochner-Bakry-Emery approach to PI and MLSI In this section we assume reversibility of L. We recall that the proof that the rate of L 2 convergence to equilibrium is the best constant in (PI) is based on d dt Var π(s t f ) = 2E(S t f, S t f ). Taking one more derivative we get d 2 dt 2 Var π(s t f ) = 2 d dt E(S tf, S t f ) = 4π [ (LS t f ) 2]. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 12 / 33

33 The Bochner-Bakry-Emery approach to PI and MLSI In this section we assume reversibility of L. We recall that the proof that the rate of L 2 convergence to equilibrium is the best constant in (PI) is based on d dt Var π(s t f ) = 2E(S t f, S t f ). Taking one more derivative we get d 2 dt 2 Var π(s t f ) = 2 d dt E(S tf, S t f ) = 4π [ (LS t f ) 2]. Suppose now k > 0 such that for every f E(f, f ) 1 k π [ (Lf ) 2]. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 12 / 33

34 The Bochner-Bakry-Emery approach to PI and MLSI In this section we assume reversibility of L. We recall that the proof that the rate of L 2 convergence to equilibrium is the best constant in (PI) is based on d dt Var π(s t f ) = 2E(S t f, S t f ). Taking one more derivative we get d 2 dt 2 Var π(s t f ) = 2 d dt E(S tf, S t f ) = 4π [ (LS t f ) 2]. Suppose now k > 0 such that for every f E(f, f ) 1 k π [ (Lf ) 2]. We get d dt E(S tf, S t f ) 2kE(S t f, S t f ) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 12 / 33

35 In particular E(S t f, S t f ) 0 as t +. Rewriting the last inequality as d dt E(S tf, S t f ) k d dt Var π(s t f ) and integrating from t to + we get E(f, f ) kvar π (f ) k γ! Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 13 / 33

36 In particular E(S t f, S t f ) 0 as t +. Rewriting the last inequality as d dt E(S tf, S t f ) k d dt Var π(s t f ) and integrating from t to + we get E(f, f ) kvar π (f ) k γ! By a bit of spectral Theory it can be shown that the best constant k in (PI ) E(f, f ) 1 k π [ (Lf ) 2] is equal to the spectral gap γ. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 13 / 33

37 The same argument can be implemented with he entropy replacing the variance. We obtain, for f > 0 d 2 dt 2 Ent π(s t f ) = d dt E(S tf, log S t f ) [ (LSt f ) 2 ] = π [LS t fl log S t f ] + π S t f Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 14 / 33

38 The same argument can be implemented with he entropy replacing the variance. We obtain, for f > 0 d 2 dt 2 Ent π(s t f ) = d dt E(S tf, log S t f ) [ (LSt f ) 2 ] = π [LS t fl log S t f ] + π S t f We therefore have that the inequality [ ] (Lf ) (MLSI 2 ) ke(f, log f ) π [LfL log f ] + π f for every f > 0, implies the (MLSI) kent π (f ) E(f, log f ). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 14 / 33

39 The same argument can be implemented with he entropy replacing the variance. We obtain, for f > 0 d 2 dt 2 Ent π(s t f ) = d dt E(S tf, log S t f ) [ (LSt f ) 2 ] = π [LS t fl log S t f ] + π S t f We therefore have that the inequality [ ] (Lf ) (MLSI 2 ) ke(f, log f ) π [LfL log f ] + π f for every f > 0, implies the (MLSI) kent π (f ) E(f, log f ). This time the converse is not necessarily true: the entropy may decay exponentially fast, but not necessarily in a convex way. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 14 / 33

40 In order to understand how useful the above inequalities are, we write generators of Markov chains in the following form: Lf (x) = γ G c(x, γ)[f (γ(x)) f (x)] =: γ G c(x, γ) γ f (x) where G is some set of functions from X to X (allowed movements). It is clear that every countable Markov chain can be written in this way. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 15 / 33

41 In order to understand how useful the above inequalities are, we write generators of Markov chains in the following form: Lf (x) = γ G c(x, γ)[f (γ(x)) f (x)] =: γ G c(x, γ) γ f (x) where G is some set of functions from X to X (allowed movements). It is clear that every countable Markov chain can be written in this way. For L to be reversible w.r.t. a probability π we need (Rev) For every γ G there exists γ 1 G such that γ 1 γ(x) = x for every x X such that c(x, γ) > 0. Moreover π(x)c(x, γ) = π(γ(x))c(γ(x), γ 1 ) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 15 / 33

42 The inequalities (PI ) and (MLSI ) become, respectively π 4 X c(x, γ) γf (x) γf (x) 5 1 k π 4 X c(x, γ)c(x, δ) γf (x) δ f (x) 5 γ G γ,δ G and π 4 X c(x, γ) γf (x) γ log f (x) 5 γ G 2 1 k π 4 X c(x, γ)c(x, δ) γf (x) δ log f (x) + γf (x) «3 δf (x) 5 f (x) γ,δ Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 16 / 33

43 The quadratic form π c(x, γ)c(x, δ) γ f (x) δ f (x) γ,δ G can be modified as follows. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 17 / 33

44 The quadratic form π c(x, γ)c(x, δ) γ f (x) δ f (x) γ,δ G can be modified as follows. To fix ideas, set π(x) = 1 Z e H(x), c(x, γ) = exp[ γ H(x)/2], and assume γ δ = δ γ for every γ, δ. Then one shows that, for every f π c(x, γ)c(γ(x), δ) γ f (x) δ f (x) γ,δ G = 1 4 π c(x, γ)c(γ(x), δ) ( γ δ f (x)) 2 0. γ,δ G Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 17 / 33

45 Thus π 4 X c(x, γ) γf (x) γf (x) 5 γ G k π 4 X (c(x, γ)c(x, δ) c(x, γ)c(γ(x), δ)) γf (x) δ f (x) 5 γ,δ G is stronger than (PI ). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 18 / 33

46 Thus π 4 X c(x, γ) γf (x) γf (x) 5 γ G k π 4 X (c(x, γ)c(x, δ) c(x, γ)c(γ(x), δ)) γf (x) δ f (x) 5 γ,δ G is stronger than (PI ). This may be useful if c(x, γ)c(x, δ) c(x, γ)c(γ(x), δ) for many pairs (γ, δ). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 18 / 33

47 Theorem Let R : S G G [0, + ) be such that for each x, γ, δ with R(x, γ, δ) > 0 we have P1 : R(x, γ, δ) = R(x, δ, γ) P2 : π(x)r(x, γ, δ) = π(γ(x))r(γ(x), γ 1, δ) P3 : γδ(x) = δγ(x) Set Γ R (x, γ, δ) := c(x, γ)c(x, δ) R(x, γ, δ). Then we have 2 3 h π (Lf ) 2i = π 4 X c(x, γ)c(x, δ) γf (x) δ f (x) 5 γ,δ G 2 3 π 4 X Γ R (x, γ, δ) γf (x) δ f (x) 5 γ,δ G Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 19 / 33

48 The result above follows from the identity: π c(x, γ)c(x, δ) γ f (x) δ f (x) γ,δ G = π Γ R (x, γ, δ) γ f (x) δ f (x) γ,δ G + π Γ R (x, γ, δ) ( γ δ f (x)) 2 γ,δ G which is reminiscent of Bochner s identities. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 20 / 33

49 Similarly Theorem» (Lf ) 2 π [LfL log f ] + π f 2 = π 4 X c(x, γ)c(x, δ) γ,δ 2 π 4 X γ,δ γf (x) δ log f (x) + γf (x) «3 δf (x) 5 f (x) Γ R (x, γ, δ) γf (x) δ log f (x) + γf (x) «3 δf (x) 5 f (x) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 21 / 33

50 Summing up: π Γ R (x, γ, δ) γ f (x) δ f (x) ke(f, f ) γ,δ G Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 22 / 33

51 Summing up: π Γ R (x, γ, δ) γ f (x) δ f (x) ke(f, f ) and π γ,δ γ,δ G ( Γ R (x, γ, δ) γ f (x) δ log f (x) + ) γf (x) δ f (x) f (x) for every f > 0, imply (PI) and (MLSI ), respectively. ke(f, logf ) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 22 / 33

52 Glauber dynamics for unbounded particles Let Λ Z d, K, λ : Z d [0, + ) with K(0) = 0, K(x) < + λ := sup λ(x) < +. x Z d x Z d Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 23 / 33

53 Glauber dynamics for unbounded particles Let Λ Z d, K, λ : Z d [0, + ) with K(0) = 0, K(x) < + λ := sup λ(x) < +. x Z d x Z d X := N Λ. So, for η X, η x = number of particles at x Λ. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 23 / 33

54 Glauber dynamics for unbounded particles Let Λ Z d, K, λ : Z d [0, + ) with K(0) = 0, K(x) < + λ := sup λ(x) < +. x Z d x Z d X := N Λ. So, for η X, η x = number of particles at x Λ. π(η) := 1 λ(x) ηx exp β Z η x! x Λ {x,y} Λ K(x y)η x η y, Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 23 / 33

55 Glauber dynamics for unbounded particles Let Λ Z d, K, λ : Z d [0, + ) with K(0) = 0, K(x) < + λ := sup λ(x) < +. x Z d x Z d X := N Λ. So, for η X, η x = number of particles at x Λ. π(η) := 1 λ(x) ηx exp β Z η x! x Λ γ + x = creation of a particle at x. γ x = deletion of a particle at x. {x,y} Λ K(x y)η x η y, Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 23 / 33

56 Glauber dynamics for unbounded particles Let Λ Z d, K, λ : Z d [0, + ) with K(0) = 0, K(x) < + λ := sup λ(x) < +. x Z d x Z d X := N Λ. So, for η X, η x = number of particles at x Λ. π(η) := 1 λ(x) ηx exp β Z η x! x Λ γ + x = creation of a particle at x. γ x = deletion of a particle at x. {x,y} Λ K(x y)η x η y, c(η, γ x ) := η x c(η, γ x + ) := λ(x) exp β K(x y)η y y Λ Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 23 / 33

57 Choose R(η, γ x +, γ y + ) = c(η, γ y + )c(γ x + (η), γ y + ) R(η, γx, γy ) = c(η, γy )c(γx (η), γy ) R(η, γx, γ y + ) = c(η, γx )c(η, γ y + ) and write ± x for γ ± x. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 24 / 33

58 We get 2 3 h π (Lf ) 2i π 4 X Γ R (η, γ, δ) γf (η) δ f (η) 5 = X π hη x ` i x f (η) 2 γ,δ x Λ + X π ˆc(η, γ x + )c(η, γ y + ) (1 exp[ βk(x y)]) + x f (η) + y f (η) x,y Λ = E(f, f ) +... Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 25 / 33

59 We get 2 3 h π (Lf ) 2i π 4 X Γ R (η, γ, δ) γf (η) δ f (η) 5 = X π hη x ` i x f (η) 2 γ,δ x Λ + X π ˆc(η, γ x + )c(η, γ y + ) (1 exp[ βk(x y)]) + x f (η) + y f (η) x,y Λ = E(f, f ) +... Using: c(η, γ y + ) λ, 2 + x f (η) + y f (η) [ + x f (η)] 2 [ + y f (η) ] 2 we obtain Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 25 / 33

60 We get 2 3 h π (Lf ) 2i π 4 X Γ R (η, γ, δ) γf (η) δ f (η) 5 = X π hη x ` i x f (η) 2 γ,δ x Λ + X π ˆc(η, γ x + )c(η, γ y + ) (1 exp[ βk(x y)]) + x f (η) + y f (η) x,y Λ = E(f, f ) +... Using: c(η, γ y + ) λ, 2 + x f (η) + y f (η) [ + x f (η)] 2 [ + y f (η) ] 2 we obtain π [ (Lf ) 2] [1 λε(β)]e(f, f ) with ε(β) := (1 exp[ βk(x)]). x Z d Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 25 / 33

61 This proves (PI) with γ = 1 λε(β), reproving results by Bertini, Cancrini, Cesi (2002), Kondratiev & Lytvynov (2005). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 26 / 33

62 This proves (PI) with γ = 1 λε(β), reproving results by Bertini, Cancrini, Cesi (2002), Kondratiev & Lytvynov (2005). STRONGER INEQUALITIES? Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 26 / 33

63 This proves (PI) with γ = 1 λε(β), reproving results by Bertini, Cancrini, Cesi (2002), Kondratiev & Lytvynov (2005). STRONGER INEQUALITIES? (LSI) is known to fail Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 26 / 33

64 One key step was to bound the non-diagonal terms π [ c(η, γ + x )c(η, γ + y ) (1 exp[ βk(x y)]) + x f (η) + y f (η) ] using 2 + x f (η) + y f (η) [ + x f (η)] 2 [ + y f (η) ] 2. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 27 / 33

65 One key step was to bound the non-diagonal terms π [ c(η, γ + x )c(η, γ + y ) (1 exp[ βk(x y)]) + x f (η) + y f (η) ] using 2 + x f (η) + y f (η) [ + x f (η)] 2 [ + y f (η) ] 2. This is an instance of the following bound: for a symmetric matrix A = (A ij ), A D with D diagonal and d ii = a ii j i a ij. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 27 / 33

66 For the (MLSI ) we get» (Lf ) 2 π [LfL log f ] + π f 2 π 4 X Γ R (x, γ, δ) γf (x) δ log f (x) + γf (x) «3 δf (x) 5 f (x) γ,δ = E(f, log f ) + X " # π η(x) ( x f (η)) 2 f (η) x Λ + X " π c(η, γ x + )c(η, γ+ y ) 1 e βk(x y) + x f (η) + y log f (η) + + x f (η) + y f (η)!# f (η) x,y Λ Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 28 / 33

67 The role of 2ab a 2 b 2 is now played by the following inequality: Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 29 / 33

68 The role of 2ab a 2 b 2 is now played by the following inequality: (a 1) log b + (b 1) log a + 2(a 1)(b 1) (a 1)2 (b 1)2 [(a 1) log a + (b 1) log b] a b Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 29 / 33

69 The role of 2ab a 2 b 2 is now played by the following inequality: (a 1) log b + (b 1) log a + 2(a 1)(b 1) (a 1)2 (b 1)2 [(a 1) log a + (b 1) log b] a b which yields + x f (η) + y log f (η) + + y f (η) + x log f (η) x f (η) + y f (η) f (η) ` + x f (η) 2 ` + f (η + δ y f (η) 2 x) f (η + δ y ) + x f (η) + x log f (η) + y f (η) + y log f (η) Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 29 / 33

70 from which we obtain [ ] (Lf ) 2 π [LfL log f ] + π f [ [1 ε(β)] E(f, log f ) + π [η(x) ( x f (η)) 2 ] ] f (η) x Λ which means Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 30 / 33

71 from which we obtain [ ] (Lf ) 2 π [LfL log f ] + π f [ [1 ε(β)] E(f, log f ) + π [η(x) ( x f (η)) 2 ] ] f (η) x Λ which means Theorem Assuming λε(β) < 1, (MLSI ) holds with constant [1 λε(β)]. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 30 / 33

72 Some concluding remarks For the spectral gap, the methods used for bounding from below a quadratic form is very naive. Better estimates could be obtained by estimating the spectral radius of the form. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 31 / 33

73 Some concluding remarks For the spectral gap, the methods used for bounding from below a quadratic form is very naive. Better estimates could be obtained by estimating the spectral radius of the form. We worked out some examples where the naive estimates are not good enough. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 31 / 33

74 Some concluding remarks For the spectral gap, the methods used for bounding from below a quadratic form is very naive. Better estimates could be obtained by estimating the spectral radius of the form. We worked out some examples where the naive estimates are not good enough. E.g. the Loss Networks representation of Peierls contours (Fernandez, Ferrari, Garcia, 2001). This is a birth & death dynamics on Peierls contours, having the Ising model as invariant measure. We can give a uniform lower bound of the gap under the same low temperature condition as in [FFG]. Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 31 / 33

75 Some concluding remarks However, global, non-diagonal bounds are not yet available for (MLSI ). Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 32 / 33

76 THANKS! Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 33 / 33

Functional inequalities for Markov Chains and applications

Functional inequalities for Markov Chains and applications Functional inequalities for Markov Chains and applications Paolo Dai Pra Università di Padova Potsdam March 5-9, 2007 Fruehlingsschule Outline Functional inequalities in the context of Markov Chains may

More information

curvature, mixing, and entropic interpolation Simons Feb-2016 and CSE 599s Lecture 13

curvature, mixing, and entropic interpolation Simons Feb-2016 and CSE 599s Lecture 13 curvature, mixing, and entropic interpolation Simons Feb-2016 and CSE 599s Lecture 13 James R. Lee University of Washington Joint with Ronen Eldan (Weizmann) and Joseph Lehec (Paris-Dauphine) Markov chain

More information

Capacitary inequalities in discrete setting and application to metastable Markov chains. André Schlichting

Capacitary inequalities in discrete setting and application to metastable Markov chains. André Schlichting Capacitary inequalities in discrete setting and application to metastable Markov chains André Schlichting Institute for Applied Mathematics, University of Bonn joint work with M. Slowik (TU Berlin) 12

More information

Modern Discrete Probability Spectral Techniques

Modern Discrete Probability Spectral Techniques Modern Discrete Probability VI - Spectral Techniques Background Sébastien Roch UW Madison Mathematics December 22, 2014 1 Review 2 3 4 Mixing time I Theorem (Convergence to stationarity) Consider a finite

More information

Convergence to equilibrium of Markov processes (eventually piecewise deterministic)

Convergence to equilibrium of Markov processes (eventually piecewise deterministic) Convergence to equilibrium of Markov processes (eventually piecewise deterministic) A. Guillin Université Blaise Pascal and IUF Rennes joint works with D. Bakry, F. Barthe, F. Bolley, P. Cattiaux, R. Douc,

More information

Logarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance

Logarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance Logarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance Katalin Marton Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences Relative entropy

More information

Intertwinings for Markov processes

Intertwinings for Markov processes Intertwinings for Markov processes Aldéric Joulin - University of Toulouse Joint work with : Michel Bonnefont - Univ. Bordeaux Workshop 2 Piecewise Deterministic Markov Processes ennes - May 15-17, 2013

More information

Speeding up Convergence to Equilibrium for Diffusion Processes

Speeding up Convergence to Equilibrium for Diffusion Processes Speeding up Convergence to Equilibrium for Diffusion Processes G.A. Pavliotis Department of Mathematics Imperial College London Joint Work with T. Lelievre(CERMICS), F. Nier (CERMICS), M. Ottobre (Warwick),

More information

Stein s method, logarithmic Sobolev and transport inequalities

Stein s method, logarithmic Sobolev and transport inequalities Stein s method, logarithmic Sobolev and transport inequalities M. Ledoux University of Toulouse, France and Institut Universitaire de France Stein s method, logarithmic Sobolev and transport inequalities

More information

Ricci curvature and geometric analysis on Graphs

Ricci curvature and geometric analysis on Graphs Ricci curvature and geometric analysis on Graphs Yong Lin Renmin University of China July 9, 2014 Ricci curvature on graphs 1 Let G = (V, E) be a graph, where V is a vertices set and E is the set of edges.

More information

215 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that

215 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that 15 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that µ ν tv = (1/) x S µ(x) ν(x) = x S(µ(x) ν(x)) + where a + = max(a, 0). Show that

More information

Convergence to equilibrium for rough differential equations

Convergence to equilibrium for rough differential equations Convergence to equilibrium for rough differential equations Samy Tindel Purdue University Barcelona GSE Summer Forum 2017 Joint work with Aurélien Deya (Nancy) and Fabien Panloup (Angers) Samy T. (Purdue)

More information

XVI International Congress on Mathematical Physics

XVI International Congress on Mathematical Physics Aug 2009 XVI International Congress on Mathematical Physics Underlying geometry: finite graph G=(V,E ). Set of possible configurations: V (assignments of +/- spins to the vertices). Probability of a configuration

More information

Oberwolfach workshop on Combinatorics and Probability

Oberwolfach workshop on Combinatorics and Probability Apr 2009 Oberwolfach workshop on Combinatorics and Probability 1 Describes a sharp transition in the convergence of finite ergodic Markov chains to stationarity. Steady convergence it takes a while to

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear

More information

Discrete Ricci curvature: Open problems

Discrete Ricci curvature: Open problems Discrete Ricci curvature: Open problems Yann Ollivier, May 2008 Abstract This document lists some open problems related to the notion of discrete Ricci curvature defined in [Oll09, Oll07]. Do not hesitate

More information

A Lévy-Fokker-Planck equation: entropies and convergence to equilibrium

A Lévy-Fokker-Planck equation: entropies and convergence to equilibrium 1/ 22 A Lévy-Fokker-Planck equation: entropies and convergence to equilibrium I. Gentil CEREMADE, Université Paris-Dauphine International Conference on stochastic Analysis and Applications Hammamet, Tunisia,

More information

Metastability for continuum interacting particle systems

Metastability for continuum interacting particle systems Metastability for continuum interacting particle systems Sabine Jansen Ruhr-Universität Bochum joint work with Frank den Hollander (Leiden University) Sixth Workshop on Random Dynamical Systems Bielefeld,

More information

A Spectral Gap for the Brownian Bridge measure on hyperbolic spaces

A Spectral Gap for the Brownian Bridge measure on hyperbolic spaces 1 A Spectral Gap for the Brownian Bridge measure on hyperbolic spaces X. Chen, X.-M. Li, and B. Wu Mathemtics Institute, University of Warwick,Coventry CV4 7AL, U.K. 1. Introduction Let N be a finite or

More information

Heat Flows, Geometric and Functional Inequalities

Heat Flows, Geometric and Functional Inequalities Heat Flows, Geometric and Functional Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France heat flow and semigroup interpolations Duhamel formula (19th century) pde, probability, dynamics

More information

Class 2 & 3 Overfitting & Regularization

Class 2 & 3 Overfitting & Regularization Class 2 & 3 Overfitting & Regularization Carlo Ciliberto Department of Computer Science, UCL October 18, 2017 Last Class The goal of Statistical Learning Theory is to find a good estimator f n : X Y, approximating

More information

Characterization of cutoff for reversible Markov chains

Characterization of cutoff for reversible Markov chains Characterization of cutoff for reversible Markov chains Yuval Peres Joint work with Riddhi Basu and Jonathan Hermon 23 Feb 2015 Joint work with Riddhi Basu and Jonathan Hermon Characterization of cutoff

More information

Convergence exponentielle uniforme vers la distribution quasi-stationnaire de processus de Markov absorbés

Convergence exponentielle uniforme vers la distribution quasi-stationnaire de processus de Markov absorbés Convergence exponentielle uniforme vers la distribution quasi-stationnaire de processus de Markov absorbés Nicolas Champagnat, Denis Villemonais Séminaire commun LJK Institut Fourier, Méthodes probabilistes

More information

Lecture 4: Convex Functions, Part I February 1

Lecture 4: Convex Functions, Part I February 1 IE 521: Convex Optimization Instructor: Niao He Lecture 4: Convex Functions, Part I February 1 Spring 2017, UIUC Scribe: Shuanglong Wang Courtesy warning: These notes do not necessarily cover everything

More information

Logarithmic Sobolev Inequalities

Logarithmic Sobolev Inequalities Logarithmic Sobolev Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France logarithmic Sobolev inequalities what they are, some history analytic, geometric, optimal transportation proofs

More information

Entropy for zero-temperature limits of Gibbs-equilibrium states for countable-alphabet subshifts of finite type

Entropy for zero-temperature limits of Gibbs-equilibrium states for countable-alphabet subshifts of finite type Entropy for zero-temperature limits of Gibbs-equilibrium states for countable-alphabet subshifts of finite type I. D. Morris August 22, 2006 Abstract Let Σ A be a finitely primitive subshift of finite

More information

CUTOFF FOR THE ISING MODEL ON THE LATTICE

CUTOFF FOR THE ISING MODEL ON THE LATTICE CUTOFF FOR THE ISING MODEL ON THE LATTICE EYAL LUBETZKY AND ALLAN SLY Abstract. Introduced in 1963, Glauber dynamics is one of the most practiced and extensively studied methods for sampling the Ising

More information

Concentration of Measure: Logarithmic Sobolev Inequalities

Concentration of Measure: Logarithmic Sobolev Inequalities Concentration o Measure: Logarithmic Sobolev Inequalities Aukosh Jagannath September 15, 13 Abstract In this note we'll describe the basic tools to understand Log Sobolev Inequalities and their relation

More information

POINCARÉ, MODIFIED LOGARITHMIC SOBOLEV AND ISOPERIMETRIC INEQUALITIES FOR MARKOV CHAINS WITH NON-NEGATIVE RICCI CURVATURE

POINCARÉ, MODIFIED LOGARITHMIC SOBOLEV AND ISOPERIMETRIC INEQUALITIES FOR MARKOV CHAINS WITH NON-NEGATIVE RICCI CURVATURE POINCARÉ, MODIFIED LOGARITHMIC SOBOLEV AND ISOPERIMETRIC INEQUALITIES FOR MARKOV CHAINS WITH NON-NEGATIVE RICCI CURVATURE MATTHIAS ERBAR AND MAX FATHI Abstract. We study functional inequalities for Markov

More information

arxiv: v2 [math.dg] 18 Nov 2016

arxiv: v2 [math.dg] 18 Nov 2016 BARY-ÉMERY CURVATURE AND DIAMETER BOUNDS ON GRAPHS SHIPING LIU, FLORENTIN MÜNCH, AND NORBERT PEYERIMHOFF arxiv:168.7778v [math.dg] 18 Nov 16 Abstract. We prove diameter bounds for graphs having a positive

More information

2. The averaging process

2. The averaging process 2. The averaging process David Aldous July 10, 2012 The two models in lecture 1 has only rather trivial interaction. In this lecture I discuss a simple FMIE process with less trivial interaction. It is

More information

PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION)

PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION) PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION) EMMANUEL BREUILLARD 1. Lecture 1, Spectral gaps for infinite groups and non-amenability The final aim of

More information

Reverse Hyper Contractive Inequalities: What? Why?? When??? How????

Reverse Hyper Contractive Inequalities: What? Why?? When??? How???? Reverse Hyper Contractive Inequalities: What? Why?? When??? How???? UC Berkeley Warsaw Cambridge May 21, 2012 Hyper-Contractive Inequalities The noise (Bonami-Beckner) semi-group on { 1, 1} n 1 2 Def 1:

More information

Invariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011

Invariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011 Invariances in spectral estimates Franck Barthe Dario Cordero-Erausquin Paris-Est Marne-la-Vallée, January 2011 Notation Notation Given a probability measure ν on some Euclidean space, the Poincaré constant

More information

SMSTC (2007/08) Probability.

SMSTC (2007/08) Probability. SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................

More information

Logarithmic Harnack inequalities

Logarithmic Harnack inequalities Logarithmic Harnack inequalities F. R. K. Chung University of Pennsylvania Philadelphia, Pennsylvania 19104 S.-T. Yau Harvard University Cambridge, assachusetts 02138 1 Introduction We consider the relationship

More information

An example of application of discrete Hardy s inequalities

An example of application of discrete Hardy s inequalities An example of application of discrete Hardy s inequalities Laurent Miclo Laboratoire de Statistique et Probabilités, UMR C5583 Université PaulSabatieretCNRS 8, route de Narbonne 3062 Toulouse cedex, France

More information

Math 576: Quantitative Risk Management

Math 576: Quantitative Risk Management Math 576: Quantitative Risk Management Haijun Li lih@math.wsu.edu Department of Mathematics Washington State University Week 11 Haijun Li Math 576: Quantitative Risk Management Week 11 1 / 21 Outline 1

More information

Convergence exponentielle uniforme vers la distribution quasi-stationnaire en dynamique des populations

Convergence exponentielle uniforme vers la distribution quasi-stationnaire en dynamique des populations Convergence exponentielle uniforme vers la distribution quasi-stationnaire en dynamique des populations Nicolas Champagnat, Denis Villemonais Colloque Franco-Maghrébin d Analyse Stochastique, Nice, 25/11/2015

More information

Exercises with solutions (Set D)

Exercises 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 information

Tail inequalities for additive functionals and empirical processes of. Markov chains

Tail inequalities for additive functionals and empirical processes of. Markov chains Tail inequalities for additive functionals and empirical processes of geometrically ergodic Markov chains University of Warsaw Banff, June 2009 Geometric ergodicity Definition A Markov chain X = (X n )

More information

PROOF OF ZADOR-GERSHO THEOREM

PROOF OF ZADOR-GERSHO THEOREM ZADOR-GERSHO THEOREM FOR VARIABLE-RATE VQ For a stationary source and large R, the least distortion of k-dim'l VQ with nth-order entropy coding and rate R or less is δ(k,n,r) m k * σ 2 η kn 2-2R = Z(k,n,R)

More information

Lecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.

Lecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution. Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution

More information

NEW FUNCTIONAL INEQUALITIES

NEW FUNCTIONAL INEQUALITIES 1 / 29 NEW FUNCTIONAL INEQUALITIES VIA STEIN S METHOD Giovanni Peccati (Luxembourg University) IMA, Minneapolis: April 28, 2015 2 / 29 INTRODUCTION Based on two joint works: (1) Nourdin, Peccati and Swan

More information

Uniqueness of Fokker-Planck equations for spin lattice systems (I): compact case

Uniqueness of Fokker-Planck equations for spin lattice systems (I): compact case Semigroup Forum (213) 86:583 591 DOI 1.17/s233-12-945-y RESEARCH ARTICLE Uniqueness of Fokker-Planck equations for spin lattice systems (I): compact case Ludovic Dan Lemle Ran Wang Liming Wu Received:

More information

Lecture 9: Counting Matchings

Lecture 9: Counting Matchings Counting and Sampling Fall 207 Lecture 9: Counting Matchings Lecturer: Shayan Oveis Gharan October 20 Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publications.

More information

G(t) := i. G(t) = 1 + e λut (1) u=2

G(t) := i. G(t) = 1 + e λut (1) u=2 Note: a conjectured compactification of some finite reversible MCs There are two established theories which concern different aspects of the behavior of finite state Markov chains as the size of the state

More information

KLS-TYPE ISOPERIMETRIC BOUNDS FOR LOG-CONCAVE PROBABILITY MEASURES. December, 2014

KLS-TYPE ISOPERIMETRIC BOUNDS FOR LOG-CONCAVE PROBABILITY MEASURES. December, 2014 KLS-TYPE ISOPERIMETRIC BOUNDS FOR LOG-CONCAVE PROBABILITY MEASURES Sergey G. Bobkov and Dario Cordero-Erausquin December, 04 Abstract The paper considers geometric lower bounds on the isoperimetric constant

More information

HYPERCONTRACTIVITY FOR PERTURBED DIFFUSION SEMIGROUPS. Ecole Polytechnique and Université Paris X

HYPERCONTRACTIVITY FOR PERTURBED DIFFUSION SEMIGROUPS. Ecole Polytechnique and Université Paris X HYPERCONTRACTIVITY FOR PERTURBED DIFFUSION SEMIGROUPS. PATRICK CATTIAUX Ecole Polytechnique and Université Paris X Abstract. µ being a nonnegative measure satisfying some Log-Sobolev inequality, we give

More information

TOTAL VARIATION CUTOFF IN BIRTH-AND-DEATH CHAINS

TOTAL VARIATION CUTOFF IN BIRTH-AND-DEATH CHAINS TOTAL VARIATION CUTOFF IN BIRTH-AND-DEATH CHAINS JIAN DING, EYAL LUBETZKY AND YUVAL PERES ABSTRACT. The cutoff phenomenon describes a case where a Markov chain exhibits a sharp transition in its convergence

More information

Statistics 150: Spring 2007

Statistics 150: Spring 2007 Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities

More information

Ergodic 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. 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 information

A Proof of Aldous Spectral Gap Conjecture. Thomas M. Liggett, UCLA. Stirring Processes

A Proof of Aldous Spectral Gap Conjecture. Thomas M. Liggett, UCLA. Stirring Processes A Proof of Aldous Spectral Gap Conjecture Thomas M. Liggett, UCLA Stirring Processes Given a graph G = (V, E), associate with each edge e E a Poisson process Π e with rate c e 0. Labels are put on the

More information

Convex Functions. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)

Convex Functions. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST) Convex Functions Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Definition convex function Examples

More information

Birth-death chain models (countable state)

Birth-death chain models (countable state) Countable State Birth-Death Chains and Branching Processes Tuesday, March 25, 2014 1:59 PM Homework 3 posted, due Friday, April 18. Birth-death chain models (countable state) S = We'll characterize the

More information

Nonlinear Systems Theory

Nonlinear Systems Theory Nonlinear Systems Theory Matthew M. Peet Arizona State University Lecture 2: Nonlinear Systems Theory Overview Our next goal is to extend LMI s and optimization to nonlinear systems analysis. Today we

More information

A lecture on the averaging process

A lecture on the averaging process Probability Surveys Vol. 0 (0) ISSN: 1549-5787 A lecture on the averaging process David Aldous Department of Statistics, 367 Evans Hall # 3860, U.C. Berkeley CA 9470 e-mail: aldous@stat.berkeley.edu url:

More information

SPECTRAL GAP FOR ZERO-RANGE DYNAMICS. By C. Landim, S. Sethuraman and S. Varadhan 1 IMPA and CNRS, Courant Institute and Courant Institute

SPECTRAL GAP FOR ZERO-RANGE DYNAMICS. By C. Landim, S. Sethuraman and S. Varadhan 1 IMPA and CNRS, Courant Institute and Courant Institute The Annals of Probability 996, Vol. 24, No. 4, 87 902 SPECTRAL GAP FOR ZERO-RANGE DYNAMICS By C. Landim, S. Sethuraman and S. Varadhan IMPA and CNRS, Courant Institute and Courant Institute We give a lower

More information

Minicourse on: Markov Chain Monte Carlo: Simulation Techniques in Statistics

Minicourse on: Markov Chain Monte Carlo: Simulation Techniques in Statistics Minicourse on: Markov Chain Monte Carlo: Simulation Techniques in Statistics Eric Slud, Statistics Program Lecture 1: Metropolis-Hastings Algorithm, plus background in Simulation and Markov Chains. Lecture

More information

The Logarithmic Sobolev Constant of Some Finite Markov Chains. Wai Wai Liu

The Logarithmic Sobolev Constant of Some Finite Markov Chains. Wai Wai Liu CORNELL UNIVERSITY MATHEMATICS DEPARTMENT SENIOR THESIS The Logarithmic Sobolev Constant of Some Finite Markov Chains A THESIS PRESENTED IN PARTIAL FULFILLMENT OF CRITERIA FOR HONORS IN MATHEMATICS Wai

More information

Curriculum vitae et studiorum Nicoletta Cancrini

Curriculum vitae et studiorum Nicoletta Cancrini Curriculum vitae et studiorum Nicoletta Cancrini Civil state: Married, 2 children (2003 and 2008) Nationality: Italian Languages: Italian, English, French Office: DIIIE, Department of Industrial and Information

More information

Effective dynamics for the (overdamped) Langevin equation

Effective dynamics for the (overdamped) Langevin equation Effective dynamics for the (overdamped) Langevin equation Frédéric Legoll ENPC and INRIA joint work with T. Lelièvre (ENPC and INRIA) Enumath conference, MS Numerical methods for molecular dynamics EnuMath

More information

Lecture 6: Gaussian Channels. Copyright G. Caire (Sample Lectures) 157

Lecture 6: Gaussian Channels. Copyright G. Caire (Sample Lectures) 157 Lecture 6: Gaussian Channels Copyright G. Caire (Sample Lectures) 157 Differential entropy (1) Definition 18. The (joint) differential entropy of a continuous random vector X n p X n(x) over R is: Z h(x

More information

Lecture 12: Detailed balance and Eigenfunction methods

Lecture 12: Detailed balance and Eigenfunction methods Miranda Holmes-Cerfon Applied Stochastic Analysis, Spring 2015 Lecture 12: Detailed balance and Eigenfunction methods Readings Recommended: Pavliotis [2014] 4.5-4.7 (eigenfunction methods and reversibility),

More information

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is MARKOV CHAINS What I will talk about in class is pretty close to Durrett Chapter 5 sections 1-5. We stick to the countable state case, except where otherwise mentioned. Lecture 7. We can regard (p(i, j))

More information

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2. APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product

More information

arxiv:math/ v1 [math.pr] 31 Jan 2001

arxiv:math/ v1 [math.pr] 31 Jan 2001 Chin. Sci. Bulletin, 1999, 44(23), 2465 2470 (Chinese Ed.); 2000, 45:9 (English Ed.), 769 774 Eigenvalues, inequalities and ergodic theory arxiv:math/0101257v1 [math.pr] 31 Jan 2001 Mu-Fa Chen (Beijing

More information

Characterization of cutoff for reversible Markov chains

Characterization of cutoff for reversible Markov chains Characterization of cutoff for reversible Markov chains Yuval Peres Joint work with Riddhi Basu and Jonathan Hermon 3 December 2014 Joint work with Riddhi Basu and Jonathan Hermon Characterization of cutoff

More information

Central limit theorems for ergodic continuous-time Markov chains with applications to single birth processes

Central limit theorems for ergodic continuous-time Markov chains with applications to single birth processes Front. Math. China 215, 1(4): 933 947 DOI 1.17/s11464-15-488-5 Central limit theorems for ergodic continuous-time Markov chains with applications to single birth processes Yuanyuan LIU 1, Yuhui ZHANG 2

More information

EQUITY MARKET STABILITY

EQUITY MARKET STABILITY EQUITY MARKET STABILITY Adrian Banner INTECH Investment Technologies LLC, Princeton (Joint work with E. Robert Fernholz, Ioannis Karatzas, Vassilios Papathanakos and Phillip Whitman.) Talk at WCMF6 conference,

More information

Discrete Ricci curvature via convexity of the entropy

Discrete Ricci curvature via convexity of the entropy Discrete Ricci curvature via convexity of the entropy Jan Maas University of Bonn Joint work with Matthias Erbar Simons Institute for the Theory of Computing UC Berkeley 2 October 2013 Starting point McCann

More information

ICM 2014: The Structure and Meaning. of Ricci Curvature. Aaron Naber ICM 2014: Aaron Naber

ICM 2014: The Structure and Meaning. of Ricci Curvature. Aaron Naber ICM 2014: Aaron Naber Outline of Talk Background and Limit Spaces Structure of Spaces with Lower Ricci Regularity of Spaces with Bounded Ricci Characterizing Ricci Background: s (M n, g, x) n-dimensional pointed Riemannian

More information

6 Markov Chain Monte Carlo (MCMC)

6 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 information

Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012

Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012 Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 202 BOUNDS AND ASYMPTOTICS FOR FISHER INFORMATION IN THE CENTRAL LIMIT THEOREM

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS PROBABILITY: LIMIT THEOREMS II, SPRING 218. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please

More information

A NOTE ON THE POINCARÉ AND CHEEGER INEQUALITIES FOR SIMPLE RANDOM WALK ON A CONNECTED GRAPH. John Pike

A NOTE ON THE POINCARÉ AND CHEEGER INEQUALITIES FOR SIMPLE RANDOM WALK ON A CONNECTED GRAPH. John Pike A NOTE ON THE POINCARÉ AND CHEEGER INEQUALITIES FOR SIMPLE RANDOM WALK ON A CONNECTED GRAPH John Pike Department of Mathematics University of Southern California jpike@usc.edu Abstract. In 1991, Persi

More information

Edge Flip Chain for Unbiased Dyadic Tilings

Edge Flip Chain for Unbiased Dyadic Tilings Sarah Cannon, Georgia Tech,, David A. Levin, U. Oregon Alexandre Stauffer, U. Bath, March 30, 2018 Dyadic Tilings A dyadic tiling is a tiling on [0,1] 2 by n = 2 k dyadic rectangles, rectangles which are

More information

Pseudo-Poincaré Inequalities and Applications to Sobolev Inequalities

Pseudo-Poincaré Inequalities and Applications to Sobolev Inequalities Pseudo-Poincaré Inequalities and Applications to Sobolev Inequalities Laurent Saloff-Coste Abstract Most smoothing procedures are via averaging. Pseudo-Poincaré inequalities give a basic L p -norm control

More information

LECTURE 15: COMPLETENESS AND CONVEXITY

LECTURE 15: COMPLETENESS AND CONVEXITY LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other

More information

Gärtner-Ellis Theorem and applications.

Gärtner-Ellis Theorem and applications. Gärtner-Ellis Theorem and applications. Elena Kosygina July 25, 208 In this lecture we turn to the non-i.i.d. case and discuss Gärtner-Ellis theorem. As an application, we study Curie-Weiss model with

More information

Introduction to Queuing Networks Solutions to Problem Sheet 3

Introduction to Queuing Networks Solutions to Problem Sheet 3 Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus

More information

Markov processes and queueing networks

Markov processes and queueing networks Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution

More information

STA205 Probability: Week 8 R. Wolpert

STA205 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 information

EE/Stats 376A: Homework 7 Solutions Due on Friday March 17, 5 pm

EE/Stats 376A: Homework 7 Solutions Due on Friday March 17, 5 pm EE/Stats 376A: Homework 7 Solutions Due on Friday March 17, 5 pm 1. Feedback does not increase the capacity. Consider a channel with feedback. We assume that all the recieved outputs are sent back immediately

More information

Markov Chain Monte Carlo (MCMC)

Markov Chain Monte Carlo (MCMC) Markov Chain Monte Carlo (MCMC Dependent Sampling Suppose we wish to sample from a density π, and we can evaluate π as a function but have no means to directly generate a sample. Rejection sampling can

More information

The cutoff phenomenon for random walk on random directed graphs

The cutoff phenomenon for random walk on random directed graphs The cutoff phenomenon for random walk on random directed graphs Justin Salez Joint work with C. Bordenave and P. Caputo Outline of the talk Outline of the talk 1. The cutoff phenomenon for Markov chains

More information

Necessary and sufficient conditions for strong R-positivity

Necessary and sufficient conditions for strong R-positivity Necessary and sufficient conditions for strong R-positivity Wednesday, November 29th, 2017 The Perron-Frobenius theorem Let A = (A(x, y)) x,y S be a nonnegative matrix indexed by a countable set S. We

More information

Displacement convexity of the relative entropy in the discrete h

Displacement convexity of the relative entropy in the discrete h Displacement convexity of the relative entropy in the discrete hypercube LAMA Université Paris Est Marne-la-Vallée Phenomena in high dimensions in geometric analysis, random matrices, and computational

More information

Harnack inequalities and Gaussian estimates for random walks on metric measure spaces. Mathav Murugan Laurent Saloff-Coste

Harnack inequalities and Gaussian estimates for random walks on metric measure spaces. Mathav Murugan Laurent Saloff-Coste Harnack inequalities and Gaussian estimates for random walks on metric measure spaces Mathav Murugan Laurent Saloff-Coste Author address: Department of Mathematics, University of British Columbia and Pacific

More information

Combinatorics in Banach space theory Lecture 12

Combinatorics in Banach space theory Lecture 12 Combinatorics in Banach space theory Lecture The next lemma considerably strengthens the assertion of Lemma.6(b). Lemma.9. For every Banach space X and any n N, either all the numbers n b n (X), c n (X)

More information

10. Unconstrained minimization

10. Unconstrained minimization Convex Optimization Boyd & Vandenberghe 10. Unconstrained minimization terminology and assumptions gradient descent method steepest descent method Newton s method self-concordant functions implementation

More information

Markov chains. 1 Discrete time Markov chains. c A. J. Ganesh, University of Bristol, 2015

Markov chains. 1 Discrete time Markov chains. c A. J. Ganesh, University of Bristol, 2015 Markov chains c A. J. Ganesh, University of Bristol, 2015 1 Discrete time Markov chains Example: A drunkard is walking home from the pub. There are n lampposts between the pub and his home, at each of

More information

MIXING TIME OF CRITICAL ISING MODEL ON TREES IS POLYNOMIAL IN THE HEIGHT

MIXING TIME OF CRITICAL ISING MODEL ON TREES IS POLYNOMIAL IN THE HEIGHT MIXING TIME OF CRITICAL ISING MODEL ON TREES IS POLYNOMIAL IN THE HEIGHT JIAN DING, EYAL LUBETZKY AND YUVAL PERES Abstract. In the heat-bath Glauber dynamics for the Ising model on the lattice, physicists

More information

Discrete entropy methods for nonlinear diffusive equations

Discrete entropy methods for nonlinear diffusive equations Discrete entropy methods for nonlinear diffusive equations 1 Ansgar Jüngel Vienna University of Technology, Austria www.jungel.at.vu Joint with C. Chainais-Hillairet (Lille), J. A. Carrillo (Imperial),

More information

Approximate Dynamic Programming

Approximate Dynamic Programming Master MVA: Reinforcement Learning Lecture: 5 Approximate Dynamic Programming Lecturer: Alessandro Lazaric http://researchers.lille.inria.fr/ lazaric/webpage/teaching.html Objectives of the lecture 1.

More information

A note on the convex infimum convolution inequality

A note on the convex infimum convolution inequality A note on the convex infimum convolution inequality Naomi Feldheim, Arnaud Marsiglietti, Piotr Nayar, Jing Wang Abstract We characterize the symmetric measures which satisfy the one dimensional convex

More information

Contraction properties of Feynman-Kac semigroups

Contraction properties of Feynman-Kac semigroups Journées de Statistique Marne La Vallée, January 2005 Contraction properties of Feynman-Kac semigroups Pierre DEL MORAL, Laurent MICLO Lab. J. Dieudonné, Nice Univ., LATP Univ. Provence, Marseille 1 Notations

More information

Notes on Measure Theory and Markov Processes

Notes on Measure Theory and Markov Processes Notes on Measure Theory and Markov Processes Diego Daruich March 28, 2014 1 Preliminaries 1.1 Motivation The objective of these notes will be to develop tools from measure theory and probability to allow

More information

Backward Stochastic Differential Equations with Infinite Time Horizon

Backward Stochastic Differential Equations with Infinite Time Horizon Backward Stochastic Differential Equations with Infinite Time Horizon Holger Metzler PhD advisor: Prof. G. Tessitore Università di Milano-Bicocca Spring School Stochastic Control in Finance Roscoff, March

More information