Scheduling of Non-Colliding Random Walks
DOI10.1007/978-981-15-0302-3_4zbMath1446.82026arXiv1411.4041OpenAlexW3090395522MaRDI QIDQ3297346
Riddhipratim Basu, Allan Sly, Vladas Sidoravićius
Publication date: 3 July 2020
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.4041
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Renormalization group methods in equilibrium statistical mechanics (82B28) Percolation (82B43) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Boundary theory for Markov processes (60J50) Jump processes on discrete state spaces (60J74)
Related Items (3)
Cites Work
- Unnamed Item
- Lipschitz embeddings of random sequences
- Avoidance coupling
- Corner percolation on \(\mathbb Z^{2}\) and the square root of 17
- On rough isometries of Poisson processes on the line
- Vacant set of random interlacements and percolation
- On the statistics of vision: The Julesz conjecture
- Dependent percolation in two dimensions
- The Clairvoyant Demon Has a Hard Task
- Percolation of arbitrary words in one dimension
- Three problems for the clairvoyant demon
- Collisions Among Random Walks on a Graph
- Clairvoyant embedding in one dimension
- Submodular Percolation
- On a Form of Coordinate Percolation
- Compatible Sequences and a Slow Winkler Percolation
- Clairvoyant scheduling of random walks
- On the Compatibility of Binary Sequences
This page was built for publication: Scheduling of Non-Colliding Random Walks