Three problems for the clairvoyant demon

MaRDI QIDQ3078001zbMATH OpenFDO

Authors G. R. Grimmett

Publication date 18 February 2011

Full work available at URL https://arxiv.org/abs/0903.4749

zbMATH Keywords

clairvoyant demondependent percolationmultiscale analysispercolationpercolation of wordsrandom walk

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: 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.

Recommendations

• Probability problems of Dobrushin type
• scientific article; zbMATH DE number 4066010
• Classic problems of probability
• Clairvoyant embedding in one dimension
• scientific article; zbMATH DE number 493074

Cited in

(6)

• The clairvoyant demon has a hard task
• Percolation of Words on Z^d with Long-Range Connections
• Scheduling of non-colliding random walks
• Lipschitz embeddings of random sequences
• Avoidance couplings on non‐complete graphs
• Lattice embeddings in percolation

This page was built for publication: Three problems for the clairvoyant demon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078001)