Library Header Image
LSE Research Online LSE Library Services

A stochastic Ramsey theorem

Xu, Zibo (2011) A stochastic Ramsey theorem. Journal of Combinatorial Theory, Series A, 118 (4). pp. 1392-1409. ISSN 0097-3165

Full text not available from this repository.
Identification Number: 10.1016/j.jcta.2010.11.019


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.

Item Type: Article
Additional Information: © 2011 Elsevier
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 21 Apr 2011 09:29
Last Modified: 16 May 2024 01:14

Actions (login required)

View Item View Item