Related papers: Fourier-Walsh coefficients for a coalescing flow (…
A particle subject to successive, random displacements is said to execute a random walk (in position or some other coordinate). The mathematical properties of random walks have been very thoroughly investigated, and the model is used in…
This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to become active, while a jump to one of its neighbors depends…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified…
We address the question whether the sequence of areas between coalescing random walkers displays multiscaling and in the process calculate the second moment as well as the two point correlation function exactly. The scaling of higher order…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
The behaviour of random quantum walks is known to be diffusive. Here we study discrete time quantum walks in weak stochastic gauge fields. In the case of position and spin dependent gauge field, we observe a transition from ballistic to…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…
We study a system of coalescing continuous-time random walks starting from every site on $\mathbb{Z}$, where the jump increments lie in the domain of attraction of an $\alpha$-stable distribution with $\alpha\in(0,1]$. We establish sharp…
"Oscillations" occur in quite different kinds of many-particle-systems when two groups of particles with different directions of motion meet or intersect at a certain spot. We present a model of pedestrian motion that is able to reproduce…
We derive a probabilistic representation for the Fourier symbols of the generators of some stable processes.
Aging refers to the property of two-time correlation functions to decay very slowly on (at least) two time scales. This phenomenon has gained recent attention due to experimental observations of the history dependent relaxation behavior in…
Elephant random walk is a kind of one-dimensional discrete-time random walk with infinite memory: For each step, with probability $\alpha$ the walker adopts one of his/her previous steps uniformly chosen at random, and otherwise he/she…
In an experiment of oscillatory media, domains and walls are formed under the parametric resonance with a frequency double the natural one. In this bi-stable system, %phase jumps $\pi$ by crossing walls. a nonequilibrium transition from…
We consider the multi-time correlation and covariance structure of a random surface growth with a wall introduced in arXiv:0904.2607. It is shown that the correlation functions associated with the model along space-like paths have…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
We calculate the diffusion coefficients of persistent random walks on lattices, where the direction of a walker at a given step depends on the memory of a certain number of previous steps. In particular, we describe a simple method which…
The dynamical discrete web is a system of one-dimensional coalescing random walks that evolves in an extra dynamical time parameter. At any deterministic dynamical time, the paths behave as coalescing simple symmetric random walks. This…