Discrete approximations to the information integral

If f and g are probability densities on the line, the integral of f ln(f/g) is the Kullback-Leibler information of f with respect to g. In practice, the observations are discrete, and hence the actual distributions are discrete approximations to the theoretical continuous distributions. This paper is concerned with estimating loss of information due to discretization of data.     

Second-order and resampling approximation of finite population U-statistics based on stratified samples

We construct one-term Edgeworth expansions to distributions of U statistics and Studentized U-statistics, based on stratified samples drawn without replacement. Replacing the cumulants defining the expansions by consistent jackknife estimators, we obtain empirical Edgeworth expansions. The expansions provide second-order approximations that improve upon the normal approximation. Theoretical results are illustrated by a simulation study where we compare various approximations to the distribution of the commonly used Gini's mean difference estimator.     

More Damned Lies and Statistics: How Numbers Confuse Public Issues and Chance: A Guide to Gambling,Love, the Stock Market, & Just About Everything Else

In this article we review two historical approximations to the Poisson and binomial cumulative distribution functions (CDFs); that is, the Wilson–Hilferty and Camp–Paulson approximations. Both of these approximations reduce to standard normal formulas that produce very accurate estimates of the Poisson and binomial CDFs, and are thus quite simple to implement. Additionally, in an upper-division undergraduate or master’s level probability and inference course, the derivation of these approximations presents a nice opportunity to introduce and study the distributional relationships between the gamma and Poisson CDFs, and the binomial, beta, and F CDFs. This article presents the basic theorems and lemmas needed to derive each approximation, along with some relevant examples that compare and contrast the precision of these approximations with their large-sample, limiting normal counterparts.     

Application domains for the Delta method

The Delta method uses truncated Lagrange expansions of statistics to obtain approximations to their distributions. In this paper, we consider statistics Y=g(μ+X), where X is any random vector. We obtain domains 𝒟 such that, when μ∈𝒟, we may apply the distribution derived from the Delta method. Namely, we will consider an application on the normal case to illustrate our approach.     

Sequential Monte Carlo for counting vertex covers in general graphs

In this paper we describe a sequential importance sampling (SIS) procedure for counting the number of vertex covers in general graphs. The optimal SIS proposal distribution is the uniform over a suitably restricted set, but is not implementable. We will consider two proposal distributions as approximations to the optimal. Both proposals are based on randomization techniques. The first randomization is the classic probability model of random graphs, and in fact, the resulting SIS algorithm shows polynomial complexity for random graphs. The second randomization introduces a probabilistic relaxation technique that uses Dynamic Programming. The numerical experiments show that the resulting SIS algorithm enjoys excellent practical performance in comparison with existing methods. In particular the method is compared with cachet—an exact model counter, and the state of the art SampleSearch, which is based on Belief Networks and importance sampling.     

Patched approximations and their convergence

Abstract

Patched approximations of copulas unify ordinal sums, shuffles of Min, checkerboard, and checkmin approximations. We give a characterization of patched approximations and an error bound of the approximations in Sobolev norm. Patched approximations with uniform marginal conditional distributions are shown to arise naturally. We prove that these uniform patched approximations converge uniformly and in the Sobolev norm. The latter convergence is settled by showing the convergence almost everywhere of the first partial derivatives. We also show that the independence copula can be approximated by conditional mutual complete copulas in the Sobolev norm.     

Saddlepoint approximations for nonlinear statistics

It is well known that saddlepoint expansions lead to accurate approximations to the cumulative distributions and densities of a sample mean and other simple linear statistics. The use of such expansions is explored in a broader situation. The saddlepoint formula for the tail probability of a certain type of nonlinear statistic is derived. The relative error of O(n^–1), as in the linear case, is retained. A simple example is considered, to illustrate the great accuracy of the approximation.     

Saddlepoint approximations for subordinator processes

ABSTRACT

