Related papers: Prudent walk in dimension six and higher

In this paper we study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths,…

In this article, a localisation result is proved for the biased random walk on the range of a simple random walk in high dimensions (d \geq 5). This demonstrates that, unlike in the supercritical percolation setting, a slowdown effect…

We are interested in the branching capacity of the range of a random walk in $\mathbb Z^d$.Schapira [28] has recently obtained precise asymptotics in the case $d\ge 6$ and has demonstrated a transition at dimension $d=6$. We study the case…

A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…

Consider the dynamic environment governed by a Poissonian field of independent particles evolving as simple random walks on $\mathbb{Z}^d$. The random walk on random walks model refers to a particular stochastic process on $\mathbb{Z}^d$…

We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…

We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…

Brownian motion with darning (BMD in abbreviation) is introduced and studied in [4] and [5, Chapter 7]. Roughly speaking, BMD travels across the "darning area" at infinite speed, while it behaves like a regular BM outside of this area. In…

We consider a one-dimensional random walk among biased i.i.d. conductances, in the case where the random walk is transient but sub-ballistic: this occurs when the conductances have a heavy-tail at $+\infty$ or at $0$. We prove that the…

We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…

We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\sim\beta/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is…

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…

This article is dedicated to the study of the 2-dimensional interacting prudent self-avoiding walk (referred to by the acronym IPSAW) and in particular to its collapse transition. The interaction intensity is denoted by $\beta>0$ and the…

We study the scaling limit of a branching random walk in static random environment in dimension $d=1,2$ and show that it is given by a super-Brownian motion in a white noise potential. In dimension $1$ we characterize the limit as the…

We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…

We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…

We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to $33 \times 10^6$ steps. Consequently the critical exponent $\nu$ for…

We study the number $c_n^{(N)}$ of $n$-step self-avoiding walks on the $N$-dimensional hypercube, and identify an $N$-dependent \emph{connective constant} $\mu_N$ and amplitude $A_N$ such that $c_n^{(N)}$ is $O(\mu_N^n)$ for all $n$ and…

We investigate the lattice walk performed by a tagged member of an infinite `sea' of particles filling a d-dimensional lattice, in the presence of a Brownian vacancy. Particle-particle exchange is forbidden; the only interaction between…

We consider a self-avoiding walk on the $d$-dimensional hypercubic lattice, terminally attached to an impenetrable hyperplane at which it can adsorb. When a force is applied the walk can be pulled off the surface and we consider the…