Related papers: Probability distributions for Markov chains based …
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…
We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph…
A continuous-time random walk in the quarter plane with homogeneous transition rates is considered. Given a non-negative reward function on the state space, we are interested in the expected stationary performance. Since a direct derivation…
Coined Quantum Walks (QWs) are being used in many contexts with the goal of understanding quantum systems and building quantum algorithms for quantum computers. Alternative models such as Szegedy's and continuous-time QWs were proposed…
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…
We consider a class of discrete time Markov chains with state space [0,1] and the following dynamics. At each time step, first the direction of the next transition is chosen at random with probability depending on the current location. Then…
Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. The general model of coined QWM is presented in Phys. Rev. A 93, 042323 (2016). In this paper, we present general model of Szegedy…
We study a class of Markov chains that model the evolution of a quantum system subject to repeated measurements. Each Markov chain in this class is defined by a measure on the space of matrices. It is then given by a random product of…
Multi-dimensional quantum walks usually require large coin spaces. Here we show that the non-localized case of the spatial density probability of the two-dimensional Grover walk can be obtained using only a two-dimensional coin space and a…
The Semi-Markov property of Continuous Time Random Walks (CTRWs) and their limit processes is utilized, and the probability distributions of the bivariate Markov process $(X(t),V(t))$ are calculated: $X(t)$ is a CTRW limit and $V(t)$ a…
Random walks cannot, in general, be pushed forward by quasi-isometries. Tame Markov chains were introduced as a `quasi-isometry invariant' are a generalization of random walks. In this paper, we construct several examples of tame Markov…
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…
In a Markov chain started at a state $x$, the hitting time $\tau(y)$ is the first time that the chain reaches another state $y$. We study the probability $\mathbf{P}_x(\tau(y) = t)$ that the first visit to $y$ occurs precisely at a given…
We prove a quenched central limit theorem for random walks with bounded increments in a randomly evolving environment on $\mathbb{Z}^d$. We assume that the transition probabilities of the walk depend not too strongly on the environment and…
In this paper we study convergence of random walks, on finite quantum groups, arising from linear combination of irreducible characters. We bound the distance to the Haar state and determine the asymptotic behavior, i.e. the limit state if…
We present an intuitive, conceptual, but semi-rigorous introduction to the celebrated Markov Chain Monte Carlo method using a simple model of population dynamics as our motivation and focusing on a few elementary distributions.…
We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…
A sequence of real numbers (x_n) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (x_n) are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov…
In large-scale quantum networks, quantum repeaters provide an efficient method to distribute entangled states among selected nodes for realizing long-distance and complicated quantum communications. However, extending quantum repeater…
We consider the limit distributions of open quantum random walks on one-dimensional lattice space. We introduce a dual process to the original quantum walk process, which is quite similar to the relation of Schr\"odinger-Heisenberg…