arXiv Analytics

Sign in

arXiv:0903.4749 [math.PR]AbstractReferencesReviewsResources

Three problems for the clairvoyant demon

Geoffrey Grimmett

Published 2009-03-27, updated 2009-06-28Version 2

A number of tricky problems in probability are discussed, having in common one or more infinite sequences of coin tosses, and a representation as a problem in dependent percolation. Three of these problems are of `Winkler' type, that is, they ask about what can be achieved by a clairvoyant demon.

Comments: Minor changes made for v2
Categories: math.PR
Subjects: 60K35, 82B20, 60E15
Related articles: Most relevant | Search more
arXiv:math/0210015 [math.PR] (Published 2002-10-01)
Separated-occurrence inequalities for dependent percolation and Ising models
arXiv:math/0302059 [math.PR] (Published 2003-02-06)
The Clairvoyant Demon Has a Hard Task
arXiv:math/0011008 [math.PR] (Published 2000-11-01, updated 2003-01-18)
Compatible sequences and a slow Winkler percolation

Links

Toolbox