SearcharxivSearch

arXiv · 2401.00749

Properties of the generalized inverse Gaussian with applications to Monte Carlo simulation and distribution function evaluation

Abstract

The generalized inverse Gaussian, denoted $\mathrm{GIG}(p, a, b)$, is a flexible family of distributions that includes the gamma, inverse gamma, and inverse Gaussian distributions as special cases. In addition to its applications in statistical modeling and its theoretical interest, the GIG often arises in computational statistics, especially in Markov chain Monte Carlo (MCMC) algorithms for posterior inference. This article introduces two mixture representations for the GIG: one that expresses the distribution as a continuous mixture of inverse Gaussians and another that reveals a recursive relationship between GIGs with different values of $p$. The former representation forms the basis for a data augmentation scheme that leads to a geometrically ergodic Gibbs sampler for the GIG. This simple Gibbs sampler, which alternates between gamma and inverse Gaussian conditional distributions, can be incorporated within an encompassing MCMC algorithm when simulation from a GIG is required. The latter representation leads to algorithms for exact, rejection-free sampling as well as CDF evaluation for the GIG with half-integer $p.$ We highlight computational examples from the literature where these new algorithms could be applied.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Peña, Michael Jauch. 2024-01-01. Properties of the generalized inverse Gaussian with applications to Monte Carlo simulation and distribution function evaluation. https://arxiv.org/abs/2401.00749

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO