Related papers: Generating functions and Abdelkader's random walk …

We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

We consider random walks on the torus arising from the action of the group of affine transformations. We give a quantitative equidistribution result for this random walk under the assumption that the Zariski closure of the group generated…

A survey of reinforced random walk, with emphasis on the linear case.

This paper establishes relationships between elliptic functions and Riordan arrays leading to new classes of Riordan arrays which here are called elliptic Riordan arrays. In particular, the case of Riordan arrays derived from Jacobi…

We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…

Consider a generalized Elephant Random Walk in which the step is chosen by selecting $k$ previous steps with $k$ odd and then going in the majority direction with a probability $p$ and in the opposite direction otherwise. In the $k=1$ case…

We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…

We study a one-dimensional random walk with memory in which the step lengths to the left and to the right evolve at each step in order to reduce the wandering of the walker. The feedback is quite efficient and lead to a non-diffusive walk.…

We establish the existence of generalized Busemann functions and Gibbs-Dobrushin-Landford-Ruelle measures for a general class of lattice random walks in random potential with finitely many admissible steps. This class encompasses directed…

The paper is concerned with a new approach for the recurrence property of the oscillating process on $\mathbb{Z}$ in Kemperman's sense. In the case when the random walk is ascending on $\mathbb{Z}^-$ and descending on $\mathbb{Z}^+$, we…

We use a random walk in the ensemble of impurity configurations to generate a Brownian motion model for energy levels in disordered conductors. Treating arc-length along the random walk as fictitous time, the resulting Langevin equation…

First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…

We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…

It is shown how to construct quantum random walks with particles in an arbitrary faithful normal state. A convergence theorem is obtained for such walks, which demonstrates a thermalisation effect: the limit cocycle obeys a quantum…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional…

We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…

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 analyze random walks on a class of semigroups called ``left-regular bands''. These walks include the hyperplane chamber walks of Bidigare, Hanlon, and Rockmore. Using methods of ring theory, we show that the transition matrices are…