A convenient way of generating gamma random variables using generalized exponential distribution

Department of Computer Science and Applied Statistics, The University of New Brunswick, Saint John, Canada E2L 4L5
Computational Statistics & Data Analysis (Impact Factor: 1.4). 02/2007; 51(6):2796-2802. DOI: 10.1016/j.csda.2006.09.037
Source: RePEc


In this paper we propose a very convenient way to generate gamma random variables using generalized exponential distribution, when the shape parameter lies between 0 and 1. The new method is compared with the most popular Ahrens and Dieter method and the method proposed by Best. Like Ahrens and Dieter and Best methods our method also uses the acceptance–rejection principle. But it is observed that our method has greater acceptance proportion than Ahrens and Dieter or Best methods.

Download full-text


Available from: Debasis Kundu
  • Source
    • "Examples of such exponentiated distributions are the exponentiated Weibull family, the exponentiated exponential, the exponentiated (generalized) Rayleigh and the exponentiated Pareto family of distributions. Among the authors who have considered the exponentiated distributions are Mudholkar and Hutson [1], Gupta and Kundu [2], Surles and Padgett [3] and Kundu and Gupta [4] [5]. A common feature in families of exponentiated distributions is that the distribution function may be written as F (x) = [G(x)] α , where G(.) is the distribution function of a corresponding nongeneralized distribution and α > 0 denotes the generalized parameter. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The use of goodness-of-fit test based on Anderson–Darling (AD) statistic is discussed, with reference to the composite hypothesis that a sample of observations comes from a generalized Rayleigh distribution whose parameters are unspecified. Monte Carlo simulation studies were performed to calculate the critical values for AD test. These critical values are then used for testing whether a set of observations follows a generalized Rayleigh distribution when the scale and shape parameters are unspecified and are estimated from the sample. Functional relationship between the critical values of AD is also examined for each shape parameter (α), sample size (n) and significance level (γ). The power study is performed with the hypothesized generalized Rayleigh against alternate distributions.
    Full-text · Article · Mar 2011 · Journal of Statistical Computation and Simulation
  • Source
    • "G ENERATING pseudo-random numbers seems to be a key issue across many different practical contexts . Mainly due to the popularity of Markov chain Monte Carlo (MCMC) simulation methods and bootstrap methods, which are widely used in computational economics (Kolsrud, 2008; Diks et al., 2008; Lima and Tabak, 2009), pseudo-random number generation is a pervasive topic in the literature (Kundu and Gupta, 2007). In Kimbrough and Murphy (2009), for instance, pseudo-random number generation is the basis of their study of the properties of equilibrium in oligopolies. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this article, we describe a new yet simple statistical procedure to better assess the quality of pseudo-random number generators. The new procedure builds on the statistical test suite proposed by the National Institute of Standards and Technology (NIST) and is especially use-ful for applications in economics. Making use of properties of the binomial distribution, we estimate the conjoint sig-nificance level of the test. We apply the proposed procedure to several well-known pseudo-random number generators, and the results confirm its effectiveness.
    Full-text · Article · Jun 2010 · Computational Economics
  • Source
    • "The computer generation of random samples from a given probability model is an integral part of any Monte Carlo simulation study, especially in Bayesian statistical analysis by the Markov Chain Monte Carlo methodology. There is renewed interest in this topic as exemplified by a recent paper on gamma distribution by Kundu and Gupta (2007). "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes an envelope rejection method for computer sampling from the negative binomial distribution, with index parameter [alpha] and probability parameter p, based on a simple probability distribution inequality. Comparative timings with existing methods of generating NB variates show that the proposed method is comparable or faster when [alpha] is not too large ([alpha]<11), and it is fastest for all [alpha] when p>0.7.
    Full-text · Article · May 2008 · Computational Statistics & Data Analysis
Show more