Related papers: Random walks associated to beta-shifts

We analyze the Hunter vs Rabbit game on graph, which is a kind of model of communication in an adhoc mobile network. Let $G$ be a cycle graph with $N$ nodes. The hunter can move from a vertex to another vertex on the graph along an edge.…

We consider reflecting random walks on the nonnegative integers with drift of order 1/x at height x. We establish explicit asymptotics for various probabilities associated to such walks, including the distribution of the hitting time of 0…

In this article we study a \emph{non-directed polymer model} on $\mathbb Z$, that is a one-dimensional simple random walk placed in a random environment. More precisely, the law of the random walk is modified by the exponential of the sum…

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

We study the dynamics of a generalization of quantum coin walk on the line which is a natural model for a diffusion modified by quantum or interference effects. In particular, our results provide surprisingly simple explanations to…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

We propose a variety of models of random walk, discrete in space and time, suitable for simulating stable random variables of arbitrary index $\alpha$ ($0< \alpha \le 2$), in the symmetric case. We show that by properly scaled transition to…

Let $\Theta=\{\theta_n\}, \Lambda=\{\lambda_n\}$ be two sequences of independent and identically distributed uniform random variables on $[0,1]$. The random vector-valued Weierstrass function is given by \[ f_{\Theta,\Lambda}(t)= \left(…

We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…

The jump processes W(t) on [0,\infty[ with transitions w -> alpha w at rate b*w^beta (0 =< alpha =< 1, b>0, beta>0) are considered. Their moments are shown to decay not faster than algebraically for t -> \infty, and an equilibrium…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…

Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there is an exceptional set of t such that…

We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…

Classical random walks and Markov processes are easily described by Hopf algebras. It is also known that groups and Hopf algebras (quantum groups) lead to classical and quantum diffusions. We study here the more primitive notion of a…

A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional…

We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…

We study slow-subdiffusion in comparison to subdiffusion. Both of the processes are treated as random walks and can be described within continuous time random walk formalism. However, the probability density of the waiting time of a random…