Related papers: Kendall random walk, Williamson transform and the …
We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…
We present a novel application of the HHL (Harrow-Hassidim-Lloyd) algorithm -- a quantum algorithm solving systems of linear equations -- in solving an open problem about quantum random walks, namely computing hitting (or absorption)…
This paper reviews the modern state of the Wiener--Hopf factorization method and its generalizations. The main constructive results for matrix Wiener--Hopf are presented, approximation methods are outlined and the main areas of applications…
We study the simple random walk dynamics on an annealed version of a Small-World Network (SWN) consisting of $N$ nodes. This is done by calculating the mean number of distinct sites visited S(n) and the return probability $P_{00}(t)$ as a…
The Wiener-Hopf equations are a Toeplitz system of linear equations that naturally arise in several applications in time series. These include the update and prediction step of the stationary Kalman filter equations and the prediction of…
We consider random walks on the cone of $m \times m$ positive definite matrices, where the underlying random matrices have orthogonally invariant distributions on the cone and the Riemannian metric is the measure of distance on the cone. By…
We analyze fluctuations of random walks with generally distributed increments. Integral representations for key performance measures are obtained by extending an inversion theorem of Hewitt [11] for Laplace-Stieltjes transforms. Another…
A transition of quantum walk induced by classical randomness changes the probability distribution of the walker from a two-peak structure to a single-peak one when the random parameter exceeds a critical value. We first establish the…
Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a…
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks…
We study the covariance property of quadratic time-frequency distributions with respect to the action of the extended symplectic group. We show how covariance is related, and in fact in competition, with the possibility of damping the…
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain. More specifically, with $P$ the Markov chain transition…
Random walk kernels have been introduced in seminal work on graph learning and were later largely superseded by kernels based on the Weisfeiler-Leman test for graph isomorphism. We give a unified view on both classes of graph kernels. We…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
Two random-walk related problems which have been studied independently in the past, the expected maximum of a random walker in one dimension and the flux to a spherical trap of particles undergoing discrete jumps in three dimensions, are…
The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum information theory. In the present paper, we focus on discrete time quantum walks viewed as quantization of random…
Quantization and asymptotic behaviour of a variant of discrete random walk on integers are investigated. This variant, the $\epsilon_{V^{k}}$ walk, has the novel feature that it uses many identical quantum coins keeping at the same time…
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…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…