Related papers: Decomposing Correlated Random Walks on Common and …
Active walker models have proved to be extremely effective in understanding the evolution of a large class of systems in biology like ant trail formation and pedestrian trails. We propose a simple model of a random walker which modifies its…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…
We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
The random walk is a fundamental stochastic process that underlies many numerical tasks in scientific computing applications. We consider here two neural algorithms that can be used to efficiently implement random walks on spiking…
We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…
Random walks on general graphs play an important role in the understanding of the general theory of stochastic processes. Beyond their fundamental interest in probability theory, they arise also as simple models of physical systems. A brief…
We introduce a one-dimensional random walk, which at each step performs a reinforced dynamics with probability $\theta$ and with probability $1 - \theta$, the random walk performs a step independent of the past. We analyse its asymptotic…
In this paper, we investigate the quest for a single target, that remains fixed in a lattice, by a set of independent walkers. The target exhibits a fluctuating behavior between trap and ordinary site of the lattice, whereas the walkers…
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
The Half-Plane Half-Comb walk is a random walk on the plane, when we have a square lattice on the upper half-plane and a comb structure on the lower half-plane, i.e. horizontal lines below the x-axis are removed. We prove that the…
Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…
Applied to statistical physics models, the random cost algorithm enforces a Random Walk (RW) in energy (or possibly other thermodynamic quantities). The dynamics of this procedure is distinct from fixed weight updates. The probability for a…
This paper discusses the possibility to find and construct \textit{piecewise constant martingales}, that is, martingales with piecewise constant sample paths evolving in a connected subset of $\mathbb{R}$. After a brief review of standard…
Consider a continuous time random walk in $\mathbb{Z}$ with independent and exponentially distributed jumps $\pm1$. The model in this paper consists in an infinite number of such random walks starting from the complement of…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…