Resource title

A stochastic Ramsey theorem

Resource image

image for OpenScout resource :: A stochastic Ramsey theorem

Resource description

We establish a stochastic extension of Ramsey's theorem. Any Markov chain generates a filtration relative to which one may define a notion of stopping times. A stochastic colouring is any k-valued (k < infinity) colour function defined on all pairs consisting of a bounded stopping time and a finite partial history of the chain truncated before this stopping time. For any bounded stopping time theta and any infinite history omega of the Markov chain, let omega vertical bar theta denote the finite partial history up to and including the time theta(omega). Given k = 2, for every epsilon > 0. we prove that there is an increasing sequence theta(1) < theta(2) < ... of bounded stopping times having the property that, with probability greater than 1 - epsilon, the history omega is such that the values assigned to all pairs (omega vertical bar theta(i), theta(j)), with i < j, are the same. Just as with the classical Ramsey theorem, we also obtain an analogous finitary stochastic Ramsey theorem. Furthermore, with appropriate finiteness assumptions, the time one must wait for the last stopping time (in the finitary case) is uniformly bounded, independently of the probability transitions. We generalise the results to any finite number k of colours.

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

http://eprints.lse.ac.uk/35537/

Resource license