On Block Skip Free Transition Matrices and First Passage Times

Starting from an abstract setting which extends the property “skip free to the left” for transition matrices to a partition of the state space, we develop bounds for the mean hitting time of a Markov chain to an arbitrary subset from an arbitrary initial law. We apply our theory to the embedded Markov chains associated with the M/G/1 and the GI/M/1 queueing systems. We also illustrate its applicability with an asymptotic analysis of a non-reversible Markovian star queueing network with losses.     

Lower and Upper Bounds for Rectangular Probabilities

This article presents some results showing how rectangular probabilities can be studied using copula theory. These results lead us to develop new lower and upper bounds for rectangular probabilities which can be computed efficiently. The new bounds are compared with the ones obtained from the generalized Fréchet–Hoeffding bounds and Bonferroni-type inequalities.     

A Note on Estimation of a Distribution Function in a Nonparametric Set-up Using Stein’s Shrinkage Estimation Technique

Based on Stein’s famous shrinkage estimation of a multivariate normal distribution, we propose a new type of estimators of the distribution function of a random variable in a nonparametric setup. The proposed estimators are then compared with the empirical distribution function, which is the best equivariant estimator under a well-known loss function. Our extensive simulation study shows that our proposed estimators can perform better for moderate to large sample sizes.     

A Correlation Test for Normality Based on the Lévy Characterization

A powerful test of fit for normal distributions is proposed. Based on the Lévy characterization, the test statistic is the sample correlation coefficient of normal quantiles and sums of pairs of observations from a random sample. Since the test statistic is location-scale invariant, critical values can be obtained by simulation without estimating any parameters. It is proved that this test is consistent. A power comparison study including some directed tests shows that the proposed test is competitive, it is more powerful than the well-known Jarque–Bera test, and it is comparable to Shapiro–Wilk test against a number of alternatives.     

Pseudo-perfect and adaptive variants of the Metropolis–Hastings algorithm with an independent candidate density

We describe and examine an imperfect variant of a perfect sampling algorithm based on the Metropolis–Hastings algorithm that appears to perform better than a more traditional approach in terms of speed and accuracy. We then describe and examine an ‘adaptive’ Metropolis–Hastings algorithm which generates and updates a self-target candidate density in such a way that there is no ‘wrong choice’ for an initial candidate density. Simulation examples are provided.     

A theory of statistical models for Monte Carlo integration

Summary. The task of estimating an integral by Monte Carlo methods is formulated as a statistical model using simulated observations as data. The difficulty in this exercise is that we ordinarily have at our disposal all of the information required to compute integrals exactly by calculus or numerical integration, but we choose to ignore some of the information for simplicity or computational feasibility. Our proposal is to use a semiparametric statistical model that makes explicit what information is ignored and what information is retained. The parameter space in this model is a set of measures on the sample space, which is ordinarily an infinite dimensional object. None-the-less, from simulated data the base-line measure can be estimated by maximum likelihood, and the required integrals computed by a simple formula previously derived by Vardi and by Lindsay in a closely related model for biased sampling. The same formula was also suggested by Geyer and by Meng and Wong using entirely different arguments. By contrast with Geyer's retrospective likelihood, a correct estimate of simulation error is available directly from the Fisher information. The principal advantage of the semiparametric model is that variance reduction techniques are associated with submodels in which the maximum likelihood estimator in the submodel may have substantially smaller variance than the traditional estimator. The method is applicable to Markov chain and more general Monte Carlo sampling schemes with multiple samplers.     

Hidden Markov model for discrete circular–linear wind data time series

ABSTRACT

In this work, we deal with a bivariate time series of wind speed and direction. Our observed data have peculiar features, such as informative missing values, non-reliable measures under a specific condition and interval-censored data, that we take into account in the model specification. We analyse the time series with a non-parametric Bayesian hidden Markov model, introducing a new emission distribution, suitable to model our data, based on the invariant wrapped Poisson, the Poisson and the hurdle density. The model is estimated on simulated datasets and on the real data example that motivated this work.     

Sequential Estimation of a Continuous Distribution Function from Delayed Observations

The problem of sequentially estimating a continuous distribution function is considered in the case when the observations become available at random times. A certain class of sequential estimation procedures which are composed of optimal stopping time and sequential minimum risk invariant estimator of a continuous distribution function is obtained under a nonparametric invariant loss function and with the observation cost determined by a convex function of the moment of stopping and the number of observations up to this moment.     

An objective look at obtaining the plotting positions for QQ-plots

ABSTRACT

Choosing the plotting positions for the QQ-plot has been a subject of much debate in the statistical and engineering literature. This paper looks at this problem objectively by considering three frameworks: distribution-theoretic; decision-theoretic; game-theoretic. In each framework, we derive the plotting positions and show that there are more than one legitimate solution depending on the practitioner’s objective. This work clarifies the choice of the plotting positions by allowing one to easily find the mathematical equivalent of their view and choose the corresponding solution. This work also discusses approximations to the plotting positions when no closed form is available.