We develop the saddlepoint approximations in obtaining the transition functions for general subordinator processes. We derive explicit expressions of the first- and second-order approximations. Specifically, we consider some particular classes of subordinators including the Poisson processes, the Gamma processes, the α-stable subordinators, and the Poisson random integrals. We test this technique on the Poisson and Gamma processes, which have closed-form transition functions. Outcomes show that the approximate expressions are consistent with the true transition functions. We then use this method to predict transition density functions for the α-stable subordinator processes. Finally, we calculate approximated transition densities for some Poisson random integrations. Numerical analysis shows the perfect ability of the saddlepoint approximations to predict the transition densities of the α-stable processes and the Poisson random integrations.     

Improved Measures of the Spread of Data for Some Unknown Complex Distributions Using Saddlepoint Approximations

Measures of the spread of data for random sums arise frequently in many problems and have a wide range of applications in real life, such as in the insurance field (e.g., the total claim size in a portfolio). The exact distribution of random sums is extremely difficult to determine, and normal approximation usually performs very badly for this complex distributions. A better method of approximating a random-sum distribution involves the use of saddlepoint approximations.

Saddlepoint approximations are powerful tools for providing accurate expressions for distribution functions that are not known in closed form. This method not only yields an accurate approximation near the center of the distribution but also controls the relative error in the far tail of the distribution.

In this article, we discuss approximations to the unknown complex random-sum Poisson–Erlang random variable, which has a continuous distribution, and the random-sum Poisson-negative binomial random variable, which has a discrete distribution. We show that the saddlepoint approximation method is not only quick, dependable, stable, and accurate enough for general statistical inference but is also applicable without deep knowledge of probability theory. Numerical examples of application of the saddlepoint approximation method to continuous and discrete random-sum Poisson distributions are presented.     

A random weighting approach for posterior distributions

ABSTRACT

In Bayesian theory, calculating a posterior probability distribution is highly important but typically difficult. Therefore, some methods have been proposed to deal with such problem, among which, the most popular one is the asymptotic expansions of posterior distributions. In this paper, we propose an alternative approach, named a random weighting method, for scaled posterior distributions, and give an ideal convergence rate, o(n^{( ? 1/2)}), which serves as the theoretical guarantee for methods of numerical simulations.     

Bayesian Analysis of Contingency Tables

ABSTRACT

The display of the data by means of contingency tables is used in different approaches to statistical inference, for example, to broach the test of homogeneity of independent multinomial distributions. We develop a Bayesian procedure to test simple null hypotheses versus bilateral alternatives in contingency tables. Given independent samples of two binomial distributions and taking a mixed prior distribution, we calculate the posterior probability that the proportion of successes in the first population is the same as in the second. This posterior probability is compared with the p-value of the classical method, obtaining a reconciliation between both results, classical and Bayesian. The obtained results are generalized for r × s tables.     

Saddlepoint density and distribution functions for the ratio of two linear functions and the product of generalized gamma variates

The generalized gamma distribution is a flexible and attractive distribution because it incorporates several well-known distributions, i.e., gamma, Weibull, Rayleigh, and Maxwell. This article derives saddlepoint density and distribution functions for the ratio of two linear functions of generalized gamma variables and the product of n independent generalized gamma variables. Simulation studies are used to evaluate the accuracy of the saddlepoint approximations. The saddlepoint approximations are fast, easy, and very accurate.     

Attainability of the Upper Bounds for the Mean Past Lifetime of Parallel System Components

Among reliability systems, one of the basic systems is a parallel system. In this article, we consider a parallel system consisting of n identical components with independent lifetimes having a common distribution function F. Under the condition that the system has failed by time t, with t being 100pth percentile of F(t = F ^?1(p), 0 < p < 1), we characterize the probability distributions based on the mean past lifetime of the components of the system. These distributions are described in the form of a specific shape on the left of t and arbitrary continuous function on the right tail.     

On left-truncating and mixing Poisson distributions

ABSTRACT

The distributions obtained by left-truncating at k a mixed Poisson distribution, denoted kT-MP, and those obtained by mixing previously left-truncated Poisson distributions, denoted M-kTP, are characterized by means of their probability generating function. The main consequence is that every kT-MP distribution is a M-kTP distribution, but not the other way around.     

Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization

