Nonintersecting couplings of random walks in dimensions three and four
Statement
Can two simple random walks on or , started at vertices at graph distance , be coupled so that their paths are disjoint with positive probability?
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.