Related papers: Dynamic Random Walks on Motion Groups
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…
Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of techniques to estimate their mixing time. In this paper, we study the mixing time of random walks in dynamic random environments. To that end,…
We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…
We study random walks on metric spaces with contracting isometries. In this first article of the series, we establish sharp deviation inequalities by adapting Gou\"ezel's pivotal time construction. As an application, we establish the…
We propose a general framework for quantum walks on d-dimensional spaces. We investigate asymptotic behavior of these walks. Among them, existence of limit distribution of homogeneous walks is proved. In this theorem, the support of the…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random…
The continuous time random walks (CTRWs) are typically defned in the way that their trajectories are discontinuous step fuctions. This may be a unwellcome feature from the point of view of application of theese processes to model certain…
We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over…
We study the asymptotic behavior of a multidimensional random walk in a general cone. We find the tail asymptotics for the exit time and prove integral and local limit theorems for a random walk conditioned to stay in a cone. The main step…
We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…
We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of $R$ independent (Markovian) walkers, each defined by its own transition matrix. By…
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…
A deterministic walk in a random environment can be understood as a general random process with finite-range dependence that starts repeating a loop once it reaches a site it has visited before. Such process lacks the Markov property. We…
We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…
We study Markov chains on $\mathbb Z^m$, $m\geq 2$, that behave like a standard symmetric random walk outside of the hyperplane (membrane) $H=\{0\}\times \mathbb Z^{m-1}$. The transition probabilities on the membrane $H$ are periodic and…
Open Quantum Random Walks, as developed in \cite{APSS}, are a quantum generalization of Markov chains on finite graphs or on lattices. These random walks are typically quantum in their behavior, step by step, but they seem to show up a…
We introduce the concept of a deterministic walk in a deterministic environment on a countable state space (DWDE). For the deterministic walk in a fixed environment we establish properties analogous to those found in Markov chain theory,…