Universal methods for generating random variables with a given characteristic function

Universal generators for absolutely-continuous and integer-valued random variables are introduced. The proposal is based on a generalization of the rejection technique proposed by Devroye [The computer generation of random variables with a given characteristic function. Computers and Mathematics with Applications. 1981;7:547–552]. The method involves a dominating function solely requiring the evaluation of integrals which depend on the characteristic function of the underlying random variable. The proposal gives rise to simple algorithms which may be implemented in a few code lines and which may show noticeable performance even if some classical families of distributions are considered.     

Expectation formulas for integer valued multivariate random variables

Nadarajah and Mitov [Communications in Statistics—Theory and Methods, 32, 2003, 47–60] derived an expectation formula for continuous multivariate random variables involving the joint survival function. Their result is extended here for discrete multivariate random variables. Examples proposing new discrete bivariate distributions are given.     

On the normality of transformed beta and unit- gamma random variables

In this paper we consider properties of the logarithmic and Tukey's lambda-type transformations of random variables that follow beta or unit-gamma distributions. Beta distributions often arise as models for random proportions, and unit-gamma distributions, although not well- known, may serve the same purpose. The latter possess many properties similar to those of beta distributions. Some transformations of random variables that follow a beta distribution are considered by Johnson (1949) and Johnson and Kotz (1970,1973). These are used to obtain a -new"random variable that potentially approximately follows a normal distribution, so that practical analyses become possible. We study normality -related properties of the above transformations. This is done for the first time for unit-gamma distributions. Under the logarithmic transformation the beta and unit-gamma distributions become, respectively, the logarithmic F and generalized logistic distributions. The distributions of the transformed beta and unit-gamma distributions after application of Tukey's lambda-type transformations cannot be derived easily; however, we obtain the first four moments and expressions for the skewness and kudos is of the transformed variables. Values of skewness and kurtosis for a variety of different parameter values are calculated, and in consequence, the near (or not near) normality of the transformed variables is evaluated. Comments on the use of the various transformations are provided..     

Cumulants of random sum distributions

Consider a random variable S being the sum of a number N of independent and identically distributed random variables X_j (j = 1, 2, ...) where the number N is itself a non-negative integer-valued random variable independent of the X_j An explicit expression of the r-th cumulant of S is given in terms of the cumulants of N and X_j, Asymptotic properties of the distribution of S are also discussed.     

A random cluster algorithm for some continuous Markov random fields

Based on a random cluster representation, the Swendsen–Wang algorithm for the Ising and Potts distributions is extended to a class of continuous Markov random fields. The algorithm can be described briefly as follows. A given configuration is decomposed into clusters. Probabilities for flipping the values of the random variables in each cluster are calculated. According to these probabilities, values of all the random variables in each cluster will be either updated or kept unchanged and this is done independently across the clusters. A new configuration is then obtained. We will show through a simulation study that, like the Swendsen–Wang algorithm in the case of Ising and Potts distributions, the cluster algorithm here also outperforms the Gibbs sampler in beating the critical slowing down for some strongly correlated Markov random fields.     

Correction

In many probability and mathematical statistics courses the probability generating function (PGF) is typically overlooked in favor of the more utilized moment generating function. However, for certain types of random variables, the PGF may be more appealing. For example, sums of independent, non-negative, integer-valued random variables with finite support are easily studied via the PGF. In particular, the exact distribution of the sum can easily be calculated. Several illustrative classroom examples, with varying degrees of difficulty, are presented. All of the examples have been implemented using the R statistical software package.     

Computational procedures for deriving sampling distributions of attribute-contaminated random variables

Statistical distributions generated from any J- or U-shaped random variables are cumbersome to derive if not completely indefinable and thus are unavailable analytically because of the singularities at the tails of the basic random variable. This paper presents a computational method for providing a numerical convolution derived from a basic U-shaped random variable composed of a continuous part mixed with (or contaminated by) a discrete part at the tails. The J-shaped sampling distribution case is implied as a special case. Though the computations are based on a background Normal Distribution, it can be generalized on any other distribution.Such distributions will open up an area of sampling distributions of mixed random variables that are not elaborately covered in textbooks dealing with the theory of distributions.     

