Related papers: Stationary switching random walks
In the past decade, the use of ordinal patterns in the analysis of time series and dynamical systems has become an important and rich tool. Ordinal patterns (otherwise known as a permutation patterns) are found in time series by taking $n$…
We consider a discrete-time random motion, Markov chain on the Poincar\'{e} disk. In the basic variant of the model a particle moves along certain circular arcs within the disk, its location is determined by a composition of random…
Discrete-time quantum walks are well-known for exhibiting localization, a quantum phenomenon where the walker remains at its initial location with high probability. In companion with a joint Letter, we introduce oscillatory localization,…
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…
Traditionally stationarity refers to shift invariance of the distribution of a stochastic process. In this paper, we rediscover stationarity as a path property instead of a distributional property. More precisely, we characterize a set of…
In this paper we extend the concept of persistence, well defined for classical stochastic dynamics, to the context of quantum dynamics. We demonstrate the idea via quantum random walk and a successive measurement scheme, where persistence…
Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\tau={cases}\inf\{t>1: S_t\leq0\},…
A Random Walk in Changing Environment (RWCE) is a weighted random walk on a locally finite, connected graph $G$ with random, time-dependent edge-weights. This includes self-interacting random walks, where the edge-weights depend on the…
We compute the stationary distribution of a continuous-time Markov chain which is constructed by gluing together two finite, irreducible Markov chains by identifying a pair of states of one chain with a pair of states of the other and…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
Let $G$ be a finite group and let $H$ be a subgroup of $G$. The left-invariant random walk driven by a probability measure $w$ on $G$ is the Markov chain in which from any state $x \in G$, the probability of stepping to $xg \in G$ is…
We consider weighted graphs satisfying sub-Gaussian estimate for the natural random walk. On such graphs, we study symmetric Markov chains with heavy tailed jumps. We establish a threshold behavior of such Markov chains when the index…
A random walk on a countable group $G$ acting on a metric space $X$ gives a characteristic called the drift which depends only on the transition probability measure $\mu$ of the random walk. The drift is the `translation distance' of the…
The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…
We investigate multivariate regular variation in the context of time-homogeneous Markov chains on general vector spaces and in random coefficient linear models. In the first part, we show that the regular variation of the stationary…
Let $(Y_n)$ be a sequence of i.i.d. real valued random variables. Reflected random walk $(X_n)$ is defined recursively by $X_0=x \ge 0$, $X_{n+1} = |X_n - Y_{n+1}|$. In this note, we study recurrence of this process, extending a previous…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
Persistent random walks are intermediate transport processes between a uniform rectilinear motion and a Brownian motion. They are formed by successive steps of random finite lengths and directions travelled at a fixed speed. The isotropic…
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
We study the diffusive transport of Markovian random walks on arbitrary networks with stochastic resetting to multiple nodes. We deduce analytical expressions for the stationary occupation probability and for the mean and global first…