Search arXivSearch

arXiv · 2103.13715

Multiple Orthogonal Polynomials and Random Walks

Abstract

Given a non-negative Jacobi matrix describing higher order recurrence relations for multiple orthogonal polynomials of type~II and corresponding linear forms of type I, a general strategy for constructing a pair of stochastic matrices, dual to each other, is provided. The corresponding Markov chains (or 1D random walks) allow, in one transition, to reach for the N-th previous states, to remain in the state or reach for the immediately next state. The dual Markov chains allow, in one transition, to reach for the N-th next states, to remain in the state or reach for immediately previous state. The connection between both dual Markov chains is discussed at the light of the Poincaré's theorem on ratio asymptotics for homogeneous linear recurrence relations and the Christoffel-Darboux formula within the sequence of multiple orthogonal polynomials and linear forms of type I. The Karlin-McGregor representation formula is extended to both dual random walks, and applied to the discussion of the corresponding generating functions and first-passage distributions. Recurrent or transient character of the Markov chain is discussed. Steady state and some conjectures on its existence and the relation with mass points are also given. The Jacobi-Piñeiro multiple orthogonal polynomials are taken as a case study of the described results. For the first time in the literature, an explicit formula for the type~I Jacobi--Piñeiro polynomials is determined. The region of parameters where the Markov chains are recurrent or transient is given, and it is conjectured that when recurrent, the Markov chains are null recurrent and, consequently, the expected return times are infinity. Examples of recurrent and transient Jacobi--Piñeiro random walks are constructed explicitly.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amílcar Branquinho, Ana Foulquié-Moreno, Manuel Mañas, Carlos Álvarez-Fernández, Juan E. Fernández-Díaz. 2021-03-27. Multiple Orthogonal Polynomials and Random Walks. https://arxiv.org/abs/2103.13715

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fragment-wise differentiable structures

The $p$-modulus of curves, test plans, upper gradients, charts, differentials, approximations in energy and density of directions are all concepts associated to the theory of Sobolev functions in metric measure spaces. The purpose of this paper is to give an analogous geometric and ``fragment-wise'' theory for Lipschitz functions and Weaver derivations, where $\infty$-modulus of curve fragments, $\ast$-upper gradients and Alberti representations play a central role. We give a new definition of fragment-wise charts and prove that they exists for spaces with finite Hausdorff dimension. We give a replacement for $p$-duality in terms of Alberti representations and $\infty$-modulus and present the theory of $\ast$-upper gradients. Further, we give new and sharper results for approximations of Lipschitz functions, which yields the density of directions. Our results are applicable to all complete and separable metric measure spaces. In the process, we show that there are strong parallels between the Sobolev and Lipschitz worlds.

math.CA

Tensor Derivatives, Unified Tensor-Form Differential Equations, and Model Reduction via Partial Tucker Decomposition

This paper develops a unified tensor calculus for matrix-valued functions and their derivatives, and leverages this framework to construct efficient model reduction techniques for high-dimensional tensor differential equations. We first establish a systematic theory of tensor differentiation, wherein the derivative of a matrix with respect to another matrix is represented as a fourth-order tensor. Building on this calculus, we recast linear ordinary differential equations (ODEs) and partial differential equations(PDEs) into a compact tensor-matrix form $\frac{dX}{dt} = \A\ast X$. The general solution is expressed as $X = \exp(t\A)\ast C$, extending the matrix exponential to the tensor setting. Conditions under which the solution admits this exponential form are characterized in terms of the commutativity of the associated matrix slices. We introduce the partial Tucker decomposition (parTuckerD) to address the computational challenges posed by high-order tensor systems. On a synthetic electronic health record (EHR) tensor, parTuckerD achieves a relative reconstruction error of $0.0992$ with a $136.3\times$ compression ratio, matching the accuracy of the full TuckerD while preserving patient-level similarity structure. The results demonstrate that the proposed tensor calculus and parTuckerD framework provide a principle and computationally efficient approach for analyzing and solving high-dimensional tensor differential equations arising in data-intensive applications.

math.CA

Distance preservers for Lobachevsky space

We obtain a complete description of the class of entrywise preservers of Lorentz-Gram matrices. This resolves, for the case of constant negative curvature, the classification of entrywise preservers obtained by Schoenberg in the zero-curvature (Euclidean) and constant-positive-curvature (spherical) settings. These preservers admit a Lévy--Khintchine-type representation and their asymptotic characteristics are related to Krein's classification of screw lines in Lobachevsky space. Connections with complete Nevanlinna--Pick kernels and Bochner subordination are also obtained.

math.CA