Approximate Confidence Limits for a Proportion of the Pólya Distribution

The problem of constructing approximate confidence limits for a proportion parameter of the Pólya distribution is discussed. Three different methods for determining approximate one-sided and two-sided confidence limits for that parameter of the Pólya distribution have been proposed and compared. Particular cases of those confidence bounds are confidence intervals for the parameter of the binomial and the hypergeometric distributions.     

On the efficiency property of the linear estimators in the bivariate pearson type vii distribution

In this paper the efficiency property of the estimators of the parameters of the bivariate Pearson type VII distribution is studied inside the family of linear estimators, assuming that the sample is constituted by dependent random vectors. It is proven that, although there are not efficient linear estimators, the sample mean and the sample covariance matrix (affected by an unbiasedness weighting) are unbiased linear estimators of minimum distance to the Cramér-Rao lower bound. Finally, a numerical simulation example shows that the proposed estimators are computationally feasible.     

Computational techniques in the study of discrete distributions generated by the function 3 F 2

In this paper, we present the use of computational aspects in the study of the family of discrete distributions generated by the hypergeometric function ₃ F ₂, which is a univariate extension of the Gaussian hypergeometric function. These computational techniques allow us to obtain the probability mass function, the mean, the mode in an explicit form as well as the knowledge of the most important properties. We can also obtain a summation result and implement different methods of estimation. Finally, we present an example of an application to real data already fitted by other discrete distributions.     

On discrete distributions generated from drawing balls with bivariate labels

In this article, we consider urn models under three types of sampling schemes in terms of the probability-generating functions. The tools are developed for the evaluation of the distributions arising from the urn models along with some examples. Furthermore, the distributions are investigated by making use of the Bell polynomials. The results presented here provide a wide framework for developing the theory of urn models. As examples, we propose new class of probability models, which are called multiple-player problems and examine their properties. Finally, we treat the parameter estimation problem in the waiting time distributions with a numerical example.     

On a Generalization of the Classical Random Sampling Scheme and Unbiased Estimation

A generalization of the classical random sampling scheme is suggested. Based on the proposed generalization one can derive many new minimum variance unbiased estimators for probabilities, as well as for other functions of unknown parameters, for the multivariate Pólya, the multivariate negative Pólya, the multinomial, the multivariate hypergeometric, the multivariate Poisson, and the Wishart probability distributions.     

Letter to the editor comments on Groparu-Cojocaru and Doray (2013)

Although estimating the five parameters of an unknown Generalized Normal Laplace (GNL) density by minimizing the distance between the empirical and true characteristic functions seems appealing, the approach cannot be advocated in practice. This conclusion is based on extensive numerical simulations in which a fast minimization procedure delivers deceiving estimators with values that are quite far away from the truth. These findings can be predicted by the very large values obtained for the true asymptotic variances of the estimators of the five parameters of the true GNL density.     

Multiparameter estimation of discrete exponential distributions

Let X₁, …, X_p be independent random variables, all having the same distribution up to a possibly varying unspecified parameter, where each of the p distributions belongs to the family of one parameter discrete exponential distributions. The problem is to estimate the unknown parameters simultaneously. Hudson (1978) shows that the minimum variance unbiased estimator (MVUE) of the parameters is inadmissible under squared error loss, and estimators better than the MVUE are proposed. Essentially, these estimators shrink the MVUE towards the origin. In this paper, we indicate that estimators shifting the MVUE towards a point different from the origin or a point determined by the observations can be obtained.     

The probability function of a geometric Poisson distribution

The geometric Poisson (also called Pólya–Aeppli) distribution is a particular case of the compound Poisson distribution. In this study, the explicit probability function of the geometric Poisson distribution is derived and a straightforward proof for this function is given. By means of a proposed algorithm, some numerical examples and an application on traffic accidents are also given to illustrate the usage of the probability function and proposed algorithm.     

Nonparametric empirical Bayes for the Dirichlet process mixture model

The Dirichlet process prior allows flexible nonparametric mixture modeling. The number of mixture components is not specified in advance and can grow as new data arrive. However, analyses based on the Dirichlet process prior are sensitive to the choice of the parameters, including an infinite-dimensional distributional parameter G ₀. Most previous applications have either fixed G ₀ as a member of a parametric family or treated G ₀ in a Bayesian fashion, using parametric prior specifications. In contrast, we have developed an adaptive nonparametric method for constructing smooth estimates of G ₀. We combine this method with a technique for estimating α, the other Dirichlet process parameter, that is inspired by an existing characterization of its maximum-likelihood estimator. Together, these estimation procedures yield a flexible empirical Bayes treatment of Dirichlet process mixtures. Such a treatment is useful in situations where smooth point estimates of G ₀ are of intrinsic interest, or where the structure of G ₀ cannot be conveniently modeled with the usual parametric prior families. Analysis of simulated and real-world datasets illustrates the robustness of this approach.     

