Characterization of discrete distributions using expected values

In this paper we study characterization problems for discrete distributions using the doubly truncated mean function m(xy)=E(h(X)|x≤X≤y), for a monotonic function h(x). We obtain the distribution function F(x) from m(x,y) and we give the necessary and sufficient conditions for any real function to be the doubly truncated mean function for a discrete distribution.     

Sharp upper bounds for the expected values of non-extreme order statistics from discrete distributions

We consider the problem of determining sharp upper bounds on the expected values of non-extreme order statistics based on i.i.d. random variables taking on N values at most. We show that the bound problem is equivalent to the problem of establishing the best approximation of the projection of the density function of the respective order statistic based on the standard uniform i.i.d. sample onto the family of non-decreasing functions by arbitrary N  -valued functions in the norm of L²(0,1)$L^2(0,1)$ space. We also present an algorithm converging to the local minima of the approximation problems.     

Bounds for the expected value of the stochastic Divisia's price index

In this article, we estimate bounds for the expected value of the stochastic Divisia's price index, that is, we assume that prices and quantities of the given commodities are stochastic processes with continuous time. We consider some special case of the stochastic model in which prices and quantities are described by the geometric Brownian motion. It is shown that the precision of this estimation depends rather on the volatility of prices than quantities volatilities.     

Discrete distributions with maximum expected value of the maximum

We give an upper bound for the expected value of the largest order statistic of a simple random sample of size n from a discrete distribution on N points. We also characterize the distributions that attain such bound. In the particular case n=2, we obtain a characterization of the discrete uniform distribution. © 1998 Elsevier Science B.V. All rights reserved.     

Some characterizations of discrete distributions based on weak records

Let X ₁, X ₂,... be iid random variables (rv's) with the support on nonnegative integers and let (W _n , n≥0) denote the corresponding sequence of weak record values. We obtain new characterization of geometric and some other discrete distributions based on different forms of partial independence of rv's W _n and W _n+r —W _n for some fixed n≥0 and r≥1. We also prove that rv's W ₀ and W _n+1 —W _n have identical distribution if and only if (iff) the underlying distribution is geometric.     

Bounds on the expected maximum

Let (X₁,X₂, …,X_n) be jointly distributed random variables. Define X_n:n = max(X₁,X₂, …,X_n).Bounds on E(X_n:n), obtained by putting constraints on the distributions and/or dependence structure of the X_i's, are surveyed.     

Order statistics from discrete distributions

Several recurrence relations and identities available for single and product moments of order1 statistics in a sample size n from an arbitrary continuous distribution are extended for the discrete case,, Making use of these recurrence relations it is shown that it is sufficient to evaluate just two single moments and (n-l)/2 product moments when n is odd and two single moments and {n-2)/2 product moments when n is even, in order to evaluate the first, second and product moments of order statistics in a sample of size n drawn from an arbitrary discrete distribution, given these moments in samples of sizes n-1 and less.. A series representation for the product moments of order statistics is derived.. Besides enabling us to obtain an exact and explicit expression for the product moments of order statistics from the geometric distribution, it. makes the computation of the product moments of order statistics from other discrete distributions easy too.     

On expected sample range from heterogeneous symmetric distributions

It is shown that for independent (but not necessarily identically distributed) random variables with distributions symmetric about the respective medians (means), the expected value of the sample range is a minimum when these means are all equal.     

On the problem of the unique characterization of discrete distributions by single regression of weak records

We consider the problem of the unique identification of discrete probability distributions by the single regression function of non-adjacent discrete weak record values. We present a new approach to this problem and we show that the uniqueness of the characterization is equivalent to the uniqueness of solution to a corresponding difference equation or an appropriate system of difference equations. This result is applied to obtain known as well as new characterizations of discrete distributions.     

Asymptotic normality for limiting discrete distributions

Three basic asymptotic normality conditions for limiting discrete distributions are given in terms of differencing operators. Under these conditions one can establish asymptotic normality by directly dealing with the limiting behaviors of distribution functions themselves without resorting to the central limit theorem.     

Direct simulation for discrete mixture distributions

We demonstrate how to perform direct simulation for discrete mixture models. The approach is based on directly calculating the posterior distribution using a set of recursions which are similar to those of the Forward-Backward algorithm. Our approach is more practicable than existing perfect simulation methods for mixtures. For example, we analyse 1096 observations from a 2 component Poisson mixture, and 240 observations under a 3 component Poisson mixture (with unknown mixture proportions and Poisson means in each case). Simulating samples of 10,000 perfect realisations took about 17 minutes and an hour respectively on a 900 MHz ultraSPARC computer. Our method can also be used to perform perfect simulation from Markov-dependent mixture models. A byproduct of our approach is that the evidence of our assumed models can be calculated, which enables different models to be compared.     

Data-randomized confidence intervals for discrete distributions

In practice non-randomized conservative confidence intervals for the parameter of a discrete distribution are used instead of the randomized uniformly most accurate intervals. We suggest in this paper that a part of the data be used as the random mechanism to create “data-randomized” confidence intervals. A thoughtful utilization of the data leads to intervals that are shorter than the usual conservative intervals but avoids the arbitrariness of the randomized uniformly most accurate intervals. Examples are given using the binomial, Poisson, and extended hypergeometric distributions, as well as applications to a metched case-control study and a randomized clinical trial.     

Goodness of fit tests for discrete distributions

Some alternative procedures for testing goodness of fit in discrete distributions are discussed here.. These procedures are based on the probability generating functions.. The methods considered are quite general, being applicable in multidimensional situations., The strength of the tests lies in that no ambiguity as to classification of the data arises.. Hov-ever, some difficulties in the proposed procedures are also pointed out.     

Asymptotic distributions of weighted divergence between discrete distributions

A divergence measure between discrete probability distributions introduced by Csiszar (1967) generalizes the Kullback-Leibler information and several other information measures considered in the literature. We introduce a weighted divergence which generalizes the weighted Kullback-Leibler information considered by Taneja (1985). The weighted divergence between an empirical distribution and a fixed distribution and the weighted divergence between two independent empirical distributions are here investigated for large simple random samples, and the asymptotic distributions are shown to be either normal or equal to the distribution of a linear combination of independent X²-variables     

Progressively Type-II right censored order statistics from discrete distributions

Progressively Type-II right censored order statistics from continuous distributions have been studied rather extensively in the literature; see Balakrishnan and Aggarwala [2000. Progressive Censoring: Theory, Methods and Applications. Birkhäuser, Boston]. In this paper, we derive the joint and marginal distributions of progressively Type-II right censored order statistics from discrete distributions. We then use these distributions to show the non-Markovian property as well as to discuss some properties in the special case of the geometric distribution.     

Inverse moments of discrete distributions

In this paper an expression for the inverse moment of order r is given for the truncated binomial and Poisson distributions. This enables one to obtain inverse moments in a finite series. Some applications and multivariate generalizations are also given. The method also enables one to obtain relations between inverse moments and factorial moments and distributions of sums of variables.     

Back-to-back mixtures of discrete distributions

A method for expanding the choices for fits of discrete data is given. The method is very simple: a breakpoint is chosen for the data set on either side of which two separate discrete distributions are fit. Thus, the method is a mixture of two discrete distributions. The method is appealing in light of the ease with which the likelihood equations simplify. For illustrative purposes, the method is used on the data set that motivated its conception.