Related papers: Random Walk Approach to Simple Evolution Model

We analyze the dynamics of random walks in which the jumping probabilities are periodic {\it time-dependent} functions. In particular, we determine the survival probability of biased walkers who are drifted towards an absorbing boundary.…

The deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk,…

The cover-time problem, i.e., time to visit every site in a system, is one of the key issues of random walks with wide applications in natural, social, and engineered systems. Addressing the full distribution of cover times for random walk…

We consider a random walk with death in $[-N,N]$ moving in a time dependent environment. The environment is a system of particles which describes a current flux from $N$ to $-N$. Its evolution is influenced by the presence of the random…

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…

We consider a continuous-time branching random walk on a multidimensional lattice in a random branching medium. It is theoretically known that, in such branching random walks, large rare fluctuations of the medium may lead to anomalous…

A new class of one-dimensional, discrete time random walk model with memory, termed "Random walk with $n$ memory channels" (RW$n$MC) is proposed. In this model the information of $n$ ($n\in \mathbb{Z}$) previous steps from the walker's…

We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…

We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

Let X_0=0, X_1, X_2, ..., be an aperiodic random walk generated by a sequence xi_1, xi_2, ..., of i.i.d. integer-valued random variables with common distribution p(.) having zero mean and finite variance. For an N-step trajectory…

We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

We calculate numerically the sizes S of jumps (avalanches) between successively pinned configurations of an elastic line (d=1) or interface (d=2), pulled by a spring of (small) strength m^2 in a random-field landscape. We obtain strong…

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…

We consider Activated Random Walks on $\Z$ with totally asymmetric jumps and critical particle density, with different time scales for the progressive release of particles and the dissipation dynamics. We show that the cumulative flow of…

We study the gambler's ruin problem for the Elephant Random Walk, focusing on escape time from a symmetric interval of the form $\{-N, \ldots, N\}$. As our main result, we derive tight exponential bounds for the tail of this escape time. We…

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

In this article, we first give a comprehensive description of random walk (RW) problem focusing on self-similarity, dynamic scaling and its connection to diffusion phenomena. One of the main goals of our work is to check how robust the RW…

We consider the Bak-Tang-Wiesenfeld sandpile model on a two-dimensional square lattice of lattice sizes up to L=4096. A detailed analysis of the probability distribution of the size, area, duration and radius of the avalanches will be…