The biased edge-reinforced random walk transience conjecture
Statement
Let , and consider the -biased edge-reinforced random walk on , in which the transition probability at a node is weighted by the current edge weights with bias parameter . A walk on is transient if each node is visited only finitely often almost surely.
Biased edge-reinforced random walk transience conjecture. The -biased edge-reinforced random walk is transient whenever .
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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.