Continuous-time weakly self-avoiding walk on $\mathbb{Z}$ has strictly monotone escape speed

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.

35 pages, 1 figure. Minor edits. To appear in Ann. Appl. Probab

References in corpus (5)

• Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
• Introduction to a renormalisation group method
• Critical two-point function of the 4-dimensional weakly self-avoiding walk
• Joint density for the local times of continuous-time Markov chains
• Mean-field tricritical polymers