Related papers: Random walks with occasionally modified transition…

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…

The integer points (sites) of the real line are marked by the positions of a standard random walk. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the standard random walk are…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

Let $h:[0,1]\to\mathbb{R}$ be $C^2$ and such that $\sup_{[0,1]} h''<0$. For a (large) positive integer $n$, set $h_n(k) = n h(k/n)$ for any $k\in\{0,\dots,n\}$. We consider a random walk $(S_k)_{k\geq 0}$ with i.i.d.\ centred increments…

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum information theory. In the present paper, we focus on discrete time quantum walks viewed as quantization of random…

Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…

In this paper, we study random walks $g_n=f_{n-1}\cdots f_0$ on the group $\mathrm{Homeo}(S^1)$ of the homeomorphisms of the circle, where the homeomorphisms $f_k$ are chosen randomly, independently, with respect to a same probability…

We present some new results about the distribution of a random walk whose independent steps follow a $q-$Gaussian distribution with exponent $\frac{1}{1-q}; q \in \mathbb{R}$. In the case $q>1$ we show that a stochastic representation of…

The recurrence properties of random walks can be characterized by P\'{o}lya number, i.e., the probability that the walker has returned to the origin at least once. In this paper, we consider recurrence properties for a general 1D random…

We use representation theory of $S_n$ to analyze the mixing of permutation cycle type statistics $a_j(\sigma) = ${# of $j$-cycles of $\sigma$} for any fixed $j$ and $\sigma$ resulting from a random $i$-cycle walk on $S_n$. We also derive…

The investigation of random walks is central to a variety of stochastic processes in physics, chemistry, and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a…

We consider Sinai's random walk in random environment $(S_n)_{n\in\mathbb{N}}$. We prove a local limit theorem for $(S_n)_{n\in\mathbb{N}}$ under the annealed law $\mathbb{P}$. As a consequence, we get an equivalent for the annealed…

We prove a ballistic strong law of large numbers and an invariance principle for random walks in strong mixing environments, under condition $(T)$ of Sznitman (cf. \cite{Sz01}). This weakens by first time the Kalikow ballistic assumption in…

Let $N$ be a positive integer, $c$ be a positive constant and $(U_n)_{n\ge 1}$ be a sequence of independent identically distributed pseudo-random variables. We assume that the $U_n$'s take their values in the discrete set…

We consider the range of random walks up to time n, R_n, on graphs satisfying a uniform condition. This condition is characterized by potential theory. Not only all vertex transitive graphs but also many non-regular graphs satisfy the…

Let $\left\{ S_{n},n\geq 0\right\} $ be a random walk whose increment distribution belongs without centering to the domain of attraction of an $% \alpha $-stable law, i.e., there are some scaling constants $a_{n}$ such that the sequence…

Let the random variable $Z_{n,k}$ denote the number of increasing subsequences of length $k$ in a random permutation from $S_n$, the symmetric group of permutations of $\{1,...,n\}$. We show that $Var(Z_{n,k_n})=o((EZ_{n,k_n})^2)$ as $…

We consider a state-dependent, time-dependent, discrete random walks $X_t^{\{a_n\}}$ defined on natural numbers $\mathbb{N}$ (bent to a "stair" in $\mathbb{N}^2$) where the random walk depends on input of a positive deterministic sequence…

The paper deals with a new class of random walks strictly connected with the Pareto distribution. We consider stochastic processes in the sense of generalized convolution or weak generalized convolution following the idea given in [1]. The…