Abstract
We define a class of weakly self-avoiding walks on the integers by conditioning a simple random walk of length n to have a p-fold self-intersection local time smaller than n β, where 1<β<(p+1)/2. We show that the conditioned paths grow of order n α, where α=(p−β)/(p−1), and also prove a coarse large deviation principle for the order of growth.
Similar content being viewed by others
References
Bass, R.F., Chen, X., Rosen, J.: Moderate deviations and law of the iterated logarithm for the renormalized self-intersection local times of planar random walks. Electron. J. Probab. 11, 993–1030 (2006)
Lawler, G.F.: Intersections of Random Walks. Birkhäuser, Boston (1991)
Mörters, P., Ortgiese, M.: Small value probabilities via the branching tree heuristic. Bernoulli 14, 277–299 (2008)
van der Hofstad, R., König, W.: A survey of one-dimensional polymers. J. Stat. Phys. 103, 915–944 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mörters, P., Sidorova, N. A Class of Weakly Self-Avoiding Walks. J Stat Phys 133, 255–269 (2008). https://doi.org/10.1007/s10955-008-9619-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-008-9619-7