arXiv Analytics

Sign in

arXiv:1811.04700 [math.PR]AbstractReferencesReviewsResources

The random walk penalised by its range in dimensions $d\geq 3$

Nathanael Berestycki, Raphael Cerf

Published 2018-11-12Version 1

We study a self-attractive random walk such that each trajectory of length $N$ is penalised by a factor proportional to $\exp ( - |R_N|)$, where $R_N$ is the set of sites visited by the walk. We show that the range of such a walk is close to a solid Euclidean ball of radius approximately $\rho_d N^{1/(d+2)}$, for some explicit constant $\rho_d >0$. This proves a conjecture of Bolthausen who obtained this result in the case $d=2$.

Related articles: Most relevant | Search more
arXiv:0704.0582 [math.PR] (Published 2007-04-04)
Continuous interfaces with disorder: Even strong pinning is too weak in 2 dimensions
arXiv:1305.5444 [math.PR] (Published 2013-05-23, updated 2015-08-17)
The time of bootstrap percolation in two dimensions
arXiv:1706.07338 [math.PR] (Published 2017-06-22)
Polluted Bootstrap Percolation in Three Dimensions