Power comparison of the Kolmogorov–Smirnov test under ranked set sampling and simple random sampling

Many studies have been used to compare the power of several goodness-of-fit (GOF) tests under simple random sampling (SRS) and ranked set sampling (RSS). In our study, a different design procedure and ranking process in RSS are thoroughly investigated. A simulation study is conducted to compare the power of the Kolmogorov–Smirnov test under SRS and RSS with different sets and cycle sizes for several distributions. Level-2 sampling design and partially rank-ordered sets are used. Also, we benefited from auxiliary variables in the ranking process. Finally, results are presented with tables and figures. Under these conditions we show that the RSS has better performance against the SRS in finite population.     

Complete convergence and the strong laws of large numbers for pairwise NQD random variables

The authors study the strong convergence for sequences of pairwise negatively quadrant dependent (NQD) random variables under some wide conditions, and present some new theorems on the complete convergence and the strong laws of large numbers. The obtained results extend and improve some theorems in existing literature.     

Modified chain sampling plans for lot inspection by variables and attributes

The purpose of acceptance sampling is to develop decision rules to accept or reject production lots based on sample data. When testing is destructive or expensive, dependent sampling procedures cumulate results from several preceding lots. This chaining of past lot results reduces the required size of the samples. A large part of these procedures only chain past lot results when defects are found in the current sample. However, such selective use of past lot results only achieves a limited reduction of sample sizes. In this article, a modified approach for chaining past lot results is proposed that is less selective in its use of quality history and, as a result, requires a smaller sample size than the one required for commonly used dependent sampling procedures, such as multiple dependent sampling plans and chain sampling plans of Dodge. The proposed plans are applicable for inspection by attributes and inspection by variables. Several properties of their operating characteristic-curves are derived, and search procedures are given to select such modified chain sampling plans by using the two-point method.     

A discrete-time risk model with Poisson ARCH claim-number process

Abstract

In this paper, we propose a discrete-time risk model with the claim number following an integer-valued autoregressive conditional heteroscedasticity (ARCH) process with Poisson deviates. In this model, the current claim number depends on the previous observations. Within this framework, the equation for finding the adjustment coefficient is derived. Numerical studies are also carried out to examine the impact of the Poisson ARCH dependence structure on the ruin probability.     

On regression modelling with dummy variables versus separate regressions per group: Comment on Holgersson et al.

In a recent issue of this journal, Holgersson et al. [Dummy variables vs. category-wise models, J. Appl. Stat. 41(2) (2014), pp. 233–241, doi:10.1080/02664763.2013.838665] compared the use of dummy coding in regression analysis to the use of category-wise models (i.e. estimating separate regression models for each group) with respect to estimating and testing group differences in intercept and in slope. They presented three objections against the use of dummy variables in a single regression equation, which could be overcome by the category-wise approach. In this note, I first comment on each of these three objections and next draw attention to some other issues in comparing these two approaches. This commentary further clarifies the differences and similarities between dummy variable and category-wise approaches.     

A surplus process involving a compound Poisson counting process and applications

Abstract

In this paper, we introduce a surplus process involving a compound Poisson counting process, which is a generalization of the classical ruin model where the claim-counting process is a homogeneous Poisson process. The incentive is to model batch arrival of claims using a counting process that is based on a compound distribution. This reduces the difficulty of modeling claim amounts and is consistent with industrial data. Recursive formula, some properties and relevant main ruin theory results are provided. Further, we consider applications involving zero-truncated negative binomial and zero-truncated binomial batch arrivals when the claim amounts follow exponential or Erlang distribution.     

Conditional Akaike Information Criteria for a Class of Poisson Mixture Models with Random Effects

Focusing on the model selection problems in the family of Poisson mixture models (including the Poisson mixture regression model with random effects and zero‐inflated Poisson regression model with random effects), the current paper derives two conditional Akaike information criteria. The criteria are the unbiased estimators of the conditional Akaike information based on the conditional log‐likelihood and the conditional Akaike information based on the joint log‐likelihood, respectively. The derivation is free from the specific parametric assumptions about the conditional mean of the true data‐generating model and applies to different types of estimation methods. Additionally, the derivation is not based on the asymptotic argument. Simulations show that the proposed criteria have promising estimation accuracy. In addition, it is found that the criterion based on the conditional log‐likelihood demonstrates good model selection performance under different scenarios. Two sets of real data are used to illustrate the proposed method.     

Sum,product and ratio of Pareto and gamma variables

The exact distributions of X+Y, X Y and X/(X+Y) are studied when X and Y are independent Pareto and gamma random variables. Applications are discussed, to real problems in clinical trials, computer networks and economics.     

Simulating random variables using moment-generating functions and the saddlepoint approximation

When we are given only a transform such as the moment-generating function of a distribution, it is rare that we can efficiently simulate random variables. Possible approaches such as the inverse transform using numerical inversion of the transform are computationally very expensive. However, the saddlepoint approximation is known to be exact for the Normal, Gamma, and inverse Gaussian distribution and remarkably accurate for a large number of others. We explore the efficient use of the saddlepoint approximation for simulating distributions and provide three examples of the accuracy of these simulations.     

The aligned rank transform and discrete variables: A warning

For two-way layouts in a between subjects ANOVA design the aligned rank transform (ART) is compared with the parametric F-test as well as six other nonparametric methods: rank transform (RT), inverse normal transform (INT), a combination of ART and INT, Puri & Sen's L statistic, van der Waerden and Akritas & Brunners ATS. The type I error rates are computed for the uniform and the exponential distributions, both as continuous and in several variations as discrete distribution. The computations had been performed for balanced and unbalanced designs as well as for several effect models. The aim of this study is to analyze the impact of discrete distributions on the error rate. And it is shown that this scaling impact is restricted to the ART- as well as the combination of ART- and INT-method. There are two effects: first with increasing cell counts their error rates rise beyond any acceptable limit up to 20 percent and more. And secondly their rates rise when the number of distinct values of the dependent variable decreases. This behavior is more severe for underlying exponential distributions than for uniform distributions. Therefore there is a recommendation not to apply the ART if the mean cell frequencies exceed 10.