Related papers: P\'olya number of continuous-time quantum walks
We investigate the statistics of the first detected passage time of a quantum walk. The postulates of quantum theory, in particular the collapse of the wave function upon measurement, reveal an intimate connection between the wave function…
We consider a particular Cox process from a Bayesian viewpoint and show that the Bayes estimator of the intensity measure is the so-called P\'olya sum kernel, which occurred recently in the context of the construction of the so-called…
A quantum system subjected to a strong continuous monitoring undergoes quantum jumps. This very well known fact hides a neglected subtlety: sharp scale-invariant fluctuations invariably decorate the jump process even in the limit where the…
We propose a method of detecting a phase transition in a generalized P\'olya urn in an information cascade experiment. The method is based on the asymptotic behavior of the correlation $C(t)$ between the first subject's choice and the…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…
The continuous-time random walk is defined as a Poissonization of discrete-time random walk. We study the noncolliding system of continuous-time simple and symmetric random walks on ${\mathbb{Z}}$. We show that the system is determinantal…
We apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…
We describe a measurement device principle based on discrete iterations of Bayesian updating of system state probability distributions. Although purely classical by nature, these measurements are accompanied with a progressive collapse of…
In this paper, we introduce the notion of recurrence entropy in the context of nonlinear control systems. A set is said to be ($\tau$-)recurrent if every trajectory that starts in the set returns to it (within at most $\tau$ units of time).…
We consider the recurrence and transience problem for a time-homogeneous Markov chain on the real line with transition kernel $p(x,\mathrm{d}y)=f_x(y-x)\,\mathrm{d}y$, where the density functions $f_x(y)$, for large $|y|$, have a power-law…
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s. critical percolation…
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.
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…
A Lindley process arises from classical studies in queueing theory and it usually reflects waiting times of customers in single server models. In this note we study recurrence of its higher dimensional counterpart under some mild…
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…
We answer Problem 11.1 of Janson arXiv:1803.04207 on P\'olya urns associated with stable random walk. Our proof use neither martingales nor trees, but an approximation with a differential equation.
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…