Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 27 Oct 2022 in math.PR, math-ph, and math.MP

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.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets