Search arXivSearch

arXiv · 1106.1835

A System of Multivariable Krawtchouk Polynomials and a Probabilistic Application

Abstract

The one variable Krawtchouk polynomials, a special case of the $_2F_1$ function did appear in the spectral representation of the transition kernel for a Markov chain studied a long time ago by M. Hoare and M. Rahman. A multivariable extension of this Markov chain was considered in a later paper by these authors where a certain two variable extension of the $F_1$ Appel function shows up in the spectral analysis of the corresponding transition kernel. Independently of any probabilistic consideration a certain multivariable version of the Gelfand-Aomoto hypergeometric function was considered in papers by H. Mizukawa and H. Tanaka. These authors and others such as P. Iliev and P. Tertwilliger treat the two-dimensional version of the Hoare-Rahman work from a Lie-theoretic point of view. P. Iliev then treats the general $n$-dimensional case. All of these authors proved several properties of these functions. Here we show that these functions play a crucial role in the spectral analysis of the transition kernel that comes from pushing the work of Hoare-Rahman to the multivariable case. The methods employed here to prove this as well as several properties of these functions are completely different to those used by the authors mentioned above.

Explore related subjects

Keep this discovery

BibTeXRIS

F. Alberto Grünbaum, Mizan Rahman. 2011-06-09. A System of Multivariable Krawtchouk Polynomials and a Probabilistic Application. https://doi.org/10.3842/sigma.2011.119

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR