Related papers: Simple random walk on the uniform infinite planar …

We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…

In this work, we study open quantum random walks, as described by S. Attal et al. These objects are given in terms of completely positive maps acting on trace-class operators, leading to one of the simplest open quantum versions of the…

We consider a supercritical branching random walk in time-inhomogeneous random environment with a random absorption barrier, i.e.,in each generation, only the individuals born below the barrier can survive and reproduce. Assume that the…

Starting from a simple animal-biology example, a general, somewhat counter-intuitive property of diffusion random walks is presented. It is shown that for any (non-homogeneous) purely diffusing system, under any isotropic uniform incidence,…

We address the scattering of a quantum particle by a one-dimensional barrier potential over a set of discrete positions. We formalize the problem as a continuous-time quantum walk on a lattice with an impurity, and use the quantum Fisher…

A method is described to count simple diagonal walks on $\mathbb{Z}^2$ with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller…

The first detection of a quantum particle on a graph has been shown to depend sensitively on the sampling time {\tau} . Here we use the recently introduced quantum renewal equation to investigate the statistics of first detection on an…

We study the elephant random walk in arbitrary dimension $d\geq 1$. Our main focus is the limiting random variable appearing in the superdiffusive regime. Building on a link between the elephant random walk and P\'olya-type urn models, we…

We prove two results on the delocalization of the endpoint of a uniform self-avoiding walk on Z^d for d>1. We show that the probability that a walk of length n ends at a point x tends to 0 as n tends to infinity, uniformly in x. Also, for…

Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such…

Let $\tau = (\tau_i : i \in {\Bbb Z})$ denote i.i.d.~positive random variables with common distribution $F$ and (conditional on $\tau$) let $X = (X_t : t\geq0, X_0=0)$, be a continuous-time simple symmetric random walk on ${\Bbb Z}$ with…

We prove a lower bound on the size of bottlenecks in uniform quadrangulations, valid at all scales simultaneously. We use it to establish upper bounds on the uniform mixing time of the lazy random walk on uniform quadrangulations, as well…

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…

We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…

Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…

We consider a random walk among a Poisson cloud of moving traps on ${\mathbb Z}^d$, where the walk is killed at a rate proportional to the number of traps occupying the same position. In dimension $d=1$, we have previously shown that under…

We present some exact results on the behavior of Branching and Annihilating Random Walks, both in the Directed Percolation and Parity Conserving universality classes. Contrary to usual perturbation theory, we perform an expansion in the…

Infinite sums of i.i.d. random variables discounted by a multiplicative random walk are called perpetuities and have been studied by many authors. The present paper provides a log-type moment result for such random variables under minimal…

We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…

We study the absorption time and spreading rate of the discrete-time quantum walk propagating on a line in the presence or absence of an absorber. We analytically establish that in the presence of an absorber, the average absorption time of…