Stochastic domination in space-time for the supercritical contact process

Size: px
Start display at page:

Download "Stochastic domination in space-time for the supercritical contact process"

Transcription

1 Stochastic domination in space-time for the supercritical contact process Stein Andreas Bethuelsen joint work with Rob van den Berg (CWI and VU Amsterdam) Workshop on Genealogies of Interacting Particle Systems, IMS, Singapore, August 10th 2017 (S.A. Bethuelsen) 1 / 15

2 The contact process Let G = (V, E) be a connected graph with bounded degree. Let λ (0, ). The contact process on G with infection parameter λ is the IPS on {0, 1} V with local transition rates given by η η x at rate { 1, if η(x) = 1; λ {y : {x,y} E} η(y), if η(x) = 0, where η x is defined by η x (y) := η(y) for y x, and η x (x) := 1 η(x). (S.A. Bethuelsen) 2 / 15

3 Some well-known properties The state 0 where 0(x) = 0 for all x V is an absorbing state. Started from the state 1, where 1(x) = 1 for all x V, the contact process converges toward a stationary measure called the upper invariant measure. We denote this measure by ν λ. For G infinite: there exists λ c (0, ) such that { νλ = δ 0, if λ < λ c; ν λ is non-trivial if λ > λ c. The contact process is said to be supercritical when λ > λ c. (S.A. Bethuelsen) 3 / 15

4 Stochastic domination Associate to {0, 1} V the partial ordering, where η ξ if η(x) ξ(x) for all x V. An event B is increasing if η B implies that ξ B for all ξ η. A measure µ stochastically dominates ν if µ(b) ν(b) for all B increasing. Equivalently, if there exists a coupling P of µ and ν such that P(X µ Y ν ) = 1. Theorem (Liggett and Steif (2006)) Consider the contact process on Z d, d 1, with λ > λ c. Then there exists ρ (0, 1) such that ν λ stochastically dominates a Bernoulli product measure with density ρ. (S.A. Bethuelsen) 4 / 15

5 Correlation inequalities A measure µ on {0, 1} V is said to be: 1 positively associated if µ(b 1 B 2 ) µ(b 1 )µ(b 2 ) for any two increasing events B 1, B 2. 2 downward FKG if for every finite Λ V, the measure µ( η 0 on Λ) is positively associated. 3 FKG if for every finite Λ V and σ {0, 1} V, the measure µ( η σ on Λ) is positively associated. - Liggett (1994) showed that the contact process is not FKG (at least in some regime of λ for the process on Z). - Van den Berg, Häggström and Kahn (2006) proved that ν λ is downward FKG. (S.A. Bethuelsen) 5 / 15

6 Stochastic domination for dfkg measures Theorem (Liggett and Steif (2006)) Let µ be a translation invariant measure on {0, 1} Z which is dfkg. Then the following are equivalent: 1 µ stochastically dominates a Bernoulli product measure with density ρ. 2 µ(η 0 on {1, 2,..., n}) (1 ρ) n for all n. 3 For all disjoint, finite subsets Λ and of {1, 2, 3,... }, we have µ (η(0) = 1 η 0 on Λ, η 1 on ) ρ. - Liggett and Steif also proved a generalization of this theorem for measures on {0, 1} Zd, d 2. (S.A. Bethuelsen) 6 / 15

7 Stochastic domination in space-time For α [0, ), let (ξ t ) t 0 be the independent spin-flip process on {0, 1} V with local transition rates given by η η x at rate { 1, if η(x) = 1; α, if η(x) = 0. This process is uniquely ergodic with the Bernoulli product measure with density ρ = α 1+α, denoted here by µ ρ, as invariant measure. Main question: Does there, for some α > 0, exists a coupling P of (ξ t ) and (η t ) such that, P (η t (x) ξ t (x) for all (x, t) V [0, )) = 1? (1) If not, does (1) possibly hold on certain subsets of V? (S.A. Bethuelsen) 7 / 15

8 The answer depends on the graph Let d : V V N be the graph distance. 1 We say that the graph G = (V, E) is amenable if e U inf = 0. U V,U finite U 2 We say that G has subexponential growth if, for some o V, lim inf n {x V : d(o, x) n} 1/n = 1. 3 We say that V has positive density if, for some o V, lim inf n {x : d(o, x) n} {y V : d(o, y) n} > 0. (S.A. Bethuelsen) 8 / 15

9 Negative answer #1: amenable graphs Proposition (van den Berg, B. (2017)) Consider the contact process on an amenable graph G with λ > 0. Then there does not exist a coupling P of (ξ t ) and (η t ) such that, unless α = 0. P (η t (x) ξ t (x) for all (x, t) V [0, )) = 1 - Liggett and Steif (2006) proved this for the case V = Z. (S.A. Bethuelsen) 9 / 15

10 Negative answer # 2: graphs of subexponential growth Proposition (van den Berg, B. (2017)) Consider the contact process on a graph of subexponential growth with λ > 0. Let V have positive density. Then there does not exist a coupling P of (ξ t ) and (η t ) such that, unless α = 0. P (η t (x) ξ t (x) for all (x, t) [0, )) = 1 - note that there are amenable graphs with exponential growth and which are not covered by the above statement. (S.A. Bethuelsen) 10 / 15

11 Positive answer # 1: domination at a single site For x V, denote by τ x := inf{t 0: η x t 0}. Theorem (van den Berg, B. (2017)) Consider the contact process on a connected graph G = (V, E) having bounded degree with λ > 0. Let x V for which P (τ x = ) > 0 and such that, for some C, c > 0, P (s < τ x < ) Ce cs, for all s 0. Then there exists α = α(λ) > 0 and a coupling P of (η t ) and (ξ t ) initialised from ν λ and µ α/(1+α) respectively, such that P (η t (x) ξ t (x) for all (x, t) {o} [0, )) = 1, (S.A. Bethuelsen) 11 / 15

12 Positive answer # 2: domination on trees Theorem (van den Berg, B. (2017)) Consider the contact process on T d, d 2, and λ > λ c (Z). Then there exists V of positive density, α > 0, and a coupling P of (ξ t ) and (η t ) initialised from ν λ and µ α/(1+α) respectively such that P (η t (x) ξ t (x) for all (x, t) [0, )) = 1. (2) - the theorem also holds for many other non-amenable graphs. - Question: Does the theorem hold on the entire graph T d? (S.A. Bethuelsen) 12 / 15

13 Positive answer # 3: domination on finite sets Theorem (van den Berg, B. (2017)) Consider the contact process on a connected graph G = (V, E) having bounded degree with λ > 0. Let V finite for which, for all x, P (τ x = ) > 0 and such that, for some C, c > 0, P (s < τ x < ) Ce cs, for all s 0. Then there exists α = α(λ) > 0 and a coupling P of (η t ) and (ξ t ) initialised from ν λ and µ α/(1+α) respectively, such that P (η t (x) ξ t (x) for all (x, t) N) = 1, (S.A. Bethuelsen) 13 / 15

14 An application: cone-mixing on slabs Theorem (van den Berg, B. (2017)) The contact process on Z d, d 1, with λ > λ c, projected onto Z d 1 {0} Z, is cone-mixing. That is, for all θ (0, 1 2 π), lim t sup A F <0,B F θ t P(A)>0 P(B A) P(B) = 0. where F <0 is the σ-algebra generated by the (discrete-time) lower half-space and Ft θ is the σ-algebra generated by the (discrete-time) forward cone with declination proportional to θ. - Cone mixing is an important property in the study of random walks in (dynamic) random environment. (S.A. Bethuelsen) 14 / 15

15 Thank you for your attention! References: 1 J. van den Berg, O. Häggstöm and J. Kahn. Some conditional correlation inequalities for percolation and related processes. Random Structures & Algorithms (2006). 2 T. Liggett and J. Steif. Stochastic domination: the contact process, Ising models and FKG measures. Ann. Inst. H Poin. (2006). 3 T. Liggett. Conditional association and spin systems. ALEA (2006). 4 J. van den Berg, S. Bethuelsen. Stochastic domination in space-time for the contact process. Accepted by Random Structures & Algorithms (2017). (S.A. Bethuelsen) 15 / 15

arxiv:math/ v1 [math.pr] 10 Jun 2004

arxiv:math/ v1 [math.pr] 10 Jun 2004 Slab Percolation and Phase Transitions for the Ising Model arxiv:math/0406215v1 [math.pr] 10 Jun 2004 Emilio De Santis, Rossella Micieli Dipartimento di Matematica Guido Castelnuovo, Università di Roma

More information

Uniformity of hitting times of the contact process

Uniformity of hitting times of the contact process ALEA, Lat. Am. J. Probab. Math. Stat. 15, 233 245 2018) DOI: 10.30757/ALEA.v15-11 Uniformity of hitting times of the contact process Markus Heydenreich, Christian Hirsch and Daniel Valesin Mathematisches

More information

On the critical value function in the divide and color model

On the critical value function in the divide and color model ALEA, Lat. Am. J. Probab. Math. Stat. 10 (2), 653 666 (2013) On the critical value function in the divide and color model András Bálint, Vincent Beffara and Vincent Tassion Chalmers University of Technology

More information

arxiv: v2 [math.pr] 10 Jul 2013

arxiv: v2 [math.pr] 10 Jul 2013 On the critical value function in the divide and color model András Bálint Vincent Beffara Vincent Tassion May 17, 2018 arxiv:1109.3403v2 [math.pr] 10 Jul 2013 Abstract The divide and color model on a

More information

Revisiting the Contact Process

Revisiting the Contact Process Revisiting the Contact Process Maria Eulália Vares Universidade Federal do Rio de Janeiro World Meeting for Women in Mathematics - July 31, 2018 The classical contact process G = (V,E) graph, locally finite.

More information

Math 564 Homework 1. Solutions.

Math 564 Homework 1. Solutions. Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties

More information

T. E. HARRIS CONTRIBUTIONS TO INTERACTING PARTICLE SYSTEMS AND PERCOLATION. BY THOMAS M. LIGGETT 1 University of California at Los Angeles

T. E. HARRIS CONTRIBUTIONS TO INTERACTING PARTICLE SYSTEMS AND PERCOLATION. BY THOMAS M. LIGGETT 1 University of California at Los Angeles The Annals of Probability 2011, Vol. 39, No. 2, 407 416 DOI: 10.1214/10-AOP593 Institute of Mathematical Statistics, 2011 T. E. HARRIS CONTRIBUTIONS TO INTERACTING PARTICLE SYSTEMS AND PERCOLATION BY THOMAS

More information

Consensus formation in the Deuant model

Consensus formation in the Deuant model Consensus formation in the Deuant model Timo Hirscher Chalmers University of Technology Seminarium i matematisk statistik, KTH October 29, 2014 Outline The seminar is structured as follows: Introduction:

More information

List of Publications. Roberto H. Schonmann

List of Publications. Roberto H. Schonmann List of Publications Roberto H. Schonmann (1) J.F.Perez, R.H.Schonmann: On the global character of some local equilibrium conditions - a remark on metastability. Journal of Statistical Physics 28, 479-485

More information

Random geometric analysis of the 2d Ising model

Random geometric analysis of the 2d Ising model Random geometric analysis of the 2d Ising model Hans-Otto Georgii Bologna, February 2001 Plan: Foundations 1. Gibbs measures 2. Stochastic order 3. Percolation The Ising model 4. Random clusters and phase

More information

CONSTRAINED PERCOLATION ON Z 2

CONSTRAINED PERCOLATION ON Z 2 CONSTRAINED PERCOLATION ON Z 2 ZHONGYANG LI Abstract. We study a constrained percolation process on Z 2, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability

More information

Limit shapes outside the percolation cone

Limit shapes outside the percolation cone jointly with Tuca Auffinger and Mike Hochman Princeton University July 14, 2011 Definitions We consider first-passage percolation on the square lattice Z 2. x γ - We place i.i.d. non-negative passage times

More information

Recurrence of Simple Random Walk on Z 2 is Dynamically Sensitive

Recurrence of Simple Random Walk on Z 2 is Dynamically Sensitive arxiv:math/5365v [math.pr] 3 Mar 25 Recurrence of Simple Random Walk on Z 2 is Dynamically Sensitive Christopher Hoffman August 27, 28 Abstract Benjamini, Häggström, Peres and Steif [2] introduced the

More information

arxiv: v2 [math.pr] 16 Jun 2009

arxiv: v2 [math.pr] 16 Jun 2009 The Annals of Probability 2009, Vol. 37, No. 2, 654 675 DOI: 10.1214/08-AOP415 c Institute of Mathematical Statistics, 2009 arxiv:0710.0939v2 [math.pr] 16 Jun 2009 STABILIZABILITY AND PERCOLATION IN THE

More information

Hard-Core Model on Random Graphs

Hard-Core Model on Random Graphs Hard-Core Model on Random Graphs Antar Bandyopadhyay Theoretical Statistics and Mathematics Unit Seminar Theoretical Statistics and Mathematics Unit Indian Statistical Institute, New Delhi Centre New Delhi,

More information

Biased activated random walks

Biased activated random walks Joint work with Leonardo ROLLA LAGA (Université Paris 3) Probability seminar University of Bristol 23 April 206 Plan of the talk Introduction of the model, results 2 Elements of proofs 3 Conclusion Plan

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

DOMINO TILINGS INVARIANT GIBBS MEASURES

DOMINO TILINGS INVARIANT GIBBS MEASURES DOMINO TILINGS and their INVARIANT GIBBS MEASURES Scott Sheffield 1 References on arxiv.org 1. Random Surfaces, to appear in Asterisque. 2. Dimers and amoebae, joint with Kenyon and Okounkov, to appear

More information

Open problems from Random walks on graphs and potential theory

Open problems from Random walks on graphs and potential theory Open problems from Random walks on graphs and potential theory edited by John Sylvester University of Warwick, 18-22 May 2015 Abstract The following open problems were posed by attendees (or non attendees

More information

arxiv: v2 [math.pr] 26 Aug 2017

arxiv: v2 [math.pr] 26 Aug 2017 CONSTRAINED PERCOLATION, ISING MODEL AND XOR ISING MODEL ON PLANAR LATTICES ZHONGYANG LI arxiv:1707.04183v2 [math.pr] 26 Aug 2017 Abstract. We study constrained percolation models on planar lattices including

More information

Information Theory and Statistics Lecture 3: Stationary ergodic processes

Information Theory and Statistics Lecture 3: Stationary ergodic processes Information Theory and Statistics Lecture 3: Stationary ergodic processes Łukasz Dębowski ldebowsk@ipipan.waw.pl Ph. D. Programme 2013/2014 Measurable space Definition (measurable space) Measurable space

More information

The contact process with aging

The contact process with aging ALEA, Lat. Am. J. Probab. Math. Stat. 11 2, 845 883 2014 The contact process with aging Aurelia Deshayes Université de Lorraine- Institut Elie Cartan Campus Scientifique BP 239 54506 Vandœuvre-lès-Nancy

More information

arxiv: v1 [math.pr] 31 Aug 2018

arxiv: v1 [math.pr] 31 Aug 2018 The Limiting Behavior of the FTASEP with Product Bernoulli Initial Distribution arxiv:1808.10612v1 [math.pr] 31 Aug 2018 Dayue Chen, Linjie Zhao September 3, 2018 Abstract We study the facilitated totally

More information

process on the hierarchical group

process on the hierarchical group Intertwining of Markov processes and the contact process on the hierarchical group April 27, 2010 Outline Intertwining of Markov processes Outline Intertwining of Markov processes First passage times of

More information

Percolation and Random walks on graphs

Percolation and Random walks on graphs Percolation and Random walks on graphs Perla Sousi May 14, 2018 Contents 1 Percolation 2 1.1 Definition of the model................................... 2 1.2 Coupling of percolation processes.............................

More information

L n = l n (π n ) = length of a longest increasing subsequence of π n.

L n = l n (π n ) = length of a longest increasing subsequence of π n. Longest increasing subsequences π n : permutation of 1,2,...,n. L n = l n (π n ) = length of a longest increasing subsequence of π n. Example: π n = (π n (1),..., π n (n)) = (7, 2, 8, 1, 3, 4, 10, 6, 9,

More information

Analysis and geometry on groups

Analysis and geometry on groups Analysis and geometry on groups Andrzej Zuk Paris Contents 1 Introduction 1 2 Amenability 2 2.1 Amenable groups............................. 2 2.2 Automata groups............................. 5 2.3 Random

More information

Probability and Measure

Probability and Measure Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability

More information

On spectra of Koopman, groupoid and quasi-regular representations

On spectra of Koopman, groupoid and quasi-regular representations On spectra of Koopman, groupoid and quasi-regular representations Artem Dudko Stony Brook University Group Theory International Webinar March 17, 2016 Preliminaries Throughout the talk G is a countable

More information

STATIONARY NON EQULIBRIUM STATES F STATES FROM A MICROSCOPIC AND A MACROSCOPIC POINT OF VIEW

STATIONARY NON EQULIBRIUM STATES F STATES FROM A MICROSCOPIC AND A MACROSCOPIC POINT OF VIEW STATIONARY NON EQULIBRIUM STATES FROM A MICROSCOPIC AND A MACROSCOPIC POINT OF VIEW University of L Aquila 1 July 2014 GGI Firenze References L. Bertini; A. De Sole; D. G. ; G. Jona-Lasinio; C. Landim

More information

arxiv: v4 [math.ds] 15 Jun 2017

arxiv: v4 [math.ds] 15 Jun 2017 SPHERICAL RECURRENCE AND LOCALLY ISOMETRIC EMBEDDINGS OF TREES INTO POSITIVE DENSITY SUBSETS OF Z d KAMIL BULINSKI School of Mathematics and Statistics F07, University of Sydney, NSW 006, Australia arxiv:1606.07596v4

More information

4.5 The critical BGW tree

4.5 The critical BGW tree 4.5. THE CRITICAL BGW TREE 61 4.5 The critical BGW tree 4.5.1 The rooted BGW tree as a metric space We begin by recalling that a BGW tree T T with root is a graph in which the vertices are a subset of

More information

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains Markov Chains A random process X is a family {X t : t T } of random variables indexed by some set T. When T = {0, 1, 2,... } one speaks about a discrete-time process, for T = R or T = [0, ) one has a continuous-time

More information

Propp-Wilson Algorithm (and sampling the Ising model)

Propp-Wilson Algorithm (and sampling the Ising model) Propp-Wilson Algorithm (and sampling the Ising model) Danny Leshem, Nov 2009 References: Haggstrom, O. (2002) Finite Markov Chains and Algorithmic Applications, ch. 10-11 Propp, J. & Wilson, D. (1996)

More information

A lower bound on the two arms exponent for critical percolation on the lattice

A lower bound on the two arms exponent for critical percolation on the lattice A lower bound on the two arms exponent for critical percolation on the lattice Raphaël Cerf Université Paris Sud and IUF June 13, 2013 Abstract We consider the standard site percolation model on the d

More information

The Caratheodory Construction of Measures

The Caratheodory Construction of Measures Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,

More information

Shifting processes with cyclically exchangeable increments at random

Shifting processes with cyclically exchangeable increments at random Shifting processes with cyclically exchangeable increments at random Gerónimo URIBE BRAVO (Collaboration with Loïc CHAUMONT) Instituto de Matemáticas UNAM Universidad Nacional Autónoma de México www.matem.unam.mx/geronimo

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

Chapter 4. Measure Theory. 1. Measure Spaces

Chapter 4. Measure Theory. 1. Measure Spaces Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if

More information

VARIATIONAL PRINCIPLE FOR THE ENTROPY

VARIATIONAL PRINCIPLE FOR THE ENTROPY VARIATIONAL PRINCIPLE FOR THE ENTROPY LUCIAN RADU. Metric entropy Let (X, B, µ a measure space and I a countable family of indices. Definition. We say that ξ = {C i : i I} B is a measurable partition if:

More information

Uniqueness of the critical probability for percolation in the two dimensional Sierpiński carpet lattice

Uniqueness of the critical probability for percolation in the two dimensional Sierpiński carpet lattice Uniqueness of the critical probability for percolation in the two dimensional Sierpiński carpet lattice Yasunari Higuchi 1, Xian-Yuan Wu 2, 1 Department of Mathematics, Faculty of Science, Kobe University,

More information

Random Locations of Periodic Stationary Processes

Random Locations of Periodic Stationary Processes Random Locations of Periodic Stationary Processes Yi Shen Department of Statistics and Actuarial Science University of Waterloo Joint work with Jie Shen and Ruodu Wang May 3, 2016 The Fields Institute

More information

Lectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 4. Coupling and Harris Processes

Lectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 4. Coupling and Harris Processes Lectures on Stochastic Stability Sergey FOSS Heriot-Watt University Lecture 4 Coupling and Harris Processes 1 A simple example Consider a Markov chain X n in a countable state space S with transition probabilities

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

ASYMPTOTIC BEHAVIOR OF A TAGGED PARTICLE IN SIMPLE EXCLUSION PROCESSES

ASYMPTOTIC BEHAVIOR OF A TAGGED PARTICLE IN SIMPLE EXCLUSION PROCESSES ASYMPTOTIC BEHAVIOR OF A TAGGED PARTICLE IN SIMPLE EXCLUSION PROCESSES C. LANDIM, S. OLLA, S. R. S. VARADHAN Abstract. We review in this article central limit theorems for a tagged particle in the simple

More information

Problem List MATH 5143 Fall, 2013

Problem List MATH 5143 Fall, 2013 Problem List MATH 5143 Fall, 2013 On any problem you may use the result of any previous problem (even if you were not able to do it) and any information given in class up to the moment the problem was

More information

Signed Measures and Complex Measures

Signed Measures and Complex Measures Chapter 8 Signed Measures Complex Measures As opposed to the measures we have considered so far, a signed measure is allowed to take on both positive negative values. To be precise, if M is a σ-algebra

More information

In terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3.

In terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3. 1. GAUSSIAN PROCESSES A Gaussian process on a set T is a collection of random variables X =(X t ) t T on a common probability space such that for any n 1 and any t 1,...,t n T, the vector (X(t 1 ),...,X(t

More information

III. Quantum ergodicity on graphs, perspectives

III. Quantum ergodicity on graphs, perspectives III. Quantum ergodicity on graphs, perspectives Nalini Anantharaman Université de Strasbourg 24 août 2016 Yesterday we focussed on the case of large regular (discrete) graphs. Let G = (V, E) be a (q +

More information

Scaling limits of inclusion particles. Cristian Giardinà

Scaling limits of inclusion particles. Cristian Giardinà Scaling limits of inclusion particles Cristian Giardinà Outline 1. Inclusion process. 2. Models related to inclusion process. 3. Intermezzo: some comments on duality. 4. Scaling limit I: metastability.

More information

Susceptible-Infective-Removed Epidemics and Erdős-Rényi random

Susceptible-Infective-Removed Epidemics and Erdős-Rényi random Susceptible-Infective-Removed Epidemics and Erdős-Rényi random graphs MSR-Inria Joint Centre October 13, 2015 SIR epidemics: the Reed-Frost model Individuals i [n] when infected, attempt to infect all

More information

The Minesweeper game: Percolation and Complexity

The Minesweeper game: Percolation and Complexity The Minesweeper game: Percolation and Complexity Elchanan Mossel Hebrew University of Jerusalem and Microsoft Research March 15, 2002 Abstract We study a model motivated by the minesweeper game In this

More information

Asymptotics of minimax stochastic programs

Asymptotics of minimax stochastic programs Asymptotics of minimax stochastic programs Alexander Shapiro Abstract. We discuss in this paper asymptotics of the sample average approximation (SAA) of the optimal value of a minimax stochastic programming

More information

Phase Transitions on Nonamenable Graphs

Phase Transitions on Nonamenable Graphs J. Math. Phys. 41 (2000), 1099 1126. Version of 11 July 2000 Phase Transitions on Nonamenable Graphs by Russell Lyons Abstract. We survey known results about phase transitions in various models of statistical

More information

Diffusion of wave packets in a Markov random potential

Diffusion of wave packets in a Markov random potential Diffusion of wave packets in a Markov random potential Jeffrey Schenker Michigan State University Joint work with Yang Kang (JSP 134 (2009)) WIP with Eman Hamza & Yang Kang ETH Zürich 9 June 2009 Jeffrey

More information

Brownian Motion. 1 Definition Brownian Motion Wiener measure... 3

Brownian Motion. 1 Definition Brownian Motion Wiener measure... 3 Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................

More information

A Note on the Central Limit Theorem for a Class of Linear Systems 1

A Note on the Central Limit Theorem for a Class of Linear Systems 1 A Note on the Central Limit Theorem for a Class of Linear Systems 1 Contents Yukio Nagahata Department of Mathematics, Graduate School of Engineering Science Osaka University, Toyonaka 560-8531, Japan.

More information

Consistency of the maximum likelihood estimator for general hidden Markov models

Consistency of the maximum likelihood estimator for general hidden Markov models Consistency of the maximum likelihood estimator for general hidden Markov models Jimmy Olsson Centre for Mathematical Sciences Lund University Nordstat 2012 Umeå, Sweden Collaborators Hidden Markov models

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

arxiv: v1 [math.pr] 13 Nov 2018

arxiv: v1 [math.pr] 13 Nov 2018 PHASE TRANSITION FOR THE FROG MODEL ON BIREGULAR TREES ELCIO LEBENSZTAYN AND JAIME UTRIA arxiv:1811.05495v1 [math.pr] 13 Nov 2018 Abstract. We study the frog model with death on the biregular tree T d1,d

More information

POSITIVE AND NEGATIVE CORRELATIONS FOR CONDITIONAL ISING DISTRIBUTIONS

POSITIVE AND NEGATIVE CORRELATIONS FOR CONDITIONAL ISING DISTRIBUTIONS POSITIVE AND NEGATIVE CORRELATIONS FOR CONDITIONAL ISING DISTRIBUTIONS CAMILLO CAMMAROTA Abstract. In the Ising model at zero external field with ferromagnetic first neighbors interaction the Gibbs measure

More information

5 Birkhoff s Ergodic Theorem

5 Birkhoff s Ergodic Theorem 5 Birkhoff s Ergodic Theorem Birkhoff s Ergodic Theorem extends the validity of Kolmogorov s strong law to the class of stationary sequences of random variables. Stationary sequences occur naturally even

More information

TCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis

TCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis TCOM 50: Networking Theory & Fundamentals Lecture 6 February 9, 003 Prof. Yannis A. Korilis 6- Topics Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues

More information

Convexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.

Convexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ. Convexity in R n Let E be a convex subset of R n. A function f : E (, ] is convex iff f(tx + (1 t)y) (1 t)f(x) + tf(y) x, y E, t [0, 1]. A similar definition holds in any vector space. A topology is needed

More information

BERNOULLI ACTIONS OF SOFIC GROUPS HAVE COMPLETELY POSITIVE ENTROPY

BERNOULLI ACTIONS OF SOFIC GROUPS HAVE COMPLETELY POSITIVE ENTROPY BERNOULLI ACTIONS OF SOFIC GROUPS HAVE COMPLETELY POSITIVE ENTROPY DAVID KERR Abstract. We prove that every Bernoulli action of a sofic group has completely positive entropy with respect to every sofic

More information

CUTOFF AND DISCRETE PRODUCT STRUCTURE IN ASEP PETER NEJJAR

CUTOFF AND DISCRETE PRODUCT STRUCTURE IN ASEP PETER NEJJAR CUTOFF AND DISCRETE PRODUCT STRUCTURE IN ASEP PETER NEJJAR IST Austria, 3400 Klosterneuburg, Austria. arxiv:82.939v [math.pr] 3 Dec 208 Abstract. We consider the asymmetric simple exclusion process ASEP

More information

Cheng Soon Ong & Christian Walder. Canberra February June 2018

Cheng Soon Ong & Christian Walder. Canberra February June 2018 Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression

More information

The range of tree-indexed random walk

The range of tree-indexed random walk The range of tree-indexed random walk Jean-François Le Gall, Shen Lin Institut universitaire de France et Université Paris-Sud Orsay Erdös Centennial Conference July 2013 Jean-François Le Gall (Université

More information

p 1 ( Y p dp) 1/p ( X p dp) 1 1 p

p 1 ( Y p dp) 1/p ( X p dp) 1 1 p Doob s inequality Let X(t) be a right continuous submartingale with respect to F(t), t 1 P(sup s t X(s) λ) 1 λ {sup s t X(s) λ} X + (t)dp 2 For 1 < p

More information

arxiv: v1 [math.pr] 1 Jan 2013

arxiv: v1 [math.pr] 1 Jan 2013 The role of dispersal in interacting patches subject to an Allee effect arxiv:1301.0125v1 [math.pr] 1 Jan 2013 1. Introduction N. Lanchier Abstract This article is concerned with a stochastic multi-patch

More information

Invariant measures and limiting shapes in sandpile models. Haiyan Liu

Invariant measures and limiting shapes in sandpile models. Haiyan Liu Invariant measures and limiting shapes in sandpile models Haiyan Liu c H. Liu, Amsterdam 2011 ISBN: 9789086595259 Printed by Ipskamp Drukkers, Enschede, The Netherlands VRIJE UNIVERSITEIT Invariant measures

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

Gradient Gibbs measures with disorder

Gradient Gibbs measures with disorder Gradient Gibbs measures with disorder Codina Cotar University College London April 16, 2015, Providence Partly based on joint works with Christof Külske Outline 1 The model 2 Questions 3 Known results

More information

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real

More information

BERNOULLI ACTIONS AND INFINITE ENTROPY

BERNOULLI ACTIONS AND INFINITE ENTROPY BERNOULLI ACTIONS AND INFINITE ENTROPY DAVID KERR AND HANFENG LI Abstract. We show that, for countable sofic groups, a Bernoulli action with infinite entropy base has infinite entropy with respect to every

More information

Lecture 17 Brownian motion as a Markov process

Lecture 17 Brownian motion as a Markov process Lecture 17: Brownian motion as a Markov process 1 of 14 Course: Theory of Probability II Term: Spring 2015 Instructor: Gordan Zitkovic Lecture 17 Brownian motion as a Markov process Brownian motion is

More information

Combinatorial Criteria for Uniqueness of Gibbs Measures

Combinatorial Criteria for Uniqueness of Gibbs Measures Combinatorial Criteria for Uniqueness of Gibbs Measures Dror Weitz School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, U.S.A. dror@ias.edu April 12, 2005 Abstract We generalize previously

More information

18.175: Lecture 2 Extension theorems, random variables, distributions

18.175: Lecture 2 Extension theorems, random variables, distributions 18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing

More information

µ X (A) = P ( X 1 (A) )

µ X (A) = P ( X 1 (A) ) 1 STOCHASTIC PROCESSES This appendix provides a very basic introduction to the language of probability theory and stochastic processes. We assume the reader is familiar with the general measure and integration

More information

REVERSALS ON SFT S. 1. Introduction and preliminaries

REVERSALS ON SFT S. 1. Introduction and preliminaries Trends in Mathematics Information Center for Mathematical Sciences Volume 7, Number 2, December, 2004, Pages 119 125 REVERSALS ON SFT S JUNGSEOB LEE Abstract. Reversals of topological dynamical systems

More information

Simons Workshop on Approximate Counting, Markov Chains and Phase Transitions: Open Problem Session

Simons Workshop on Approximate Counting, Markov Chains and Phase Transitions: Open Problem Session Simons Workshop on Approximate Counting, Markov Chains and Phase Transitions: Open Problem Session Scribes: Antonio Blanca, Sarah Cannon, Yumeng Zhang February 4th, 06 Yuval Peres: Simple Random Walk on

More information

Uniqueness of random gradient states

Uniqueness of random gradient states p. 1 Uniqueness of random gradient states Codina Cotar (Based on joint work with Christof Külske) p. 2 Model Interface transition region that separates different phases p. 2 Model Interface transition

More information

1 Stochastic Dynamic Programming

1 Stochastic Dynamic Programming 1 Stochastic Dynamic Programming Formally, a stochastic dynamic program has the same components as a deterministic one; the only modification is to the state transition equation. When events in the future

More information

Intertwining of Markov processes

Intertwining of Markov processes January 4, 2011 Outline Outline First passage times of birth and death processes Outline First passage times of birth and death processes The contact process on the hierarchical group 1 0.5 0-0.5-1 0 0.2

More information

Lecture 6 Basic Probability

Lecture 6 Basic Probability Lecture 6: Basic Probability 1 of 17 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 6 Basic Probability Probability spaces A mathematical setup behind a probabilistic

More information

LIMIT THEOREMS FOR SHIFT SELFSIMILAR ADDITIVE RANDOM SEQUENCES

LIMIT THEOREMS FOR SHIFT SELFSIMILAR ADDITIVE RANDOM SEQUENCES Watanabe, T. Osaka J. Math. 39 22, 561 63 LIMIT THEOEMS FO SHIFT SELFSIMILA ADDITIVE ANDOM SEQUENCES TOSHIO WATANABE eceived November 15, 2 1. Introduction We introduce shift selfsimilar random sequences,

More information

Mean-field dual of cooperative reproduction

Mean-field dual of cooperative reproduction The mean-field dual of systems with cooperative reproduction joint with Tibor Mach (Prague) A. Sturm (Göttingen) Friday, July 6th, 2018 Poisson construction of Markov processes Let (X t ) t 0 be a continuous-time

More information

Interacting stochastic processes

Interacting stochastic processes Interacting stochastic processes Stefan Grosskinsky Warwick, 2009 These notes and other information about the course are available on go.warwick.ac.uk/sgrosskinsky/teaching/ma4h3.html Contents Introduction

More information

Lattice spin models: Crash course

Lattice spin models: Crash course Chapter 1 Lattice spin models: Crash course 1.1 Basic setup Here we will discuss the basic setup of the models to which we will direct our attention throughout this course. The basic ingredients are as

More information

Introduction to self-similar growth-fragmentations

Introduction to self-similar growth-fragmentations Introduction to self-similar growth-fragmentations Quan Shi CIMAT, 11-15 December, 2017 Quan Shi Growth-Fragmentations CIMAT, 11-15 December, 2017 1 / 34 Literature Jean Bertoin, Compensated fragmentation

More information

MEASURE-THEORETIC ENTROPY

MEASURE-THEORETIC ENTROPY MEASURE-THEORETIC ENTROPY Abstract. We introduce measure-theoretic entropy 1. Some motivation for the formula and the logs We want to define a function I : [0, 1] R which measures how suprised we are or

More information

Orbits of D-maximal sets in E

Orbits of D-maximal sets in E Orbits of in E Peter M Gerdes April 19, 2012 * Joint work with Peter Cholak and Karen Lange Peter M Gerdes Orbits of in E Outline 1 2 3 Peter M Gerdes Orbits of in E Notation ω is the natural numbers X

More information

Generalized Fourier Spectrum and sparse reconstruction in spin systems

Generalized Fourier Spectrum and sparse reconstruction in spin systems Generalized Fourier Spectrum and sparse reconstruction in spin systems Gábor Pete Rényi Institute and TU Budapest http://www.math.bme.hu/ gabor Joint work with Pál Galicza (Central European University,

More information

Some Results on the Ergodicity of Adaptive MCMC Algorithms

Some Results on the Ergodicity of Adaptive MCMC Algorithms Some Results on the Ergodicity of Adaptive MCMC Algorithms Omar Khalil Supervisor: Jeffrey Rosenthal September 2, 2011 1 Contents 1 Andrieu-Moulines 4 2 Roberts-Rosenthal 7 3 Atchadé and Fort 8 4 Relationship

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

Automorphic Equivalence Within Gapped Phases

Automorphic Equivalence Within Gapped Phases 1 Harvard University May 18, 2011 Automorphic Equivalence Within Gapped Phases Robert Sims University of Arizona based on joint work with Sven Bachmann, Spyridon Michalakis, and Bruno Nachtergaele 2 Outline:

More information

A new approach to quantum metrics. Nik Weaver. (joint work with Greg Kuperberg, in progress)

A new approach to quantum metrics. Nik Weaver. (joint work with Greg Kuperberg, in progress) A new approach to quantum metrics Nik Weaver (joint work with Greg Kuperberg, in progress) Definition. A dual operator system is a linear subspace V of B(H) such that I V A V implies A V V is weak*-closed.

More information

http://www.math.uah.edu/stat/markov/.xhtml 1 of 9 7/16/2009 7:20 AM Virtual Laboratories > 16. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 1. A Markov process is a random process in which the future is

More information

lim n C1/n n := ρ. [f(y) f(x)], y x =1 [f(x) f(y)] [g(x) g(y)]. (x,y) E A E(f, f),

lim n C1/n n := ρ. [f(y) f(x)], y x =1 [f(x) f(y)] [g(x) g(y)]. (x,y) E A E(f, f), 1 Part I Exercise 1.1. Let C n denote the number of self-avoiding random walks starting at the origin in Z of length n. 1. Show that (Hint: Use C n+m C n C m.) lim n C1/n n = inf n C1/n n := ρ.. Show that

More information

The parabolic Anderson model on Z d with time-dependent potential: Frank s works

The parabolic Anderson model on Z d with time-dependent potential: Frank s works Weierstrass Institute for Applied Analysis and Stochastics The parabolic Anderson model on Z d with time-dependent potential: Frank s works Based on Frank s works 2006 2016 jointly with Dirk Erhard (Warwick),

More information