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.     

A non-linear congruential pseudo random number generator

A non-linear congruential pseudo random number generator is introduced. This generator does not have the lattice structure in the distribution of tuples of consecutive pseudo random numbers which appears in the case of linear congruential generators. A theorem on the period length of sequences produced by this type of generators is proved. This theorem justifies an algorithm to determine the period length. Finally a simulation problem is described where a linear congruential generator produces completely useless results whereas good results are obtained if a non-linear congruential generator of about the same period length is applied.     

Generalized Linear Models

The importance of random number generators has increased over the years. This follows from the fact that contemporary research methods rely more and more on simulation and the increased importance of encryption technology. The output of a random number generator is created by either an algorithm or a physical device. The most popular method for random number generation is through the use of an algorithm. This article presents a new category of physical random bit generator that is packaged by several manufacturers. A statistical analysis of the output from the generators is given.     

A Survey regarding the Reporting of Simulation Studies

Hoaglin and Andrews (1975) proposed standards for computational practice and the reporting of computation-based studies. They observed that “statisticians … often pay too little attention to their own principles of design.” To see if the design and reporting had improved, we surveyed five major statistical journals for 1975, 1978, and 1981 to ascertain whether reported simulation studies involved a specified design, justified the choice of the number of iterations, and specified the random number generator(s) used. Eighteen percent of the 1,198 papers surveyed included results based on simulation. We found that 9% of the papers including a simulation study justified the choice of the number of iterations and 44% at least partially specified the random number generator. Hoaglin and Andrews's observation appears still to be true.     

On generalized moment identity and its applications: a unified approach

In this paper, we obtain a generalized moment identity for the case when the distributions of the random variables are not necessarily purely discrete or absolutely continuous. The proposed identity is useful to find the generator which has been used for the approximation of distributions by Stein's method. Apparently, a new approach is discussed for the approximation of distributions by Stein's method. We bring the characterization based on the relationship between conditional expectations and hazard measure in our unified framework. As an application, a new lower bound to the mean-squared error is obtained and it is compared with Bayesian Cramer–Rao bound.     

A compact and portable Poisson random variate generator

An existing Poisson random variate generator is made compact and portable by introducing pre-tests into the rejection routine.     

Laws of the iterated logarithm and large deviations for a class of diffusionl processes

We use the martingale approach to study large deviations and laws of the iterated logarithm for certain multidimensional diffusion processes. The criteria for the validity of these properties are expressed in terms of averaging properties of the coefficients of the infinitesimal generator. In particular we apply our results to diffusion processes with random coefficients.     

Regularities and irregularities in a random 0,1 sequence

A few properties of the random 0,1 sequences are studied. These properties can be utilized to test the randomness of a 0,1 sequence produced by a computer (random generator). This test seems to be appropriate for discovering the periodicity (or the length of the period) of a pseudorandom sequence. A possible application of the presented results in regression analysis is also discussed.     

Power kurtosis transformations: Definition, properties and ordering

Summary Heavy tail distributions can be generated by applying specific non-linear transformations to a Gaussian random variable. Within this work we introduce power kurtosis transformations which are essentially determined by their generator function. Examples are theH-transformation of Tukey (1960), theK-transformation of MacGillivray and Cannon (1997) and theJ-transformation of Fischer and Klein (2004).Furthermore, we derive a general condition on the generator function which guarantees that the corresponding transformation is actually tail-increasing. In this case the exponent of the power kurtosis transformation can be interpreted as a kurtosis parameter. We also prove that the transformed distributions can be ordered with respect to the partial ordering of van Zwet (1964) for symmetric distributions.     

Estimating Archimedean Copulas in High Dimensions

