Dichotomy conjecture for the directed edge-reinforced random walk
Statement
Let be an infinite graph, and let denote the directed edge-reinforced random walk on . For each circuit in , let be the event that the walk becomes trapped in , and let be the shortest-path distance on .
Dichotomy conjecture. One has
In other words, the walk either gets trapped in a circuit or escapes to infinity. The conjecture is posed for infinite graphs in light of the preceding discussion and the stated theorem; the supplied text does not indicate whether it has been resolved.
Record
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.