Related papers: Multiple Orthogonal Polynomials and Random Walks

The recently found hypergeometric multiple orthogonal polynomials on the step-line by Lima and Loureiro are shown to be random walk polynomials. It is proven that the corresponding Jacobi matrix and its transpose, which are nonnegative…

The foundational work of Karlin and McGregor established a powerful connection between random walks with tridiagonal transition matrices and the theory of orthogonal polynomials. We consider a particular extension of this framework, where…

This paper investigates stochastic finite matrices and the corresponding finite Markov chains constructed using recurrence matrices for general families of orthogonal polynomials and multiple orthogonal polynomials. The paper explores the…

The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…

Multiple orthogonal polynomials with respect to two weights on the step-line are considered. A connection between different dual spectral matrices, one banded (recursion matrix) and one Hessenberg, respectively, and the Gauss-Borel…

We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via…

Several well-known results from the random matrix theory, such as Wigner's law and the Marchenko--Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the…

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…

In the eighties, A. Connes and E. J. Woods made a connection between hyperfinite von Neumann algebras and Poisson boundaries of time dependent random walks. The present paper explains this connection and gives a detailed proof of two…

In this work we survey on connections of Markov chains and the theory of multiple orthogonality. Here we mainly concentrate on give a procedure to generate stochastic tetra diagonal Hessenberg matrices, coming from some specific families of…

We consider finite-state time-nonhomogeneous Markov chains where the probability of moving from state $i$ to state $j\neq i$ at time $n$ is $G(i,j)/n^\zeta$ for a ``generator'' matrix $G$ and strength parameter $\zeta>0$. In these chains,…

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

The aim of this review paper is to discuss some applications of orthogonal polynomials in quantum information processing. The hope is to keep the paper self contained so that someone wanting a brief introduction to the theory of orthogonal…

We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy's quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of…

Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

In this paper we introduce and discuss some classes of orthogonal polynomials in several non-commuting variables. The emphasis is on a non-commutative version of the orthogonal polynomials on the real line. We introduce recurrence equations…