We prove that the planar balanced excited random walk $M(2,1,2)$ is recurrent. This walk takes a horizontal simple random walk step on its first departure from each vertex and a planar simple random walk step on every later departure. Moreover, the number of distinct vertices visited before time $n$, multiplied by $(\log n)/n$, converges to $\pi$ almost surely and in every $L^p$, $1\le p<\infty$, the same limit as for the planar simple random walk. More generally, we prove recurrence of balanced excited random walks in spatially inhomogeneous cookie environments whenever the total positive and negative cookie strengths at each vertex are bounded by constants $A, B$ with $A+B<1+1/(2\pi +1)$.
We consider a once-excited random walk on $\mathbb{Z}^d$, $d \ge 2$, where the walk on its first visit has a bias of constant strength $\beta>0$ toward the origin and moves like a simple symmetric random walk on subsequent visits to that site. We show that the walk is recurrent and prove an almost sure spherical shape...
We study the limit shape of the range of the random walk excited to the center on $\mathbb Z^d$, with $d\geq2$. A cookie is placed at each nonzero vertex. On its first visit to such a vertex, the walker consumes the cookie and takes its next nearest-neighbor step with a bias toward the origin. On a visit to the origin,...
We consider a competition between two independent random walks on a cycle of length $N$. Each vertex is claimed by the walker that visits it first, and remains claimed thereafter. We prove that if the initial distance between the walkers is $d$, then the expected number of edges whose endpoints are claimed by different...
S. Chatterjee, Nadya Nabahi, Grigory Terlov· 1 citation
We study cover times on discrete tori and ranges on $\mathbb{Z}^d$ for elephant random walks with memory parameter $p\in[0,1)$. In dimension one there is a phase transition at $p=3/4$. Away from criticality we determine the exact first-order asymptotics of the mean cover time, while at $p=3/4$ the mean is of order $L^2...
Let $(c_t)_{t\geq 0}$ be a deterministic family of edge conductances on a countable vertex set, monotone in $t$, and let $(X_t)$ be the random walk that takes its $t$-th step using the conductances $c_t$. We prove that if $c_t\uparrow c_\infty$ and $c_\infty$ is recurrent (respectively, $c_0$ is transient), then $(X_t)...
We study the mixing time of a simple random walk on the small-world network defined by adding edges to $\mathbb{Z}_n^d$ as follows: for each pair $\{x,y\}$ we add an edge with probability $Z_n/\|x-y\|^{d}$ with $Z_n$ chosen so that the average number of added edges to every vertex is $1$. When $d\geq 3$, we show that w...
Z. Baran, J. Hermon, Anđela Šarković et al.· 3 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