The laws of large numbers for Pareto-type random variables with infinite means

In this paper, we consider the laws of large numbers for NSD random variables satisfying Pareto-type distributions with infinite means. Based on the Pareto-Zipf distributions, some weak laws of large numbers for weighted sums of NSD random variables are obtained. Meanwhile, we show that a weak law for Pareto-Zipf distributions cannot be extended to a strong law. Furthermore, based on the two tailed Pareto distribution, a strong law of large numbers for weighed NSD random variables is presented. Our results extend the corresponding earlier ones.     

The Tempered Discrete Linnik distribution

We introduce a new family of integer-valued distributions by considering a tempered version of the Discrete Linnik law. The proposal is actually a generalization of the well-known Poisson–Tweedie law. The suggested family is extremely flexible since it contains a wide spectrum of distributions ranging from light-tailed laws (such as the Binomial) to heavy-tailed laws (such as the Discrete Linnik). The main theoretical features of the Tempered Discrete Linnik distribution are explored by providing a series of identities in law, which describe its genesis in terms of mixture Poisson distribution and compound Negative Binomial distribution—as well as in terms of mixture Poisson–Tweedie distribution. Moreover, we give a manageable expression and a suitable recursive relationship for the corresponding probability function. Finally, an application to scientometric data—which deals with the scientific output of the researchers of the University of Siena—is considered.     

Lack-of-fit testing of a regression model with response missing at random

This paper proposes a class of lack-of-fit tests for fitting a linear regression model when some response variables are missing at random. These tests are based on a class of minimum integrated square distances between a kernel type estimator of a regression function and the parametric regression function being fitted. These tests are shown to be consistent against a large class of fixed alternatives. The corresponding test statistics are shown to have asymptotic normal distributions under null hypothesis and a class of nonparametric local alternatives. Some simulation results are also presented.     

Bivariate distributions of some ratios of independent noncentral chi-square random variables

The bivariate distributions of three pairs of ratios of in¬dependent noncentral chi-square random variables are considered. These ratios arise in the problem of computing the joint power function of simultaneous F-tests in balanced ANOVA and ANCOVA. The distributions obtained are generalizations to the noncentral case of existing results in the literature. Of particular note is the bivariate noncentral F distribution, which generalizes a special case of Krishnaiah*s (1964,1965) bivariate central F distribution. Explicit formulae for the cdf's of these distribu¬tions are given, along with computational procedures     

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.     

First-order random coefficients integer-valued threshold autoregressive processes

In this paper, we introduce a first-order random coefficient integer-valued threshold autoregressive process, which is based on binomial thinning. Basic probabilistic and statistical properties of this model are discussed. Conditional least squares and conditional maximum likelihood estimators are derived for both the cases that the threshold variable is known or not. The asymptotic properties of the estimators are established. Moreover, forecasting problem is addressed. Finally, some numerical results of the estimates and a real data example are presented.     

Fast parallel $$\alpha $$-stable distribution function evaluation and parameter estimation using OpenCL in GPGPUs

\(\alpha \)-Stable distributions are a family of probability distributions found to be suitable to model many complex processes and phenomena in several research fields, such as medicine, physics, finance and networking, among others. However, the lack of closed expressions makes their evaluation analytically intractable, and alternative approaches are computationally expensive. Existing numerical programs are not fast enough for certain applications and do not make use of the parallel power of general purpose graphic processing units. In this paper, we develop novel parallel algorithms for the probability density function and cumulative distribution function—including a parallel Gauss–Kronrod quadrature—, quantile function, random number generator and maximum likelihood estimation of \(\alpha \)-stable distributions using OpenCL, achieving significant speedups and precision in all cases. Thanks to the use of OpenCL, we also evaluate the results of our library with different GPU architectures.     

