A note on the central limit theorem for the bootstrap mean

Following Yang (1988), a simple, more self-contained derivation of the asymptotic normality of the bootstrap mean is presented, as well as other asymptotic results. The derivations are appropriate for beginning graduate students in statistics, relying only on fundamental notions of probability theory and analysis,     

The graphical advantages of finite interval confidence band procedures

When presented as graphical illustrations, regression surface confidence bands for linear statistical models quickly convey detailed information about analysis results. A taut confidence band is a compact set of curves which are estimation candidates for the unobservable, fixed regression curve. The bounds of the band are usually plotted with the estimated regression curve and may be overlaid by a scatter-plot of the data to provide an integrated visual impression. Finite-interval confidence bands offer the advantages of clearer interpretation and improved efficiency and avoid visual ambiguities inherent to infinite-interval bands. The definitive characteristic of a finite-interval confidence band is that it is only necessary to plot it over a finite interval in order to visually communicate all its information. In contrast, visual representations of infinite-interval bands are not fully informative and can be misleading. When an infinite-interval band is plotted, and therefore truncated, substantial information given by its asymptotic behavior is lost. Many curves that are clearly within the plotted portion of the infinite interval confidence band eventually cross a boundary. In practice, a finite-interval band can always be easily obtained from any infinite-interval band. This article focuses on interpretational considerations of symmetric confidence bands as graphical devices.     

Some aspects of probability forecasting

The problems of assessing, comparing and combining probability forecasts for a binary events sequence are considered. A Gaussian threshold model (analytically of closed form) is introduced which allows generation of different probability forecast sequences valid for the same events. Chi - squared type test statistics, and also a marginal-conditional method are proposed for the assessment problem, and an asymptotic normality result is given. A graphical method is developed for the comparison problem, based upon decomposing arbitrary proper scoring rules into certain elementary scoring functions. The special role of the logarithmic scoring rule is examined in the context of Neyman - Pearson theory.     

Some small-sample results on a bounded influence rank regression method

Naranjo and HeUmansperger (1994) recently derved a bounded influence rank regression method and suggested how hypotheses about the regression coefficients might be tested. This brief note reports some simulation results on how their procedure performs when there is one predictor. Even when the error term is highly skewed, good control over the Type I error probability is obtained Power can be high relative to least squares regression when the error term has a heavy tailed distribution .and the predictor has a symmetric distribution However, if the predictor has a skewed distribution, power can be relatively low even when the distribution of the error term is heavy tailed. Despite this, it is argued that their method provides an important and useful alternative to ordinary least squares as well as other robust regression methods.     

Exact permutation inference for two sample repeated measures data

Experiments in which very few units are measured many times sometimes present particular difficulties. Interest often centers on simple location shifts between two treatment groups, but appropriate modeling of the error distribution can be challenging. For example, normality may be difficult to verify, or a single transformation stabilizing variance or improving normality for all units and all measurements may not exist. We propose an analysis of two sample repeated measures data based on the permutation distribution of units. This provides a distribution free alternative to standard analyses. The analysis includes testing, estimation and confidence intervals. By assuming a certain structure in the location shift model, the dimension of the problem is reduced by analyzing linear combinations of the marginal statistics. Recently proposed algorithms for computation of two sample permutation distributions, require only a few seconds for experiments having as many as 100 units and any number of repeated measures. The test has high asymptotic efficiency and good power with respect to tests based on the normal distribution. Since the computational burden is minimal, approximation of the permutation distribution is unnecessary.     

Econometric Applications of the Forward Search in Regression: Robustness,Diagnostics, and Graphics

The article illustrates the use of the forward search to provide robust analyses of econometric data. The emphasis is on informative plots that reveal the inferential importance of each observation. The division of observations into “good” and “bad” leverage points is shown to be potentially misleading.     

LOG-PERIODOGRAM ESTIMATION OF LONG MEMORY VOLATILITY DEPENDENCIES WITH CONDITIONALLY HEAVY TAILED RETURNS

ABSTRACT

Many recent papers have used semiparametric methods, especially the log-periodogram regression, to detect and estimate long memory in the volatility of asset returns. In these papers, the volatility is proxied by measures such as squared, log-squared, and absolute returns. While the evidence for the existence of long memory is strong using any of these measures, the actual long memory parameter estimates can be sensitive to which measure is used. In Monte-Carlo simulations, I find that if the data is conditionally leptokurtic, the log-periodogram regression estimator using squared returns has a large downward bias, which is avoided by using other volatility measures. In United States stock return data, I find that squared returns give much lower estimates of the long memory parameter than the alternative volatility measures, which is consistent with the simulation results. I conclude that researchers should avoid using the squared returns in the semiparametric estimation of long memory volatility dependencies.     

Workload Process,Waiting Times,and Sojourn Times in a Discrete Time MMAP[K]/SM[K]/1/FCFS Queue

Abstract

In this paper, we study the total workload process and waiting times in a queueing system with multiple types of customers and a first-come-first-served service discipline. An M/G/1 type Markov chain, which is closely related to the total workload in the queueing system, is constructed. A method is developed for computing the steady state distribution of that Markov chain. Using that steady state distribution, the distributions of total workload, batch waiting times, and waiting times of individual types of customers are obtained. Compared to the GI/M/1 and QBD approaches for waiting times and sojourn times in discrete time queues, the dimension of the matrix blocks involved in the M/G/1 approach can be significantly smaller.     

Level-Phase Independence for Fluid Queues

ABSTRACT

A Markov-modulated fluid queue is a two-dimensional Markov process; the first dimension is continuous and is usually called the level, and the second is the state of a Markov process that determines the evolution of the level, it is usually called the phase. We show that it is always possible to modify the transition rules at the boundary level of the fluid queue in order to obtain independence between the level and the phase under the stationary distribution. We obtain this result by exploiting the similarity between fluid queues and Quasi-Birth-and-Death (QBD) processes.     

Fast and Stable Algorithms for Computing and Sampling From the Noncentral Hypergeometric Distribution

Although the noncentral hypergeometric distribution underlies conditional inference for 2 × 2 tables, major statistical packages lack support for this distribution. This article introduces fast and stable algorithms for computing the noncentral hypergeometric distribution and for sampling from it. The algorithms avoid the expensive and explosive combinatorial numbers by using a recursive relation. The algorithms also take advantage of the sharp concentration of the distribution around its mode to save computing time. A modified inverse method substantially reduces the number of searches in generating a random deviate. The algorithms are implemented in a Java class, Hypergeometric, available on the World Wide Web.