ABSTRACT

In this article, we develop a new method, called regenerative randomization, for the transient analysis of continuous time Markov models with absorbing states. The method has the same good properties as standard randomization: numerical stability, well-controlled computation error, and ability to specify the computation error in advance. The method has a benign behavior for large t and is significantly less costly than standard randomization for large enough models and large enough t. For a class of models, class C, including typical failure/repair reliability models with exponential failure and repair time distributions and repair in every state with failed components, stronger theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. A large example belonging to that class is used to illustrate the performance of the method and to show that it can indeed be much faster than standard randomization.     

A flexible procedure for formulating probability distributions on the unit interval with applications

Abstract

In this paper, we present a flexible mechanism for constructing probability distributions on a bounded intervals which is based on the composition of the baseline cumulative probability function and the quantile transformation from another cumulative probability distribution. In particular, we are interested in the (0, 1) intervals. The composite quantile family of probability distributions contains many models that have been proposed in the recent literature and new probability distributions are introduced on the unit interval. The proposed methodology is illustrated with two examples to analyze a poverty dataset in Peru from the Bayesian paradigm and Likelihood points of view.     

Bayesian prediction of waiting times in stochastic models

The authors show how saddlepoint techniques lead to highly accurate approximations for Bayesian predictive densities and cumulative distribution functions in stochastic model settings where the prior is tractable, but not necessarily the likelihood or the predictand distribution. They consider more specifically models involving predictions associated with waiting times for semi‐Markov processes whose distributions are indexed by an unknown parameter θ. Bayesian prediction for such processes when they are not stationary is also addressed and the inverse‐Gaussian based saddlepoint approximation of Wood, Booth & Butler (1993) is shown to accurately deal with the nonstationarity whereas the normal‐based Lugannani & Rice (1980) approximation cannot, Their methods are illustrated by predicting various waiting times associated with M/M/q and M/G/1 queues. They also discuss modifications to the matrix renewal theory needed for computing the moment generating functions that are used in the saddlepoint methods.     

A new family of generalized distributions

Kumaraswamy [Generalized probability density-function for double-bounded random-processes, J. Hydrol. 462 (1980), pp. 79–88] introduced a distribution for double-bounded random processes with hydrological applications. For the first time, based on this distribution, we describe a new family of generalized distributions (denoted with the prefix ‘Kw’) to extend the normal, Weibull, gamma, Gumbel, inverse Gaussian distributions, among several well-known distributions. Some special distributions in the new family such as the Kw-normal, Kw-Weibull, Kw-gamma, Kw-Gumbel and Kw-inverse Gaussian distribution are discussed. We express the ordinary moments of any Kw generalized distribution as linear functions of probability weighted moments (PWMs) of the parent distribution. We also obtain the ordinary moments of order statistics as functions of PWMs of the baseline distribution. We use the method of maximum likelihood to fit the distributions in the new class and illustrate the potentiality of the new model with an application to real data.     

Some Utilizations of Lambert W Function in Distribution Theory

We introduce a new class of positive infinitely divisible probability laws calling them 𝔏_γ distributions. Their cumulant-generating functions (cgf) are expressed in terms of the principal branch of the Lambert W function. The probability density functions (pdfs) of 𝔏_γ laws are bounded resembling pdf of a Lévy stable distribution. The exponential dispersion model constructed starting from an 𝔏_γ distribution admits the inverse Gaussian approximation. The natural exponential family constructed starting from an 𝔏_γ distribution constitutes the reciprocal of the natural exponential family generated by a spectrally negative stable law with α = 1. We derive new results on 𝔏_γ laws and the related exponential dispersion models, including their convolution and scaling closure properties. We generate another exponential dispersion model starting from an exponentially compounded 𝔏_γ law. This distribution emerges in the Poisson mixture representation of a generalized Poisson law. We extend the Poisson approximation for the scaled Neyman type A exponential dispersion model. We derive saddlepoint-type approximations for some of these exponential dispersion models. The role of the Lambert W function is emphasized.