Avoidance couplings on non‐complete graphs

DOI10.1002/rsa.20999zbMath1522.05411arXiv2001.11524OpenAlexW3133323677MaRDI QIDQ6074647

Erik Bates, Moumanti Podder

Publication date: 12 October 2023

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

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

zbMATH Keywords

regular graphsquare-free graphavoidance coupling

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Avoidance coupling
• Corner percolation on \(\mathbb Z^{2}\) and the square root of 17
• Dependent percolation in two dimensions
• The Clairvoyant Demon Has a Hard Task
• Three problems for the clairvoyant demon
• Collisions Among Random Walks on a Graph
• Scheduling of Non-Colliding Random Walks
• Submodular Percolation
• On a Form of Coordinate Percolation
• Paths in graphs
• An Upper Bound on the Size of Avoidance Couplings
• Monotonicity of Avoidance Coupling on K_N
• Clairvoyant scheduling of random walks

This page was built for publication: Avoidance couplings on non‐complete graphs