Related papers: Fluctuations of Discrete-Time Random Walks

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 consider the dynamics of lattice random walks with resetting. The walker moving randomly on a lattice of arbitrary dimensions resets at every time step to a given site with a constant probability $r$. We construct a discrete renewal…

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…

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…

A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of…

General upper bounds on fluctuations of trajectory observables were recently obtained. It turned out that the size of fluctuations of dynamical observable is limited from below and from above. For the moment generating function of general…

We consider random walks on comb- and brush-like graphs consisting of a base (of fractal dimension $D$) decorated with attached side-groups. The graphs are also characterized by the fractal dimension $D_a$ of a set of anchor points where…

The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…

Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a…

We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…

This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…

We analyze the dynamics of moderate fluctuations for macroscopic observables of the random field Curie Weiss model (i.e., standard Curie-Weiss model embedded in a site dependent, i.i.d. random environment). We obtain path space large…

We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…

In this paper we analyse random walk on a fractal structure, specifi- cally fractal curves, using the recently develped calculus for fractal curves. We consider only unbiased random walk on the fractal stucture and find out the…

We generalize the quantum random walk protocol for a particle in a one-dimensional chain, by using several types of biased quantum coins, arranged in aperiodic sequences, in a manner that leads to a rich variety of possible wave function…

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…

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

We present a continuous time generalization of a random walk with complete memory of its history [Phys. Rev. E 70, 045101(R) (2004)] and derive exact expressions for the first four moments of the distribution of displacement when the number…

We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…