Abstract. This article presents a novel estimation procedure for high‐dimensional Archimedean copulas. In contrast to maximum likelihood estimation, the method presented here does not require derivatives of the Archimedean generator. This is computationally advantageous for high‐dimensional Archimedean copulas in which higher‐order derivatives are needed but are often difficult to obtain. Our procedure is based on a parameter‐dependent transformation of the underlying random variables to a one‐dimensional distribution where a minimum‐distance method is applied. We show strong consistency of the resulting minimum‐distance estimators to the case of known margins as well as to the case of unknown margins when pseudo‐observations are used. Moreover, we conduct a simulation comparing the performance of the proposed estimation procedure with the well‐known maximum likelihood approach according to bias and standard deviation.     

Generating generalized inverse Gaussian random variates

The generalized inverse Gaussian distribution has become quite popular in financial engineering. The most popular random variate generator is due to Dagpunar (Commun. Stat., Simul. Comput. 18:703–710, 1989). It is an acceptance-rejection algorithm method based on the Ratio-of-Uniforms method. However, it is not uniformly fast as it has a prohibitive large rejection constant when the distribution is close to the gamma distribution. Recently some papers have discussed universal methods that are suitable for this distribution. However, these methods require an expensive setup and are therefore not suitable for the varying parameter case which occurs in, e.g., Gibbs sampling. In this paper we analyze the performance of Dagpunar’s algorithm and combine it with a new rejection method which ensures a uniformly fast generator. As its setup is rather short it is in particular suitable for the varying parameter case.     

THE CASE FOR PARITY AND BIRTH-ORDER STATISTICS

Parity refers to the number of (live) births that a woman (or man) has had. Birth order refers to whether a birth is the first, second, third or higher‐order birth of the parent. In the context of low and shifting fertility, parity and birth‐order statistics are becoming increasingly important for understanding fertility trends and patterns, for policy, and for carrying out projections of future fertility. In Australia, the main sources of demographic data are birth, death and marriage registers, and the five‐yearly national census. Both the birth registers and the census are ideally placed to collect data required to calculate parity and birth‐order statistics. However not all Australian states and territories collect or code the necessary information in the birth registers, and the parity question ‘For each female, how many babies has she ever had?’ is only asked every second census; that is, once every 10 years. In this paper, we outline the importance and uses of parity and birth‐order statistics. We discuss the Australian data available at present and their gaps and shortcomings. We then describe the ‘gold standard’ of parity and birth‐order statistics and how Australia can achieve this standard through some minor changes to the data collection process.     

A new nonparametric procedure designed for simulation studies

This paper demonstrates how certain statistics, computed from a sample of size n (from almost any distribution) may be simulated by using a sequence of substantially less than n random normal variates. Many statistics, θ, including almost all maximum likelihood estimates, can be expressed in terms of the sample trigonometric moments, STM. The STM are asymptotically multivariate normal with a mean vector and variance-covariance matrix easily expressible in terms of equally spaced characteristic function evaluations. Thus one only needs to know the Fourier transform or equivalently the characteristic function associated with elements of any moderate to large i. i. d. sample and have access to a normal random number generator to generate a sequence of STM with distributional properties almost identical to those of STM computed from that sample. These STM can in turn be used to compute the desired statistic θ.     

Random variate generation for the generalized inverse Gaussian distribution

We provide a uniformly efficient and simple random variate generator for the entire parameter range of the generalized inverse Gaussian distribution. A general algorithm is provided as well that works for all densities that are proportional to a log-concave function φ, even if the normalization constant is not known. It requires only black box access to φ and its derivative.     

Fitting asymmetric bimodal data with selected distributions

ABSTRACT

This article discusses two asymmetrization methods, Azzalini's representation and beta generation, to generate asymmetric bimodal models including two novel beta-generated models. The practical utility of these models is assessed with nine data sets from different fields of applied sciences. Besides this tutorial assessment, some methodological contributions are made: a random number generator for the asymmetric Rathie–Swamee model is developed (generators for the other models are already known and briefly described) and a new likelihood ratio test of unimodality is compared via simulations with other available tests. Several tools have been used to quantify and test for bimodality and assess goodness of fit including Bayesian information criterion, measures of agreement with the empirical distribution and the Kolmogorov–Smirnoff test. In the nine case studies, the results favoured models derived from Azzalini's asymmetrization, but no single model provided a best fit across the applications considered. In only two cases the normal mixture was selected as best model. Parameter estimation has been done by likelihood maximization. Numerical optimization must be performed with care since local optima are often present. We concluded that the models considered are flexible enough to fit different bimodal shapes and that the tools studied should be used with care and attention to detail.     

