The five-site localization conjecture for vertex-reinforced random walks
The five-site localization conjecture for vertex-reinforced random walks
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.
Sources & referencesView supporting material
Primary source
Bruno Schapira, “Localization on 5 sites for vertex reinforced random walks: Towards a characterization”, arXiv:1905.05974 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.