ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an infinite graph, and let XnX_n denote the directed edge-reinforced random walk on GG. For each circuit CC in GG, let TCT^C be the event that the walk becomes trapped in CC, and let d(⋅,⋅)d(\cdot,\cdot) be the shortest-path distance on GG.

Dichotomy conjecture. One has

P(⋃C∈CTC∪{lim⁡n→∞d(Xn,X0)=∞})=1.\mathbb P\left(\bigcup_{C\in\mathscr{C}}T^C\cup\left\{\lim_{n\to\infty}d(X_n,X_0)=\infty\right\}\right)=1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.