Related papers: A note on spider walks
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
We investigate the steady-state organisation of active particles residing on an interface. Particle activity induces interface deformations, while the local shape of the interface guides particle movement. We consider multiple species of…
Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…
Stochastic processes of interacting particles with varying length are relevant e.g. for several biological applications. We try to explore what kind of new physical effects one can expect in such systems. As an example, we extend the…
We introduce a model of a quantum walk on a graph in which a particle jumps between neighboring nodes and interacts with independent spins sitting on the edges. Entanglement propagates with the walker. We apply this model to the case of a…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…
It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time…
In this paper we study some properties of random walks perturbed at extrema, which are generalizations of the walks considered e.g., in Davis (1999). This process can also be viewed as a version of {\em excited random walk}, studied…
The paper is devoted to the relationship between the continuous Markovian description of Levy flights developed previously and their equivalent representation in terms of discrete steps of a wandering particle, a certain generalization of…
We study a system of particles moving on a line in the same direction. Passing is allowed and when a fast particle overtakes a slow particle, it acquires a new velocity drawn from a distribution P_0(v), while the slow particle remains…
Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is…
We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
We study the motion of random walkers with residence time bias between first and subsequent visits to a site, as a model for synthetic molecular walkers composed of coupled DNAzyme legs known as molecular spiders. The mechanism of the…
The paper presents a multidimensional model for nonlinear Markovian random walks that generalizes one we developed previously (Phys. Rev. E v.79, 011110, 2009) in order to describe the Levy type stochastic processes in terms of continuous…