Related papers: A deterministic walk on the randomly oriented Manh…
We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and…
Is it possible to draw a circle in Manhattan, using only its discrete network of streets and boulevards? In this study, we will explore the construction and properties of circular paths on an integer lattice, a discrete space where the…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
We consider random walks in i.i.d. elliptic random environments which are not uniformly elliptic. We introduce a computable condition in dimension $d=2$ and a general condition valid for dimensions $d\ge 2$ expressed in terms of the exit…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
This note describes recent results on the localization properties of Random Quantum Walks on the d-dimensional lattice in a regime analogous to the large disorder regime by means of the Fractional Moments Method adapted to the unitary…
We consider the problem of searching a general $d$-dimensional lattice of $N$ vertices for a single marked item using a continuous-time quantum walk. We demand locality, but allow the walk to vary periodically on a small scale. By…
We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…
We consider localization of a random walk (RW) when attracted or repelled by multiple extended manifolds of different dimensionalities. In particular, we focus on $(d-1)$- and $(d-2)$-dimensional manifolds in $d$-dimensional space, where…
We realize a pair of simultaneous ten-step one-dimensional quantum walks with two walkers sharing coins, which we prove is analogous to the ten-step two-dimensional quantum walk with a single walker holding a four-dimensional coin. Our…
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…
Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…
The Martin boundary associated with the simple random walk on an example of partially oriented lattice is shown to be trivial by computing fine estimates of the Green kernel.
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
The Grover walk, which is related to the Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk starting from a fixed point is striking…