2000 character limit reached
The random walk penalised by its range in dimensions $d\geq 3$ (1811.04700v2)
Published 12 Nov 2018 in math.PR
Abstract: 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$.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.