SearcharxivSearch

arXiv · 2002.10162

Multivariate q-Polya and inverse q-Polya distributions

Abstract

An urn containing specified numbers of balls of distinct ordered colors is considered. A multiple q-Polya urn model is introduced by assuming that the probability of q-drawing a ball of a specific color from the urn varies geometrically, with rate q, both with the number of drawings and the number of balls of the specific color, together with the total number of balls of the preceded colors, drawn in the previous q-drawings. Then, the joint distributions of the numbers of balls of distinct colors drawn (a) in a specific number of q-drawings and (b) until the occurrence of a specific number of balls of a certain color, are derived. These two distributions turned out to be q-analogues of the multivariate Polya and inverse Polya distributions, respectively. Also, the limiting distributions of the multivariate q-Polya and inverse q-Polya distributions, as the initial total number of balls in the urn tends to infinity, are shown to be q-multinomial and negative q-multinomial distributions, respectively.

Explore related subjects

Keep this discovery

BibTeXRIS

Charalambos A. Charalambides. 2020-02-24. Multivariate q-Polya and inverse q-Polya distributions. https://arxiv.org/abs/2002.10162

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