Random number generators for the generalized Birnbaum–Saunders distribution

The generalized Birnbaum–Saunders distribution pertains to a class of lifetime models including both lighter and heavier tailed distributions. This model adapts well to lifetime data, even when outliers exist, and has other good theoretical properties and application perspectives. However, statistical inference tools may not exist in closed form for this model. Hence, simulation and numerical studies are needed, which require a random number generator. Three different ways to generate observations from this model are considered here. These generators are compared by utilizing a goodness-of-fit procedure as well as their effectiveness in predicting the true parameter values by using Monte Carlo simulations. This goodness-of-fit procedure may also be used as an estimation method. The quality of this estimation method is studied here. Finally, through a real data set, the generalized and classical Birnbaum–Saunders models are compared by using this estimation method.     

A bayesian alternative to the analysis of matched categorical responces

This study investigates the Bayesian appeoach to the analysis of parired responess when the responses are categorical. Using resampling and analytical procedures, inferences for homogeneity and agreement are develped. The posterior analysis is based on the Dirichlet distribution from which repeated samples can be geneated with a random number generator. Resampling and analytical techniques are employed to make Bayesian inferences, and when it is not appropriate to use analytical procedures, resampling techniques are easily implemented. Bayesian methodoloogy is illustrated with several examples and the results show that they are exacr-small sample procedures that can easily solve inference problems for matched designs.     

Adaptive rejection sampling with fixed number of nodes

The adaptive rejection sampling (ARS) algorithm is a universal random generator for drawing samples efficiently from a univariate log-concave target probability density function (pdf). ARS generates independent samples from the target via rejection sampling with high acceptance rates. Indeed, ARS yields a sequence of proposal functions that converge toward the target pdf, so that the probability of accepting a sample approaches one. However, sampling from the proposal pdf becomes more computational demanding each time it is updated. In this work, we propose a novel ARS scheme, called Cheap Adaptive Rejection Sampling (CARS), where the computational effort for drawing from the proposal remains constant, decided in advance by the user. For generating a large number of desired samples, CARS is faster than ARS.     

Equal-bin-width histogram versus equal-bin-count histogram

The histogram has all its bin widths equal to some non-random number arbitrary set by an analyst (EBWH). In the result, particular bin counts are random variables. This paper presents also a histogram that is constructed in a converse manner. Bin counts are all equal to some non-random number arbitrary set by an analyst (EBCH). In the result, particular bin widths are random variables. The first goal of the paper is a choose of constant bin width (of bin numbers k) in the EBWH, which maximize the similarity measure in the Monte Carlo simulation. The second goal is a choose of constant bin count in the EBCH, which maximize the similarity measure in the Monte Carlo simulation. The third goal is to present similarity measures between empirical and theoretical data. The fourth goal is the comparative analysis of two histogram methods by means of the frequency formula. The first additional goal is a tip how to proceed in EBCH when modulo(n,k)≠0. The second additional goal is the software in the form of a Mathcad file with the implementation of EBWH and EBCH.Subject classification codes: 62G30, 62G07KEYWORDS: Empirical density function, histogram, random number generator, Monte Carlo simulation, similarity measure     

On the determination of sizes of markets

The number of specialized dealers is of interest to market research institutes. They need those market sizes to project sample results to the whole population of shops. A basis to get to know the size of such a population is given by address registers. These registers contain also dead addresses and they are incorrect as they do not contain all addresses of existing shops. We present an approach to deal with these two kinds of errors and derive an estimator with negligible bias.