Related papers: Open Quantum Random Walks: reducibility, period, e…
It was recently pointed out that identifiability of quantum random walks and hidden Markov processes underlie the same principles. This analogy immediately raises questions on the existence of hidden states also in quantum random walks and…
We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…
General characterizations of ergodic Markov chains have been developed in considerable detail. In this paper, we study the transience for discrete-time Markov chains on general state spaces, including the geometric transience and algebraic…
A one-dimensional confined Nonlinear Random Walk is a tuple of $N$ diffeomorphisms of the unit interval driven by a probabilistic Markov chain. For generic such walks, we obtain a geometric characterization of their ergodic stationary…
We show how to map the states of an ergodic Markov chain to Euclidean space so that the squared distance between states is the expected commuting time. We find a minimax characterization of commuting times, and from this we get monotonicity…
It has been discovered that open quantum walks diffusively distribute in space, since they were introduced in 2012. Indeed, some limit distributions have been demonstrated and most of them are described by Gaussian distributions. We operate…
We propose categories of $1$-dimensional and multi-dimensional quantum walks. In the categories, an object is a quantum walk, and a morphism is an intertwining operator between two quantum walks. The new framework enables us to discuss…
The first motivation of this paper is to study stationarity and ergodic properties for a general class of time series models defined conditional on an exogenous covariates process. The dynamic of these models is given by an autoregressive…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
We consider random walks in random environments on Z^d. Under a transitivity hypothesis that is much weaker than the customary ellipticity condition, and assuming an absolutely continuous invariant measure on the space of the environments,…
Two subjects are discussed in this work: localisation and recurrence in a model of quantum walk in a periodic potential, and a model of opinion dynamics with multiple choices of opinions.
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
We study a simple random walk on Z^2 with constraints on the axis. Motivation comes from physics when particles (a gas for example, see [Dal88]) are submitted to a local field. In our case we assume that the particle evolves freely in the…
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…
For a Markov chain $Y$ with values in a Polish space, consider the entrance chain, obtained by sampling $Y$ at the moments when it enters a fixed set $A$ from its complement $A^c$. Similarly, consider the exit chain, obtained by sampling…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant…