The five-site localization conjecture for vertex-reinforced random walks

Let ww be a nondecreasing weight sequence satisfying

n=01w(n)=.\sum_{n=0}^{\infty}\frac{1}{w(n)}=\infty.

Extend ww to the positive reals by w(t)=w(t)w(t)=w(\lfloor t\rfloor), define

W(t)=0t1w(u)du,W(t)=\int_0^t\frac{1}{w(u)}\,du,

and let W1W^{-1} be its inverse. Set

Iα(w)=0dxw(W1(W(x)+α)),I_\alpha(w)=\int_0^\infty\frac{dx}{w\bigl(W^{-1}(W(x)+\alpha)\bigr)}, αc(w)=inf{α0:Iα(w)<},\alpha_c(w)=\inf\{\alpha\geq 0:I_\alpha(w)<\infty\},

and, with W1(u)=0W^{-1}(u)=0 for u<0u<0,

Jβ(w)=0dxw(W1(2W(x)+β)),βc(w)=inf{βR:Jβ(w)<}.J_\beta(w)=\int_0^\infty\frac{dx}{w\bigl(W^{-1}(2W(x)+\beta)\bigr)},\qquad \beta_c(w)=\inf\{\beta\in\mathbb{R}:J_\beta(w)<\infty\}.

Let RR' be the set of sites visited infinitely often. Five-site localization conjecture. If αc(w)=\alpha_c(w)=\infty, then

P(R=5)>0P(R=5)=1βc(w)<.\mathbb{P}(|R'|=5)>0\quad\Longleftrightarrow\quad \mathbb{P}(|R'|=5)=1\quad\Longleftrightarrow\quad \beta_c(w)<\infty.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.