In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ρ ∈ (0,∞). At each step the random walk performs a nearest-neighbour jump, moving to the right with probability p◦ when it is on a vacant site and probability p• when it is on an oc...

This paper compiles basic components of the construction of random groups and of the proof of their properties announced in [G10]. Justification of each step, as well as the interrelation between them, is straightforward by available techniques specific to each step. On the other hand, there are several ingredients that cannot be truly appreciated without extending the present framework. We sha...

– The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using the method of moments. When the number of iterations n → ∞, a time-independent asymptotic density is obtained. It has a simple symmetric exponential form ...

We consider the motion of a discrete random surface interacting by exclusion with a random wall. Two cases are considered: rarefied walls and walls of random height. The dynamics is given by the serial harness process. In the first case, we prove that the process delocalizes iff the mean number of visits to the set of sites where the wall is present by a random walk is infinite. When the surfac...

In this paper, a lattice model for the diffusional transport of chromatin-binding particles in the interphase cell nucleus is proposed. Sliding effects are studied in dense networks of chromatin fibers created by three different methods: Randomly distributed, noninterconnected obstacles, a random walk chain model with an attractive step potential, and a self-avoiding random walk chain model wit...

There are presently two models for quantum walks on graphs. The “coined” walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walks operate with continuous time. Here a third model for quatum walks is proposed, which is based on an analogy to optical int...

In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...

In this paper we consider discrete random walks on infinite graphs that are generated by copying and shifting one finite (strongly connected) graph into one direction and connecting successive copies always in the same way. With help of generating functions it is shown that there are only three types for the asymptotic behaviour of the random walk. It either converges to the stationary distribu...

We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. Each active particle performs a simple random walk with discrete time and at each moment it may disappear with probability 1 − p. When an active particle hits a sleeping particle, the latter becomes active. Phase transit...