Related papers: Critical scaling in standard biased random walks

Stationary probability distributions of one-dimensional random walks on lattices with aperiodic disorder are investigated. The pattern of the distribution is closely related to the diffusional behavior, which depends on the wandering…

We derive an anomalous, sub-diffusive scaling limit for a one-dimensional version of the Mott random walk. The limiting process can be viewed heuristically as a one-dimensional diffusion with an absolutely continuous speed measure and a…

The $\lambda$-biased random walk on a binary tree of depth $n$ is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to…

We first study a model, introduced recently in \cite{ES}, of a critical branching random walk in an IID random environment on the $d$-dimensional integer lattice. The walker performs critical (0-2) branching at a lattice point if and only…

We study the $m=3$ bootstrap percolation model on a cubic lattice, using Monte Carlo simulation and finite-size scaling techniques. In bootstrap percolation, sites on a lattice are considered occupied (present) or vacant (absent) with…

We consider biased random walks in positive random conductances on the d-dimensional lattice in the zero-speed regime and study their scaling limits. We obtain a functional Law of Large Numbers for the position of the walker, properly…

We analyse a biased random walk on a 1D lattice with unequal step lengths. Such a walk was recently shown to undergo a phase transition from a state containing a single connected cluster of visited sites to one with several clusters of…

We recently demonstrated that standard fixed-time lattice random-walk models cannot be modified to properly represent biased diffusion processes in more than two dimensions. The origin of this fundamental limitation appears to be the fact…

In this paper we investigate the scaling limit of the range (the set of visited vertices) for a class of critical lattice models, starting from a single initial particle at the origin. We give conditions on the random sets and an associated…

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…

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 a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…

We introduce range-controlled random walks with hopping rates depending on the range $\mathcal{N}$, that is, the total number of previously distinct visited sites. We analyze a one-parameter class of models with a hopping rate…

The mean first passage time~(MFPT) of random walks is a key quantity characterizing dynamic processes on disordered media. In a random fractal embedded in the Euclidean space, the MFPT is known to obey the power law scaling with the…

The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice is studied numerically. For most concentrations of the scatterers the trajectories close…

The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master…

We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…

We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…

Critical behavior of the contact process is studied in annealed scale-free networks by mapping it on the random walk problem. We obtain the analytic results for the critical scaling, using the event-driven dynamics approach. These results…

We study branching processes in an i.i.d. random environment, where the associated random walk is of the oscillating type. This class of processes generalizes the classical notion of criticality. The main properties of such branching…