The Representation of Hypergeometric Random Variables using Independent Bernoulli Random Variables

In this paper, we show that a hypergeometric random variable can be represented as a sum of independent Bernoulli random variables that are, except in degenerate cases, not identically distributed. In the proof, we use the factorial moment generating function. An asymptotic result on the probabilities of the Bernoulli random variables in the sum is also presented. Numerical examples are used to illustrate the results.     

Partial Saddlepoint Approximations for Transformed Means

The full saddlepoint approximation for real valued smooth functions of means requires the existence of the joint cumulant generating function for the entire vector of random variables which are being transformed. We propose a mixed saddlepoint-Edgeworth approximation requiring the existence of a cumulant generating function for only part of the random vector considered, while retaining partially the relative nature of the errors. Tail probability approximations are obtained under conditions which enable the approximations to be used in resampling situations and hence to obtain a result on the relative error of coverage in the case of the bootstrap approximation to the confidence interval for the Studentized mean.     

Measurements of separation among probability densities or random variables

Distance between two probability densities or two random variables is a well established concept in statistics. The present paper considers generalizations of distances to separation measurements for three or more elements in a function space. Geometric intuition and examples from hypothesis testing suggest lower and upper bounds for such measurements in terms of pairwise distances; but also in L_p spaces some useful non-pairwise separation measurements always lie within these bounds. Examples of such separation measurements are the Bayes probability of correct classification among several arbitrary distributions, and the expected range among several random variables.     

Large deviation local limit theorems for ratio statistics

Let {T_n, n ≥ 1} be an arbitrary sequence of nonlattice random variables and let {S_n, n ≥ 1} be another sequence of positive random variables. Assume that the sequences are independent. In this paper we obtain asymptotic expression for the density function of the ratio statistic R_n = T_n/S_n based on simple conditions on the moment generating functions of T_n and S_n. When S_n = re, our main result reduces to that of Chaganty and Sethura-man[Ann. Probab. 13(1985):97-114]. We also obtain analogous results when T_n and S_n are both lattice random variables. We call our theorems large deviation local limit theorems for R_n, since the conditions of our theorems imply that R_n → c in probability for some constant c. We present some examples to illustrate our theorems.     

On k-match problems

Several waiting time random variables for a duplication within a memory window of size k in a sequence of {1,2,…,m}-valued random variables are investigated. The exact distributions of the waiting time random variables are derived by the method of conditional probability generating functions. In particular, the exact distribution of the waiting time for the first k-match is obtained when the underlying sequence is generated by higher order Markov dependent trials. Examples for numerical calculations are also given.     

Convergence of the moment generating function of standardized quantiles

A sequence of independent, identically distributed random variables is considered. Given a simple local condition on the distribution of these random variables, we give necessary and sufficient conditions on the tails of the distribution for the moment generating function of a standardized quantile of the first n observations to converge to the moment generating function of an appropriate normal distribution as n →infinity;. This result is actually a special case of a more general result which can also be used to show convergence in distribution and convergence of moments of standardized quantiles.     

Probability Generating Function Based Jeffrey's Divergence for Statistical Inference

Statistical inference procedures based on transforms such as characteristic function and probability generating function have been examined by many researchers because they are much simpler than probability density functions. Here, a probability generating function based Jeffrey's divergence measure is proposed for parameter estimation and goodness-of-fit test. Being a member of the M-estimators, the proposed estimator is consistent. Also, the proposed goodness-of-fit test has good statistical power. The proposed divergence measure shows improved performance over existing probability generating function based measures. Real data examples are given to illustrate the proposed parameter estimation method and goodness-of-fit test.     

A Proposal for a New Bound for Discrete Distributions

In this work we re-examine some classical bounds for non negative integer-valued random variables by means of information theoretic or maxentropic techniques using fractional moments as constraints. The proposed new bound, no more analytically expressible in terms of moments or moment generating function (mgf), is built by mixing classical bounds and the Maximum Entropy (ME) approximant of the underlying distribution; such a new bound is able to exploit optimally all the information content provided by the sequence of given moments or by the mgf. Particular care will be devoted to obtain fractional moments from the available information given in terms of integer moments and/or moment generating function. Numerical examples show clearly that the bound improvement involving the ME approximant based on fractional moments is not trivial.     

The analysis of MX/M/1 queue with two-stage vacations policy

Abstract

In this article, we consider a batch arrival M^X/M/1 queue with two-stage vacations policy that comprises of single working vacation and multiple vacations, denoted by M^X/M/1/SWV?+?MV. Using the matrix analytic method, we derive the probability generating function (PGF) of the stationary system size and investigate the stochastic decomposition structure of stationary system size. Further, we obtain the Laplace–Stieltjes transform (LST) of stationary sojourn time of a customer by the first passage time analysis. At last, we illustrate the effects of various parameters on the performance measures numerically and graphically by some numerical examples.     

The probability generating function of empty cell variable in a randomized occupancy problem

Let M_o denote the number of empty cells when n distinguishable balls are distributed independently and at random in ra cells such that each ball stays with probability p in its cell, and falls through with probability 1-p. We find the probability generating function of M_o by solving a partial differential equation satisfied by a suitable generating function. The corresponding function for the classical case p = 1 is well-known, but obtained by different methods.     

