Related papers: Persistent random walk on a one-dimensional lattic…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The model was originally proposed and analyzed in Maragakis et…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…
We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…
We study in detail a one-dimensional lattice model of a continuum, conserved field (mass) that is transferred deterministically between neighbouring random sites. The model falls in a wider class of lattice models capturing the joint effect…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
A fundamental insight in the theory of diffusive random walks is that the mean length of trajectories traversing a finite open system is independent of the details of the diffusion process. Instead, the mean trajectory length depends only…
We study the diffusion process through an ideal polymer network, using numerical methods. Polymers are modeled by random walks on the bonds of a two-dimensional square lattice. Molecules occupy the lattice cells and may jump to the…
Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven…
Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…
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…
Asymptotic estimates of the hitting distribution of a long segment on the real axis for two dimensional random walks on ${\bf Z}^2$ of zero mean and finite variances are obtained: some are general and exhibit its apparent similarity to the…
We have studied a model of self-attracting walk proposed by Sapozhnikov using Monte Carlo method. The mean square displacement $ < R^2(t) > \sim t^{2\nu}$ and the mean number of visited sites $ < S(t) > \sim t^{k}$ are calculated for one-,…
Low-dimensional periodic arrays of scatterers with a moving point particle are ideal models for studying deterministic diffusion. For such systems the diffusion coefficient is typically an irregular function under variation of a control…
We present analytical results for the biased diffusion of particles moving under a constant force in a randomly layered medium. The influence of this medium on the particle dynamics is modeled by a piecewise constant random force. The…
When random walks on a square lattice are biased horizontally to move solely to the right, the probability distribution of their algebraic area can be exactly obtained. We explicitly map this biased classical random system on a non…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
A straightforward analytical scheme is proposed for computing the long-time, asymptotic mean velocity and dispersivity (effective diffusivity) of a particle undergoing a discrete biased random walk on a periodic lattice amongst an array of…