Related papers: Anomalous diffusion of random walk on random plana…

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…

We address the question of distance record-setting by a random walker in the presence of measurement error, $\delta$, and additive noise, $\gamma$ and show that the mean number of (upper) records up to $n$ steps still grows universally as…

Suppose that $X$ is a simple random walk on $\Z_n^d$ for $d \geq 3$ and, for each $t$, we let $\U(t)$ consist of those $x \in \Z_n^d$ which have not been visited by $X$ by time $t$. Let $\tcov$ be the expected amount of time that it takes…

We introduce and study the uniform infinite planar quadrangulation (UIPQ) with a boundary via an extension of the construction of arXiv:1201.1052. We then relate this object to its simple boundary analog using a pruning procedure. This…

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

We study the order statistics of a random walk (RW) of $n$ steps whose jumps are distributed according to symmetric Erlang densities $f_p(\eta)\sim |\eta|^p \,e^{-|\eta|}$, parametrized by a non-negative integer $p$. Our main focus is on…

Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…

Let H(n) be the group of 3x3 uni-uppertriangular matrices with entries in Z/nZ, the integers mod n. We show that the simple random walk converges to the uniform distribution in order n^2 steps. The argument uses Fourier analysis and is…

We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C, there exists a=a(D,C)>0 such that for any graph G, with n vertices and…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

In search for mathematically tractable models of anomalous diffusion, we introduce a simple dynamical system consisting of a chain of coupled maps of the interval whose Lyapunov exponents vanish everywhere. The volume preserving property…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

In a \emph{rotor walk} the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in $\R^d$, we show that any simple rotor walk, regardless of rotor mechanism or initial rotor…

We consider a discrete-time quantum walk, called the Grover walk, on a distance regular graph $X$. Given that $X$ has diameter $d$ and invertible adjacency matrix, we show that the square of the transition matrix of the Grover walk on $X$…

The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…

Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…

We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…

We consider quantum walks with position dependent coin on 1D lattice $\mathbb{Z}$. The dispersive estimate $\|U^tP_c u_0\|_{l^\infty}\lesssim (1+|t|)^{-1/3} \|u_0\|_{l^1}$ is shown under $l^{1,1}$ perturbation for the generic case and…

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

It is recognised now that a variety of real-life phenomena ranging from diffuson of cold atoms to motion of humans exhibit dispersal faster than normal diffusion. L\'evy walks is a model that excelled in describing such superdiffusive…