SearcharxivSearch

arXiv · 0903.1361

Stochastic ordering of classical discrete distributions

Abstract

For several pairs $(P,Q)$ of classical distributions on $\N_0$, we show that their stochastic ordering $P\leq_{st} Q$ can be characterized by their extreme tail ordering equivalent to $ P(\{k_\ast \})/Q(\{k_\ast\}) \le 1 \le \lim_{k\to k^\ast} P(\{k\})/Q(\{k\})$, with $k_\ast$ and $k^\ast$ denoting the minimum and the supremum of the support of $P+Q$, and with the limit to be read as $P(\{k^\ast\})/Q(\{k^\ast\})$ for $k^\ast$ finite. This includes in particular all pairs where $P$ and $Q$ are both binomial ($b_{n_1,p_1} \leq_{st} b_{n_2,p_2}$ if and only if $n_1\le n_2$ and $(1-p_1)^{n_1}\ge(1-p_2)^{n_2}$, or $p_1=0$), both negative binomial ($b^-_{r_1,p_1}\leq_{st} b^-_{r_2,p_2}$ if and only if $p_1\geq p_2$ and $p_1^{r_1}\geq p_2^{r_2}$), or both hypergeometric with the same sample size parameter. The binomial case is contained in a known result about Bernoulli convolutions, the other two cases appear to be new. The emphasis of this paper is on providing a variety of different methods of proofs: (i) half monotone likelihood ratios, (ii) explicit coupling, (iii) Markov chain comparison, (iv) analytic calculation, and (v) comparison of Levy measures. We give four proofs in the binomial case (methods (i)-(iv)) and three in the negative binomial case (methods (i), (iv) and (v)). The statement for hypergeometric distributions is proved via method (i).

Explore related subjects

Keep this discovery

BibTeXRIS

Achim Klenke, Lutz Mattner. 2010-03-07. Stochastic ordering of classical discrete distributions. https://arxiv.org/abs/0903.1361

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