Clairvoyant scheduling of random walks

DOI10.1002/rsa.20368zbMath1238.05255arXivmath/0109152OpenAlexW2156902791MaRDI QIDQ5388970

Peter Gács

Publication date: 24 April 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

percolationrenormalizationhierarchyclairvoyant demonclairvoyant schedulingcoordinate percolation

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Random walks on graphs (05C81)

Related Items (8)

Clairvoyant embedding in one dimension ⋮ Lipschitz embeddings of random sequences ⋮ Avoidance couplings on non‐complete graphs ⋮ Monotonicity of Avoidance Coupling on K_N ⋮ Scheduling of Non-Colliding Random Walks ⋮ Bernoulli line percolation ⋮ Subcritical $\mathcal {U}$-bootstrap percolation models have non-trivial phase transitions ⋮ An Upper Bound on the Size of Avoidance Couplings

Cites Work

• Unnamed Item
• The Clairvoyant Demon Has a Hard Task
• Collisions Among Random Walks on a Graph
• Compatible Sequences and a Slow Winkler Percolation

This page was built for publication: Clairvoyant scheduling of random walks