Discrete distributions in the extended FGM family: The p.g.f. approach

In this article the probability generating functions of the extended Farlie–Gumbel–Morgenstern family for discrete distributions are derived. Using the probability generating function approach various properties are examined, the expressions for probabilities, moments, and the form of the conditional distributions are obtained. Bivariate version of the geometric and Poisson distributions are used as illustrative examples. Their covariance structure and estimation of parameters for a data set are briefly discussed. A new copula is also introduced.     

Distribution of the quotient of noncentral normal random variables

The Mellin convolution is used to derive in analytical form an exact 3-parameterprobabilitydensity function of the quotient of two noncentral normal random variables. In contrast with the 5-parameter probability density function previously derivedby Fieller (1932) and Hinkley (1969), this 3-parameter probability density function is feasible for computer evaluation of the mean and cumulative distribution function, which are needed, for example, when dealing with estimation and distribution problems in regression analysis and sampling theory. When the normal variables are independent, the probability density function reduces to a 2-parameter function, for which a computer program is operational. An illustrative example is given for one set of parameters when the normal variables are independent, in which themean and functional form of the probability density function are presented, together with a brief tabulation of the probability density function.     

Deriving the Probability Density for Sums of Uniform Random Variables

A simple procedure for deriving the probability density function (pdf) for sums of uniformly distributed random variables is offered. This method is suited to introductory courses in probability and mathematical statistics. In our experience, deriving and working with the pdf for sums of random variables facilitates an understanding of the convergence properties of the density of such sums and motivates consideration of other algebraic manipulation for random variables.     

Distribution properties and estimation of the ratio of independent Weibull random variables

The important problem of the ratio of Weibull random variables is considered. Two motivating examples from engineering are discussed. Exact expressions are derived for the probability density function, cumulative distribution function, hazard rate function, shape characteristics, moments, factorial moments, skewness, kurtosis and percentiles of the ratio. Estimation procedures by the methods of moments and maximum likelihood are provided. The performances of the estimates from these methods are compared by simulation. Finally, an application is discussed for aspect and performance ratios of systems.     

On approximating the distribution of indefinite quadratic forms

This paper provides a simple methodology for approximating the distribution of indefinite quadratic forms in normal random variables. It is shown that the density function of a positive definite quadratic form can be approximated in terms of the product of a gamma density function and a polynomial. An extension which makes use of a generalized gamma density function is also considered. Such representations are based on the moments of a quadratic form, which can be determined from its cumulants by means of a recursive formula. After expressing an indefinite quadratic form as the difference of two positive definite quadratic forms, one can obtain an approximation to its density function by means of the transformation of variable technique. An explicit representation of the resulting density approximant is given in terms of a degenerate hypergeometric function. An easily implementable algorithm is provided. The proposed approximants produce very accurate percentiles over the entire range of the distribution. Several numerical examples illustrate the results. In particular, the methodology is applied to the Durbin–Watson statistic which is expressible as the ratio of two quadratic forms in normal random variables. Quadratic forms being ubiquitous in statistics, the approximating technique introduced herewith has numerous potential applications. Some relevant computational considerations are also discussed.     

A modal method for generating binomial variables

The paper considers the problem of generating binomial random variables when the parameters n and p may vary from call to call (as in the generation of multinomial random variables), A new algorithm, based on sequentially searching alternately down and up from the modal probability, is introduced. This is easy to program and requires no special library facilities It is suitable for microcomputers as well as mainframes Some sample timings are given for a FORTRAN 7 7 implementation     

On the number of inversions in bimodal permutations

Distributional properties of the random variable [number of inversions] associated with random bimodal permutations are considered. Especially, the probability generating function and the moments (cumulants) are given and asymptotic properties are discussed.     

Approxmating the distribution of the maximum of a dependent stationary sequence based on estimatimates from a genrating function

A method based on estimating the coefficients of a generating function is used to approximate the distribution of the maximum term of a stationary dependent sequence. In a numerical comparison of our approximation with other apporoximations, our method yielded uniformly closer estimates to the exact distribution. In the examples we considered, statisfactory estimates of the distribution were obtained by our method based on a knowledge of the tri-variate distribution of the underlying random sequence. Knowledge of higher variate distributions can be incorporated to yield even more accurate estimates.     

STRATEGY, NONTRANSITIVE DOMINANCE AND THE EXPONENTIAL DISTRIBUTION

An easily programmed recursive formula for the evaluation of the distribution function of ratios of linear combinations of independent exponential random variables is developed. This formula is shown to yield the probability that one team beats another in a contest we call the special gladiator game. This game generates tournaments which exhibit nontransitive dominance and have some surprising consequences. Similar results are obtained for a recursive formula based on the geometric distribution.     

A note on a universal random variate generator for integer-valued random variables

A universal generator for integer-valued square-integrable random variables is introduced. The generator relies on a rejection technique based on a generalization of the inversion formula for integer-valued random variables. This approach allows to create a dominating probability function, whose evaluation solely involves two integrals depending on the characteristic function of the random variable to be generated. The proposal gives rise to a simple algorithm which may be implemented in a few code lines and which may show good performance when the classical families of distributions—such as the Poisson and the Binomial—are considered. In addition, applications to the Poisson-Tweedie and the Luria-Delbrück distributions are provided.