Continuous-time weakly self-avoiding walk on mathbb{Z} has strictly monotone escape speed
classification
🧮 math.PR
math-phmath.MP
keywords
speedwalkself-avoidingstrictlyweaklycontinuous-timeescapeincreasing
read the original abstract
Weakly self-avoiding walk (WSAW) is a model of simple random walk paths that penalizes self-intersections. On $\mathbb{Z}$, Greven and den Hollander proved in 1993 that the discrete-time weakly self-avoiding walk has an asymptotically deterministic escape speed, and they conjectured that this speed should be strictly increasing in the repelling strength parameter. We study a continuous-time version of the model, give a different existence proof for the speed, and prove the speed to be strictly increasing. The proof uses a transfer matrix method implemented via a supersymmetric version of the BFS--Dynkin isomorphism theorem, spectral theory, Tauberian theory, and stochastic dominance.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.