Related papers: Decomposing Correlated Random Walks on Common and …
The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…
In this paper, martingales related to simple random walks and their maximum process are investigated. First, a sufficient condition under which a function with three arguments, time, the random walk, and its maximum process becomes a…
We present a systematic method for constructing stochastic processes by modifying simpler, analytically solvable random walks on discrete lattices. Our framework integrates the Doob $h$-transformation with the Montroll defect theory,…
In this Chapter, we consider a model of $N$ independent random walkers, each of duration $t$, and each starting from the origin, on a lattice in $d$ dimensions. We focus on two observables, namely $D_N(t)$ and $C_N(t)$ denoting respectively…
Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…
We develop a framework to determine the complete statistical behavior of a fundamental quantity in the theory of random walks, namely, the probability that $n_1$, $n_2$, $n_3$, . . . distinct sites are visited at times $t_1$, $t_2$, $t_3$,…
We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…
The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
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.…
One goal in the quantum-walk research is the exploitation of the intrinsic quantum nature of multiple walkers, in order to achieve the full computational power of the model. Here we study the behaviour of two non-interacting particles…
In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…
We consider a simple model for active random walk with general temporal correlations, and investigate the shape of the probability distribution function of the displacement during a short time interval. We find that under certain conditions…
We study a model of bacterial dynamics where two interacting random walkers perform run-and-tumble motion on a one-dimensional lattice under mutual exclusion and find an exact expression for the probability distribution in the steady state.…
Superslow diffusion, i.e., the long-time diffusion of particles whose mean-square displacement (variance) grows slower than any power of time, is studied in the framework of the decoupled continuous-time random walk model. We show that this…
We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties for the environment as seen from the position of the walker,…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
This paper presents some first results on how to perform uniform random walks (where every trace has the same probability to occur) in very large models. The models considered here are described in a succinct way as a set of communicating…