Mutually avoiding competing random walks
Statement
Run two walks with a common clock on , each choosing uniformly among neighbors not previously visited by the other walk. Prove that in one walk is almost surely trapped in a finite region, while in higher dimensions neither walk is trapped almost surely.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.