Related papers: Conservative Random Walk
The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…
Coined discrete-time quantum walks are studied using simple deterministic dynamical systems as coins whose classical limit can range from being integrable to chaotic. It is shown that a Loschmidt echo like fidelity plays a central role and…
We describe a new construction of a family of measures on a group with the same Poisson boundary. Our approach is based on applying Markov stopping times to an extension of the original random walk.
We propose two different schemes of realizing a virtual walk corresponding to a kinetic exchange model of opinion dynamics. The walks are either Markovian or non-Markovian in nature. The opinion dynamics model is characterized by a…
We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…
In this work we introduce correlated random walks on $\Z$. When picking suitably at random the coefficient of correlation, and taking the average over a large number of walks, we obtain a discrete Gaussian process, whose scaling limit is…
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…
Quantum walks behave differently from what we expect and their probability distributions have unique structures. They have localization, singularities, a gap, and so on. Those features have been discovered from the view point of mathematics…
Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing…
The emergence of heavy-tailed statistics in complex systems is conventionally attributed to non-local stochastic jumps or non-Markovian memory. Here, we present a one-dimensional random walk where power-law behaviors arise instead from a…
In this paper we revise the theory of turnpikes in discounted Markov decision processes, prove the turnpike theorem for the undiscounted model and apply the results to the specific random walk.
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…
The present paper extends the earlier results obtained by Abramov [`Conditions for recurrence and transience for time-inhomogeneous birth-and-death processes' \emph{Bull. Aust. Math. Soc.} \textbf{109} (2024), 393--402] for the case of…
We consider a random walk with a negative drift and with a jump distribution which under Cram\'er's change of measure belongs to the domain of attraction of a spectrally positive stable law. If conditioned to reach a high level and suitably…
In this paper we consider an excited random walk on $\mathbb{Z}$ in identically piled periodic environment. This is a discrete time process on $\mathbb{Z}$ defined by parameters $(p_1,\dots p_M) \in [0,1]^M$ for some positive integer $M$,…
Consider the dynamic environment governed by a Poissonian field of independent particles evolving as simple random walks on $\mathbb{Z}^d$. The random walk on random walks model refers to a particular stochastic process on $\mathbb{Z}^d$…
In this paper, we consider a spectral analysis of the Correlated Random Walk (CRW) on the path. We apply an analytical method for the Quantum Walk to CRW. For the isospectral coin cases, we obtain all of the eigenvalues and the…
We introduce weighted Markovian graphs, a random walk model that decouples the transition dynamics of a Markov chain from (random) edge weights representing the cost of traversing each edge. This decoupling allows us to study the…
In this paper we consider a stochastic process that may experience random reset events which bring suddenly the system to the starting value and analyze the relevant statistical magnitudes. We focus our attention on monotonous…
A random walk on a $N$-dimensional hypercube is a discrete time stochastic process whose state space is the set $\{-1,+1\}^{N}$, which has uniform probability of reaching any neighbour state, and probability zero of reaching a non-neighbour…