Probability Generating Function Based Jeffrey's Divergence for Statistical Inference

Statistical inference procedures based on transforms such as characteristic function and probability generating function have been examined by many researchers because they are much simpler than probability density functions. Here, a probability generating function based Jeffrey's divergence measure is proposed for parameter estimation and goodness-of-fit test. Being a member of the M-estimators, the proposed estimator is consistent. Also, the proposed goodness-of-fit test has good statistical power. The proposed divergence measure shows improved performance over existing probability generating function based measures. Real data examples are given to illustrate the proposed parameter estimation method and goodness-of-fit test.     

The k-factor GARMA Process with Infinite Variance Innovations

In this article, we develop the theory of k-factor Gegenbauer Autoregressive Moving Average (GARMA) process with infinite variance innovations which is a generalization of the stable seasonal fractional Autoregressive Integrated Moving Average (ARIMA) model introduced by Diongue et al. (2008 Diongue, A.K., Guégan, D. (2008). Estimation of k-Factor GIGARCH Process: A Monte Carlo Study. Communications in Statistics-Simulation and Computation 37:2037–2049.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]). Stationarity and invertibility conditions of this new model are derived. Conditional Sum of Squares (CSS) and Markov Chains Monte Carlo (MCMC) Whittle methods are investigated for parameter estimation. Monte Carlo simulations are also used to evaluate the finite sample performance of these estimation techniques. Finally, the usefulness of the model is corroborated with the application to streamflow data for Senegal River at Bakel.     

Symmetrical Design of Experiment in Global Sensitivity Analysis Based on ANOVA High-dimensional Model Representation

This article reviews symmetrical global sensitivity analysis based on the analysis of variance of high-dimensional model representation. To overcome the computational difficulties and explore the use of symmetrical design of experiment (SDOE), two methods are presented. If the form of the objective function f is known, we use SDOE to estimate the symmetrical global sensitivity indices instead of Monte Carlo or quasi-Monte Carlo simulation. Otherwise, we use the observed values of the experiment to do symmetrical global sensitivity analysis. These methods are easy to implement and can reduce the computational cost. An example is given by symmetrical design of experiment.     

Predictive Inference for Big,Spatial, Non‐Gaussian Data: MODIS Cloud Data and its Change‐of‐Support

Remote sensing of the earth with satellites yields datasets that can be massive in size, nonstationary in space, and non‐Gaussian in distribution. To overcome computational challenges, we use the reduced‐rank spatial random effects (SRE) model in a statistical analysis of cloud‐mask data from NASA's Moderate Resolution Imaging Spectroradiometer (MODIS) instrument on board NASA's Terra satellite. Parameterisations of cloud processes are the biggest source of uncertainty and sensitivity in different climate models’ future projections of Earth's climate. An accurate quantification of the spatial distribution of clouds, as well as a rigorously estimated pixel‐scale clear‐sky‐probability process, is needed to establish reliable estimates of cloud‐distributional changes and trends caused by climate change. Here we give a hierarchical spatial‐statistical modelling approach for a very large spatial dataset of 2.75 million pixels, corresponding to a granule of MODIS cloud‐mask data, and we use spatial change‐of‐Support relationships to estimate cloud fraction at coarser resolutions. Our model is non‐Gaussian; it postulates a hidden process for the clear‐sky probability that makes use of the SRE model, EM‐estimation, and optimal (empirical Bayes) spatial prediction of the clear‐sky‐probability process. Measures of prediction uncertainty are also given.     

Multivariate process dispersion monitoring without subgrouping

The memory-type adaptive and non-adaptive control charts are among the best control charts for detecting small-to-moderate changes in the process parameter(s). In this paper, we propose the Crosier CUSUM (CCUSUM), EWMA, adaptive CCUSUM (ACCUSUM) and adaptive EWMA (AEWMA) charts for efficiently monitoring the changes in the covariance matrix of a multivariate normal process without subgrouping. Using extensive Monte Carlo simulations, the length characteristics of these control charts are computed. It turns out that the ACCUSUM and AEWMA charts perform uniformly and substantially better than the CCUSUM and EWMA charts when detecting a range of shift sizes in the covariance matrix. Moreover, the AEWMA chart outperforms the ACCUSUM chart. A real dataset is used to explain the implementation of the proposed control charts.     

Binary probability maps using a hidden conditional autoregressive Gaussian process with an application to Finnish common toad data

The Finnish common toad data of Heikkinen and Hogmander are reanalysed using an alternative fully Bayesian model that does not require a pseudolikelihood approximation and an alternative prior distribution for the true presence or absence status of toads in each 10 km×10 km square. Markov chain Monte Carlo methods are used to obtain posterior probability estimates of the square-specific presences of the common toad and these are presented as a map. The results are different from those of Heikkinen and Hogmander and we offer an explanation in terms of the prior used for square-specific presence of the toads. We suggest that our approach is more faithful to the data and avoids unnecessary confounding of effects. We demonstrate how to extend our model efficiently with square-specific covariates and illustrate this by introducing deterministic spatial changes.     

Analysis of Competing Risks by Using Bayesian Smoothing

We consider the competing risks set-up. In many practical situations, the conditional probability of the cause of failure given the failure time is of direct interest. We propose to model the competing risks by the overall hazard rate and the conditional probabilities rather than the cause-specific hazards. We adopt a Bayesian smoothing approach for both quantities of interest. Illustrations are given at the end.     

Importance of interpolation when constructing double-bootstrap confidence intervals

We show that, in the context of double-bootstrap confidence intervals, linear interpolation at the second level of the double bootstrap can reduce the simulation error component of coverage error by an order of magnitude. Intervals that are indistinguishable in terms of coverage error with theoretical, infinite simulation, double-bootstrap confidence intervals may be obtained at substantially less computational expense than by using the standard Monte Carlo approximation method. The intervals retain the simplicity of uniform bootstrap sampling and require no special analysis or computational techniques. Interpolation at the first level of the double bootstrap is shown to have a relatively minor effect on the simulation error.     

Bayesian inference for stable Lévy–driven stochastic differential equations with high‐frequency data

In this paper, we consider parametric Bayesian inference for stochastic differential equations driven by a pure‐jump stable Lévy process, which is observed at high frequency. In most cases of practical interest, the likelihood function is not available; hence, we use a quasi‐likelihood and place an associated prior on the unknown parameters. It is shown under regularity conditions that there is a Bernstein–von Mises theorem associated to the posterior. We then develop a Markov chain Monte Carlo algorithm for Bayesian inference, and assisted with theoretical results, we show how to scale Metropolis–Hastings proposals when the frequency of the data grows, in order to prevent the acceptance ratio from going to zero in the large data limit. Our algorithm is presented on numerical examples that help verify our theoretical findings.