Related papers: Fluctuations of Discrete-Time Random Walks

In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…

Extensive empirical investigation has shown that a plethora of real networks synchronously exhibit scale-free and modular structure, and it is thus of great importance to uncover the effects of these two striking properties on various…

This is the third in a series of papers in which we consider one-dimensional Random Walk in Cooling Random Environment (RWCRE). The latter is obtained by starting from one-dimensional Random Walk in Random Environment (RWRE) and resampling…

Starting from a simple animal-biology example, a general, somewhat counter-intuitive property of diffusion random walks is presented. It is shown that for any (non-homogeneous) purely diffusing system, under any isotropic uniform incidence,…

Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…

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 formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2 on which this is based. The framework has no need for coin…

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…

Let H(n) be the group of 3x3 uni-uppertriangular matrices with entries in Z/nZ, the integers mod n. We show that the simple random walk converges to the uniform distribution in order n^2 steps. The argument uses Fourier analysis and is…

We prove the non-equilibrium fluctuations for the one-dimensional symmetric simple exclusion process with a slow bond. This generalizes a result of T. Franco, A. Neumann and P. Gon\c{c}alves (2013), which dealt with the equilibrium…

In random walk theory, it is customary to assume that a given walk is irreducible and/or aperiodic. While these prevailing assumptions make particularly tractable the analysis of random walks and help to highlight their diffusive nature,…

We give the first example of faster transport with a quantum walk on an inherently directed graph, on the directed line with a variable number of self-loops at each vertex. These self-loops can be thought of as adding a number of small…

We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…

Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…

Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…

We study a one-dimensional random walk whose expected drift depends both on time and the position of a particle. We establish a non-trivial phase transition for the recurrence vs. transience of the walk, and show some interesting…

The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…

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,…

Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…

We consider a continuous-time random walk which is the generalization, by means of the introduction of waiting periods on sites, of the one-dimensional nonhomogeneous random walk with a position-dependent drift known in the mathematical…