ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ>0\lambda>0, and consider the λ∗\lambda^\ast-biased edge-reinforced random walk on Z\mathbb{Z}, in which the transition probability at a node is weighted by the current edge weights with bias parameter λ\lambda. A walk on Z\mathbb{Z} is transient if each node is visited only finitely often almost surely.

Biased edge-reinforced random walk transience conjecture. The λ∗\lambda^\ast-biased edge-reinforced random walk is transient whenever λ≠1\lambda\neq1.

The conjecture is motivated by the expected limiting effect of the bias at nodes visited infinitely often. The source states that this has not been proved; the case λ=1\lambda=1 is excluded because it is the unbiased model.

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.