The likelihood ratio test for homogeneity in finite mixture models

The authors study the asymptotic behaviour of the likelihood ratio statistic for testing homogeneity in the finite mixture models of a general parametric distribution family. They prove that the limiting distribution of this statistic is the squared supremum of a truncated standard Gaussian process. The autocorrelation function of the Gaussian process is explicitly presented. A re‐sampling procedure is recommended to obtain the asymptotic p‐value. Three kernel functions, normal, binomial and Poisson, are used in a simulation study which illustrates the procedure.     

Saddlepoint-Based Bootstrap Inference for Quadratic Estimating Equations

Abstract.  We propose an easy to implement method for making small sample parametric inference about the root of an estimating equation expressible as a quadratic form in normal random variables. It is based on saddlepoint approximations to the distribution of the estimating equation whose unique root is a parameter's maximum likelihood estimator (MLE), while substituting conditional MLEs for the remaining (nuisance) parameters. Monotoncity of the estimating equation in its parameter argument enables us to relate these approximations to those for the estimator of interest. The proposed method is equivalent to a parametric bootstrap percentile approach where Monte Carlo simulation is replaced by saddlepoint approximation. It finds applications in many areas of statistics including, nonlinear regression, time series analysis, inference on ratios of regression parameters in linear models and calibration. We demonstrate the method in the context of some classical examples from nonlinear regression models and ratios of regression parameter problems. Simulation results for these show that the proposed method, apart from being generally easier to implement, yields confidence intervals with lengths and coverage probabilities that compare favourably with those obtained from several competing methods proposed in the literature over the past half-century.     

Estimating the number of clusters

Hartigan (1975) defines the number q of clusters in a d ‐variate statistical population as the number of connected components of the set {f > c}, where f denotes the underlying density function on R^d and c is a given constant. Some usual cluster algorithms treat q as an input which must be given in advance. The authors propose a method for estimating this parameter which is based on the computation of the number of connected components of an estimate of {f > c}. This set estimator is constructed as a union of balls with centres at an appropriate subsample which is selected via a nonparametric density estimator of f. The asymptotic behaviour of the proposed method is analyzed. A simulation study and an example with real data are also included.     

Generalized integer-valued random coefficient for a first order structure autoregressive (RCINAR) process

A random coefficient autoregressive process for count data based on a generalized thinning operator is presented. Existence and weak stationarity conditions for these models are established. For the particular case of the (generalized) binomial thinning, it is proved that the necessary and sufficient conditions for weak stationarity are the same as those for continuous-valued AR(1) processes. These kinds of processes are appropriate for modelling non-linear integer-valued time series. They allow for over-dispersion and are appropriate when including covariates. Model parameters estimators are calculated and their properties studied analytically and/or through simulation.     

Bootstrap procedures in a spatial-temporal model

Two bootstrap procedures are introduced into the hybrid of the backfitting algorithm and the Cochrane–Orcutt procedure in the estimation of a spatial-temporal model. The use of time blocks of consecutive observations in resampling steps proved to be optimal in terms of stability and efficiency of estimates. Between iterations, there were minimal changes in the empirical distributions of the parameter estimates associated with the covariate and temporal effects indicating convergence of the algorithm. Crop yield data are used to illustrate the proposed methods.

The simulation study indicated that prediction error from the fitted model (estimated from either Method 1 or Method 2) is very low. Also, the prediction error is relatively robust to the number of spatial units and the number of time points.     

Obtaining prediction intervals for FARIMA processes using the sieve bootstrap

The sieve bootstrap (SB) prediction intervals for invertible autoregressive moving average (ARMA) processes are constructed using resamples of residuals obtained by fitting a finite degree autoregressive approximation to the time series. The advantage of this approach is that it does not require the knowledge of the orders, p and q, associated with the ARMA(p, q) model. Up until recently, the application of this method has been limited to ARMA processes whose autoregressive polynomials do not have fractional unit roots. The authors, in a 2012 publication, introduced a version of the SB suitable for fractionally integrated autoregressive moving average (FARIMA (p,d,q)) processes with 0<d<0.5 and established its asymptotic validity. Herein, we study the finite sample properties this new method and compare its performance against an older method introduced by Bisaglia and Grigoletto in 2001. The sieve bootstrap (SB) method is a numerically simpler alternative to the older method which requires the estimation of p, d, and q at every bootstrap step. Monte-Carlo simulation studies, carried out under the assumption of normal, mixture of normals, and exponential distributions for the innovations, show near nominal coverages for short-term and long-term SB prediction intervals under most situations. In addition, the sieve bootstrap method yields better coverage and narrower intervals compared to the Bisaglia–Grigoletto method in some situations, especially when the error distribution is a mixture of normals.     

Transformation and Smoothing in Sample Survey Data

Abstract. We consider model‐based prediction of a finite population total when a monotone transformation of the survey variable makes it appropriate to assume additive, homoscedastic errors. As the transformation to achieve this does not necessarily simultaneously produce an easily parameterized mean function, we assume only that the mean is a smooth function of the auxiliary variable and estimate it non‐parametrically. The back transformation of predictions obtained on the transformed scale introduces bias which we remove using smearing. We obtain an asymptotic expansion for the prediction error which shows that prediction bias is asymptotically negligible and the prediction mean‐squared error (MSE) using a non‐parametric model remains in the same order as when a parametric model is adopted. The expansion also shows the effect of smearing on the prediction MSE and can be used to compute the asymptotic prediction MSE. We propose a model‐based bootstrap estimate of the prediction MSE. The predictor produces competitive results in terms of bias and prediction MSE in a simulation study, and performs well on a population constructed from an Australian farm survey.     

Heteroskedasticity-consistent interval estimators

The linear regression model is commonly used in applications. One of the assumptions made is that the error variances are constant across all observations. This assumption, known as homoskedasticity, is frequently violated in practice. A commonly used strategy is to estimate the regression parameters by ordinary least squares and to compute standard errors that deliver asymptotically valid inference under both homoskedasticity and heteroskedasticity of an unknown form. Several consistent standard errors have been proposed in the literature, and evaluated in numerical experiments based on their point estimation performance and on the finite sample behaviour of associated hypothesis tests. We build upon the existing literature by constructing heteroskedasticity-consistent interval estimators and numerically evaluating their finite sample performance. Different bootstrap interval estimators are also considered. The numerical results favour the HC4 interval estimator.     

Testing for Stochastic Dominance Efficiency

We consider consistent tests for stochastic dominance efficiency at any order of a given portfolio with respect to all possible portfolios constructed from a set of assets. We justify block bootstrap approaches to achieve valid inference in a time series setting. The test statistics are computed using linear and mixed integer programming formulations. Monte Carlo results show that the bootstrap procedure performs well in finite samples. The empirical application reveals that the Fama and French market portfolio is first and second-order stochastic dominance efficient, although it is mean–variance inefficient.     

A multiple model discrimination procedure

The case of selecting between a set of fixed models is considered. The true model is assumed to be contained in the set of proposed models and errors are taken to be normally distributed. A sequential procedure which yeilds probabilities of incorrect selections is proposed. The procedure is shown to have optimal properties and is extended to the estimated model case by a bootstrap procedure.