Random Walks Determined by a Class of Generalized Fibonacci polynomials

Autores/as

  • Sandra M. Z. Yepes UFABC
  • Cristian F. Coletti UFABC
  • Rigoberto Flórez The Citadel
  • Robinson A. Higuita Universidad Pedagógica y Tecnológica de Colombia

Resumen

In this work, we briefly review the definitions of random walks and birth-and-death processes, as these topics are well established. For further details, the interested reader is referred to Dominguez [3] and references therein. These stochastic processes constitute a special class of Markov processes with a discrete state space. We derive the one-step transition matrices for these two types of Markov processes in discrete time. With these matrices at hand, we aim to compute their corresponding n-step transition probabilities, which are given by the entries of the n–th power of the one–step transition matrix. A successful method for this computation is the Karlin-McGregor representation; see Karlin and McGregor [4] for a discussion on the relationship between orthogonal polynomials and random walks. Our interest in studying orthogonal polynomials lies in understanding which random walks are induced by such polynomials (see, for instance, [1]). In this work, we are particularly interested in determining which generalized Fibonacci polynomials (see, for instance, [2]) induce or characterize a random walk. We begin by summarizing key concepts introduced by Flórez et al. [2] for Generalized Fibonacci Polynomials (GFP). Specifically, we consider two fixed nonzero polynomials, d(x) and g(x) in Q[x] with deg(d(x)) > deg(g(x)). For n ≥ 2, a second-order polynomial recurrence relation of Fibonacci-type is defined as follows: F0(x) = 0, F1(x) = 1, and Fn(x) = d(x)Fn−1(x) + g(x)Fn−2(x). (1) Similarly, a second-order polynomial recurrence relation of Lucas-type satisfies the relation: L0(x) = p0, L1(x) = p1(x), and Ln(x) = d(x)Ln−1(x) + g(x)Ln−2(x), (2) where p0 ∈ {±1, ±2} and p1(x), d(x) = αp1(x), and g(x) are fixed non-zero polynomials in Q[x] with α an integer of the form 2/p0. Using the special case of Favard’s Theorem, we examine the orthogonality of GFPs. We investigate sufficient conditions on the set of parameters under which the induced family of polynomials is not only of Lucas type but also belongs to well-known families of orthogonal polynomials, such as the Chebyshev polynomials of the first kind and the Morgan-Voyce polynomials. Since the generalized Fibonacci polynomials are orthogonal, we will determine the conditions under which they qualify as random walk polynomials. To this end, we use the definition random walk polynomial sequence and the following theorem: [...]

Descargas

Los datos de descargas todavía no están disponibles.

Citas

P. Coolen-Schrijnern and E. A. van Doorn. “Analysis of random walks using orthogonal polynomials”. In: J. Comput. Appl. Math. 99 (1998), pp. 387–399. doi: 10.1016/S0377-0427(98)00172-1.

R. Flórez, R. Higuita, and A. Mukherjee. “Characterization of the strong divisibility property for generalized Fibonacci polynomials”. In: Integers 18, No. A14 (2018). doi: 10.5281/zenodo.10675539.

M. D. de la Iglesia. Orthogonal polynomials in the spectral analysis of Markov processes-birth-death models and diffusion. Cambridge University Press, Cambridge: Encyclopedia Math. Appl. [181], 2022. doi: 10.1017/9781009030540.

S. Karlin and J. L. McGregor. “Random walks”. In: Illinois J. Math. 3 (1959), pp. 66–81. doi: 10.1215/ijm/1255454999.

Descargas

Publicado

2026-02-13

Número

Sección

Resumos