Unification of Dirichlet Methodology

In this article we provide a unified framework for solving Dirichlet related probability and waiting time problems. We consider a Pólya sampling scheme in which each time an object is selected, it is put back into the population along with c additional objects of the same type. By considering both fixed sample size and inverse sampling procedures, we unify the Dirichlet I, J, C, and D functions with their hypergeometric counterparts by extending these functions to Pólya sampling. We then use these functions to unify and extend the corresponding expected waiting time results.     

Characterization of the Pearson system of distributions based on reliability measures

LetX be a random variable andX ^(w) be a weighted random variable corresponding toX. In this paper, we intend to characterize the Pearson system of distributions by a relationship between reliability measures ofX andX ^(w), for some weight functionw>0.     

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 properties of the tukey g and h family of distributions

The g and h family of distributions, introduced by J.W. Tukey, is generated by a single transformation of the standard normal which allows for symmetry and heavier tails. Selected percentage points are tabulated, and a closed-form solution for the moments, when they exist, is found. A comparison is made with the Pearson system of distributions. The g and h distributions cover most of the Pearson family to an adequate approximation, when the first four moments exist, and also generate a variety of other types of distributions. Selected distributions graphically illustrate the great variety of possible shapes.     

On the use of curve fitting to model the error of the Cornish-Fisher expansion of the pearson type-VI distribution

The Cornish-Fisher expansion of the Pearson type VI distribution is known to be reasonably accurate when both degrees of freedom are relatively large (say greater than or equal to 5). However, when either or both degrees of freedom are less than 5, the accuracy of the computed percentage point begins to suffer; in some cases severely. To correct for this, the error surface in the degrees of freedom plane is modeled by least squares curve fitting for selected levels of tail probability (.025, .05, and .10) which can be used to adjust the percentage point obtained from the usual Cornish-Fisher expansion. This adjustment procedure produces a computing algorithm that computes percentage points of the Pearson type VI distribution at the above probability levels, accurate to at least + 1 in 3 digits in approximately 11 milliseconds per subroutine call on an IBM 370/145. This adjusted routine is valid for both degrees of freedom greater than or equal to 1.     

Characterizations of geometric distribution and discrete IFR (DFR) distributions using order statistics

Let X be a discrete random variable the set of possible values (finite or infinite) of which can be arranged as an increasing sequence of real numbers a₁<a₂<a₃<…. In particular, a_i could be equal to i for all i. Let X_1n≦X_2n≦?≦X_nn denote the order statistics in a random sample of size n drawn from the distribution of X, where n is a fixed integer ≧2. Then, we show that for some arbitrary fixed k(2≦k≦n), independence of the event {X_kn=X_1n} and X_1n is equivalent to X being either degenerate or geometric. We also show that the montonicity in i of P{X_kn = X_1n | X_1n = a_i} is equivalent to X having the IFR (DFR) property. Let a_i = i and $\text{G(i) = P(X≧i), i = 1, 2, …}$. We prove that the independence of {X_2n ? X_1n ∈B} and X_1n for all i is equivalent to X being geometric, where B = {m} (B = {m,m+1,…}), provided G(i) = q^i?1, 1≦i≦m+2 (1≦i≦m+1), where 0<q<1.     

A note on the unimddality of discrete distributions

It is noted that the unimadility property is very inportant and necessary in many probabilistic-statistical models. In this paper, we consider the definition of discrete uniirodality such that the mode may be unique integer or a sequence of consecutive integers. It will be shown that the necessary and sufficient condition for the discrete distribution to be uninnodal about a can be given through some canonical representation of its characteristic function ‘ch.f.’ Further, characterization results for some well-known distributions are established.     

On certain moment ratios of a class of discrete distributions

Two moment ratios are proposed for their uses In discriminating member among a family of dlscrete distributions and In approximating a member by another one Approximation of the Generalized Poisson( Borel–Tanner) and Neyman Type A distributions by the negatlve blnomial are also given.     

Bayesian analysis for mixtures of discrete distributions with a non-parametric component

Bayesian finite mixture modelling is a flexible parametric modelling approach for classification and density fitting. Many areas of application require distinguishing a signal from a noise component. In practice, it is often difficult to justify a specific distribution for the signal component; therefore, the signal distribution is usually further modelled via a mixture of distributions. However, modelling the signal as a mixture of distributions is computationally non-trivial due to the difficulties in justifying the exact number of components to be used and due to the label switching problem. This paper proposes the use of a non-parametric distribution to model the signal component. We consider the case of discrete data and show how this new methodology leads to more accurate parameter estimation and smaller false non-discovery rate. Moreover, it does not incur the label switching problem. We show an application of the method to data generated by ChIP-sequencing experiments.