Bayesian D-optimal design for logistic regression model with exponential distribution for random intercept

ABSTRACT

Nowadays, generalized linear models have many applications. Some of these models which have more applications in the real world are the models with random effects; that is, some of the unknown parameters are considered random variables. In this article, this situation is considered in logistic regression models with a random intercept having exponential distribution. The aim is to obtain the Bayesian D-optimal design; thus, the method is to maximize the Bayesian D-optimal criterion. For the model was considered here, this criterion is a function of the quasi-information matrix that depends on the unknown parameters of the model. In the Bayesian D-optimal criterion, the expectation is acquired in respect of the prior distributions that are considered for the unknown parameters. Thus, it will only be a function of experimental settings (support points) and their weights. The prior distribution of the fixed parameters is considered uniform and normal. The Bayesian D-optimal design is finally calculated numerically by R3.1.1 software.     

Integer-valued moving average (INMA) process

A simple model for a stationary sequence of dependent integer-valued random variables {X_n} is given. The sequence to be called integer-valued moving average (INMA) process, is taken as the “survivals” of i.i.d. non-negative integervalued random variables. It is argued that the model’s structure reflects to some extent the mechanism generating real life data for many counting process and consequently it is useful for modelling such processes. Various properties for the special case in which {X_n} is Poisson INMA (1) process, such as the joint distribution, regression, time reversibility, along with the conditional and partial correlations, are discussed in details. Extension of the INMA of first order to higher order moving average is considered.     

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.     

Higher-Order Moments Using the Survival Function: The Alternative Expectation Formula

Undergraduate and graduate students in a first-year probability (or a mathematical statistics) course learn the important concept of the moment of a random variable. The moments are related to various aspects of a probability distribution. In this context, the formula for the mean or the first moment of a nonnegative continuous random variable is often shown in terms of its c.d.f. (or the survival function). This has been called the alternative expectation formula. However, higher-order moments are also important, for example, to study the variance or the skewness of a distribution. In this note, we consider the rth moment of a nonnegative random variable and derive formulas in terms of the c.d.f. (or the survival function) paralleling the existing results for the first moment (the mean) using Fubini's theorem. Both nonnegative continuous and discrete integer-valued random variables are considered. These formulas may be advantageous, for example, when dealing with the moments of a transformed random variable, where it may be easier to derive its c.d.f. using the so-called c.d.f. method.     

Regression analysis for discrete event history or failure time data

The paper deals with discrete-time regression models to analyze multistate—multiepisode models for event history data or failure time data collected in follow-up studies, retrospective studies, or longitudinal panels. The models are applicable if the events are not dated exactly but only a time interval is recorded. The models include individual specific parameters to account for unobserved heterogeneity. The explantory variables may be time-varying and random with distributions depending on the observed history of the process. Different estimation procedures are considered: Estimation of structural as well as individual specific parameters by maximization of a joint likelihood function, estimation of the structural parameters by maximization of a conditional likelihood function conditioning on a set of sufficient statistics for the individual specific parameters, and estimation of the structural parameters by maximization of a marginal likelihood function assuming that the individual specific parameters follow a distribution. The advantages and limitations of the different approaches are discussed.     

The inspection paradox with random time

When considering a delayed renewal process one may be interested in both, the renewal function and the expected length of the interarrival time that contains some fixed time t. In general, it is difficult to obtain explicit expressions for specific underlying distributions. Replacing t by a random variable T and using prior information about T, that is, assuming that T has some continuous NBU (NWU) distribution function G, bounds of the quantities are derived as well as representations, if T is exponentially distributed. As an implication an equation of Wald type is shown. The results can be applied to the analysis of control charts in quality control. Moreover, related bounds of a sample mean based on a random sample size are given and an elementary renewal reward theorem is stated.