Empirical likelihood confidence bands for distribution functions with missing responses

Distribution function estimation plays a significant role of foundation in statistics since the population distribution is always involved in statistical inference and is usually unknown. In this paper, we consider the estimation of the distribution function of a response variable Y with missing responses in the regression problems. It is proved that the augmented inverse probability weighted estimator converges weakly to a zero mean Gaussian process. A augmented inverse probability weighted empirical log-likelihood function is also defined. It is shown that the empirical log-likelihood converges weakly to the square of a Gaussian process with mean zero and variance one. We apply these results to the construction of Gaussian process approximation based confidence bands and empirical likelihood based confidence bands of the distribution function of Y. A simulation is conducted to evaluate the confidence bands.     

Estimation and Welfare Analysis With Large Demand Systems

We develop an approach for estimating individual or household level preferences for a large set of quality-differentiated goods and for constructing Hicksian welfare measures within the demand system framework. Our approach uses a maximum simulated likelihood procedure to recover estimates of the structural parameters and a multistage, Monte Carlo Markov chain algorithm for constructing Hicksian consumer surplus estimates. We illustrate our approach with a recreation dataset consisting of day trips to 62 Mid-Atlantic beaches.     

Generalized RCINAR(1) Process with Signed Thinning Operator

A generalized random coefficient first-order integer-valued autoregressive process with signed thinning operator is introduced, this kind of process is appropriate for modeling negative integer-valued time series. Strict stationarity and ergodicity of process are established. Estimators of the parameters of interest are derived and their properties are studied via simulation. At last, we use bootstrap method in the real data analysis.     

The Method to Identify a Biomarker and to Evaluate Its Efficiency for Survival by Using the Joint Model of the Accelerate Failure Time and Longitudinal Data

In this article, we discuss how to identify longitudinal biomarkers in survival analysis under the accelerated failure time model and also discuss the effectiveness of biomarkers under the accelerated failure time model. Two methods proposed by Shcemper et al. are deployed to measure the efficacy of biomarkers. We use simulations to explore how the factors can influence the power of a score test to detect the association of a longitudinal biomarker and the survival time. These factors include the functional form of the random effects from the longitudinal biomarkers, in the different number of individuals, and time points per individual. The simulations are used to explore how the number of individuals, the number of time points per individual influence the effectiveness of the biomarker to predict survival at the given endpoint under the accelerated failure time model. We illustrate our methods using a prothrombin index as a predictor of survival in liver cirrhosis patients.     

Convergence Rate of Wavelet Expansions of Gaussian Random Processes

This article characterizes uniform convergence rate for general classes of wavelet expansions of stationary Gaussian random processes. The convergence in probability is considered.     

Generalized Linear Models

The importance of random number generators has increased over the years. This follows from the fact that contemporary research methods rely more and more on simulation and the increased importance of encryption technology. The output of a random number generator is created by either an algorithm or a physical device. The most popular method for random number generation is through the use of an algorithm. This article presents a new category of physical random bit generator that is packaged by several manufacturers. A statistical analysis of the output from the generators is given.     

On computer generation of gamma random variables by rejection and composition procedures 2

The paper presents various algorithms for generating gamma random variables, by combining rejection and composition procedures. Two efficient algorithms are given for the case when the parameter of the gamma distribution is 0<v<l. For the case vl, several algorithms are given but they (except one), work reliably only for small values of v. Results of some computer tests together with FORTRAN subroutines are also presented.     

Optimal estimation of a finite population mean under generalized random permutation models

Employing certain generalized random permutation models and a general class of linear estimators of a finite population mean, it is shown that many of the conventional estimators are “optimal” in the sense of minimum average mean square error. Simple proofs are provided by using a well-known theorem on UMV estimation. The results also cover certain simple response error situations.     

Asymptotic Distributions of Unit-Root Tests When the Process Is Nearly Stationary

Several test criteria are available for testing the hypothesis that the autoregressive polynomial of an autoregressive moving average process has a single unit root. Schwert (1989), using a Monte Carlo study, investigated the performance of some of the available test criteria. He concluded that the actual levels of the test criteria considered in his study are far from the specified levels when the moving average polynomial also has a root close to 1. This article studies the asymptotic null distribution of the test statistics for testing p = 1 in the model Y_t = pY _t-1 + e _t – 0e _t-1 as 0 approaches 1. It is shown that the test statistics differ from one another in their asymptotic properties depending on the rate at which 0 converges to 1.     

Multivariate forests with missing mixed outcomes

In this article, we propose a multivariate random forest method for multiple responses of mixed types with missing responses. Imputation is performed for each bootstrap sample used to build the individual trees that form the forest. The individual trees are built using a weighted splitting rule allowing downweighting of imputed observations. A simulation study shows the benefits of this approach over complete case analysis when missing responses are missing completely at random and missing at random (MAR). In particular, the gain in prediction accuracy of the proposed method is larger in the MAR case and also increases as the proportion of missing increases.