Related papers: Counting walks in a quadrant: a unified approach v…
For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…
We provide an algorithm that factorizes one-dimensional quantum walks into a protocol of two basic operations: A fixed conditional shift that transports particles between cells and suitable coin operators that act locally in each cell. This…
We provide a new derivation of the well-known generating function counting the number of walks on a regular tree that start and end at the same vertex, and more generally, a generating function for the number of walks that end at a vertex a…
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…
Initial steps are presented towards understanding which finitely generated groups are almost surely generated as semigroups by the path of a random walk on the group.
The purpose of this note is to collect in one place a few results about simple random walk and Brownian motion which are often useful. These include standard results such as Beurling estimates, large deviation estimates, and a method for…
The discrete-time quantum walk (QW) has been extensively and intensively investigated for the last decade, whose coin operator is defined by a unitary matrix. We extend the QW to a walk determined by a unitary matrix whose component is…
We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…
Recently, the quaternionic quantum walk was formulated by the first author as a generalization of discrete-time quantum walks. We treat the right eigenvalue problem of quaternionic matrices to analysis the spectra of its transition matrix.…
We propose a new approach for finding discrete harmonic functions in the quarter plane with Dirichlet conditions. It is based on solving functional equations that are satisfied by the generating functions of the values taken by the harmonic…
The stationary reflected Brownian motion in a three-quarter plane has been rarely analyzed in the probabilistic literature, in comparison with the quarter plane analogue model. In this context, our main result is to prove that the…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
We work with lattice walks in $\mathbb{Z}^{r+1}$ using step set $\{\pm 1\}^{r+1}$ that finish with $x_{r+1} = 0$. We further impose conditions of avoiding backtracking (i.e. $[v,-v]$) and avoiding consecutive steps (i.e. $[v,v]$) each…
We consider a one-dimensional space-inhomogeneous discrete time quantum walk. This model is the Hadamard walk with one defect at the origin which is different from the model introduced by Wojcik et al. [14]. We obtain a stationary measure…
We obtain expected number of arrivals, absorption probabilities and expected time before absorption for a discrete random walk on the integers with an infinite set of equidistant multiple function barriers
We show that the series of all walks between any two vertices of any (possibly weighted) directed graph $\mathcal{G}$ is given by a universal continued fraction of finite depth and breadth involving the simple paths and simple cycles of…
We count the number of closed walks on a vertex in a regular tree using the Catalan's triangle and also the Borel's triangle, showing another combinatorial structure counted by these two array of numbers.
In this work we consider two different aspects of weighted walks in cones. To begin we examine a particular weighted model, known as the Gouyou-Beauchamps model. Using the theory of analytic combinatorics in several variables we obtain the…
We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…
Quantization of a random-walk model is performed by giving a qudit (a multi-component wave function) to a walker at site and by introducing a quantum coin, which is a matrix representation of a unitary transformation. In quantum walks, the…