The five-site localization conjecture for vertex-reinforced random walks
Statement
Let be a nondecreasing weight sequence satisfying
Extend to the positive reals by , define
and let be its inverse. Set
and, with for ,
Let be the set of sites visited infinitely often. Five-site localization conjecture. If , then
This conjecture characterizes both positive-probability and almost-sure localization on five sites. The almost-sure part is described as particularly difficult; the paper recalls that it is known for linear weights, while the general characterization remains open.
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.