Uniform asymptotic linearity of a process based on a signed rank statistic

Consider the process with, cf. (1.2) on page 265 in B1, X₁, …, X_N a sample from a distribution F and, for i = 1, …, N, R${}_{\text{|x}{}_{\text{1}}\text{, - q}{}_{\text{1}}\text{ø|}}$ , the rank of |X₁ - q₁ø| among |X₁ - q₁ø|, …, |X_N - q_Nø|. It is shown that, under certain regularity conditions on F and on the constants p_i and q_i, T^ø_N(t) is asymptotically approximately a linear function of ø uniformly in t and in ø for |ø| ≤ C. The special case where the p_i and the q_i, are independent of i is considered.     

Uniform asymptotic linearity in a regression parameter of a process based on a rank statistic

For X₁, …, X_N a random sample from a distribution F, let the process S^δ_N(t) be defined as where K²_N = σ^N_i=1(c_i ? c?)² and R x_i, + Δd, is the rank of X_i + Δd_i, among X₁ + Δd₁, …, X_N + Δd_N. The purpose of this note is to prove that, under certain regularity conditions on F and on the constants c_i and d_i, S^Δ_N (t) is asymptotically approximately a linear function of Δ, uniformly in t and in Δ, |Δ| ≤ C. The special case of two samples is considered.     

Local rates of convergence for consistent estimators of location of translation families

We consider the estimation of a location parameter θ in a one-sample problem. A measure of the asymptotic performance of an estimator sequence {T_n} = T is given by the exponential rate of convergence to zero of the tail probability, which for consistent estimator sequences is bounded by a constant, B (θ, ?), called the Bahadur bound. We consider two consistent estimators: the maximum-likelihood estimator (mle) and a consistent estimator based on a likelihood-ratio statistic, which we call the probability-ratio estimator (pre). In order to compare the local behaviour of these estimators, we obtain Taylor series expansions in ? for B (θ, ?) and the exponential rates of the mle and pre. Finally, some numerical work is presented in which we consider a variety of underlying distributions.     

Asymptotic properties of Bayes risk for one-sided tests

Consider a given sequence {T_n} of estimators for a real-valued parameter θ. This paper studies asymptotic properties of restricted Bayes tests of the following form: reject H₀:θ ≤ θ₀ in favour of the alternative θ > θ₀ if T_n ≤ C_n, where the critical point C_n is determined to minimize among all tests of this form the expected probability of error with respect to the prior distribution. Such tests may or may not be fully Bayes tests, and so are called T_n-Bayes. Under fairly broad conditions it is shown that and the T_n-Bayes risk where a_n is the order of the standard error of T_n, - is the prior density, and μ is the median of F, the limit distribution of (T_n – θ)/a_nb(θ). Several examples are given.     

Asymptotic results for empirical and partial-sum processes: A review

Two processes of importance in statistics and probability are the empirical and partial-sum processes. Based on d-dimensional data X₁, … X_a the empirical measure is defined for any A ⊂ R^d by the sample proportion of observations in A. When normalized, F_n yields the empirical process W_n: = n^1/2 (F_n - F), where F denotes the “true” probability measure. To define partial-sum processes, one needs data that are assigned to specified locations (in contrast to the above, where specified unit masses are assigned to random locations). A suitable context for many applications is that of data attached to points of a lattice, say {X_j:j ϵ J^d} where J = {1, 2,…}, for which the partial sums are defined for any A ⊂ R^d by Thus S(A) is the sum of the data contained in A. When normalized, S yields the partial-sum process. This paper provides an overview of asymptotic results for empirical and partial-sum processes, including strong laws and central limit theorems, together with some indications of their inferential implications.     

Quasi-universal bandwidth selection for kernel density estimators

Let f?_n, h denote the kernel density estimate based on a sample of size n drawn from an unknown density f. Using techniques from L₂ projection density estimators, the author shows how to construct a data-driven estimator f?_n, h which satisfies This paper is inspired by work of Stone (1984), Devroye and Lugosi (1996) and Birge and Massart (1997).     

Estimation bayesienne des effets dans le modele a effets aleatoires de classification double avec interaction

The problem of estimating the effects in a balanced two-way classification with interaction \documentclass{article}\pagestyle{empty}\begin{document}$i = 1, \ldots ,I;j = 1, \ldots ,J;k = 1, \ldots ,K$\end{document} using a random effect model is considered from a Bayesian view point. Posterior distributions of r_i, c_j and t_ij are obtained under the assumptions that r_i, c_j, t_ij and e_ijk are all independently drawn from normal distributions with zero meansand variances \documentclass{article}\pagestyle{empty}\begin{document}$\sigma _r^2 ,\sigma _c^2 ,\sigma _t^2 ,\sigma _e^2$\end{document} respectively. A non informative reference prior is adopted for \documentclass{article}\pagestyle{empty}\begin{document}$\mu ,\sigma _r^2 ,\sigma _c^2 ,\sigma _t^2 ,\sigma _e^2$\end{document}. Various features of thisposterior distribution are obtained. The same features of the psoterior distribution for a fixed effect model are also obtained. A numerical example is given.     

On a random series in a hilbert space

Let (S_n) be partial sums of a non-degenerate sequence of Identically and independently distributed random variables taking values in a separable Hilbert space. Then for 0 ≤ β ≤ 3/2, the series converges almost nowhere. For β > 3/2 this may not be true.     

On multivariate variable-kernel density estimates for time series

Let X₁ be a strictly stationary multiple time series with values in R^d and with a common density f. Let X₁,.,.,X_n, be n consecutive observations of X₁. Let k = k_n, be a sequence of positive integers, and let H_ni be the distance from X_i to its kth nearest neighbour among X_j, j i. The multivariate variable-kernel estimate f_n, of f is defined by where K is a given density. The complete convergence of f_n, to f on compact sets is established for time series satisfying a dependence condition (referred to as the strong mixing condition in the locally transitive sense) weaker than the strong mixing condition. Appropriate choices of k are explicitly given. The results apply to autoregressive processes and bilinear time-series models.     

Distribution of the correlation coefficient for the class of bivariate elliptical models

We consider n pairs of random variables (X₁₁,X₂₁),(X₁₂,X₂₂),… (X_1n,X_2n) having a bivariate elliptically contoured density of the form where θ₁ θ₂ are location parameters and Δ = ((λ_ik)) is a 2 × 2 symmetric positive definite matrix of scale parameters. The exact distribution of the Pearson product-moment correlation coefficient between X₁ and X₂ is obtained. The usual case when a sample of size n is drawn from a bivariate normal population is a special case of the abovementioned model.     

Constrained nonparametric maximum likelihood estimation of stochastically ordered survivor functions

This paper considers estimators of survivor functions subject to a stochastic ordering constraint based on right censored data. We present the constrained nonparametric maximum likelihood estimator (C‐NPMLE) of the survivor functions in one‐and two‐sample settings where the survivor distributions could be discrete or continuous and discuss the non‐uniqueness of the estimators. We also present a computationally efficient algorithm to obtain the C‐NPMLE. To address the possibility of non‐uniqueness of the C‐NPMLE of $S_1(t)$ when $S_1(t)\le S_2(t)$ , we consider the maximum C‐NPMLE (MC‐NPMLE) of $S_1(t)$ . In the one‐sample case with arbitrary upper bound survivor function $S_2(t)$ , we present a novel and efficient algorithm for finding the MC‐NPMLE of $S_1(t)$ . Dykstra ( 1982 ) also considered constrained nonparametric maximum likelihood estimation for such problems, however, as we show, Dykstra's method has an error and does not always give the C‐NPMLE. We corrected this error and simulation shows improvement in efficiency compared to Dykstra's estimator. Confidence intervals based on bootstrap methods are proposed and consistency of the estimators is proved. Data from a study on larynx cancer are analysed to illustrate the method. The Canadian Journal of Statistics 40: 22–39; 2012 © 2012 Statistical Society of Canada     

The uniform convergence of the nadaraya-watson regression function estimate

If (X₁,Y₁), …, (X_n,Y_n) is a sequence of independent identically distributed R_d × R-valued random vectors then Nadaraya (1964) and Watson (1964) proposed to estimate the regression function m(x) = ? {Y₁|X₁ = x{ by where K is a known density and {h_n} is a sequence of positive numbers satisfying certain properties. In this paper a variety of conditions are given for the strong convergence to 0 of ess_Xsup|m_n (X)-m(X)| (here X is independent of the data and distributed as X₁). The theorems are valid for all distributions of X₁ and for all sequences {h_n} satisfying h_n → 0 and nh/log n→0.     

Confidence intervals following Box-Cox transformation

What is the interpretation of a confidence interval following estimation of a Box-Cox transformation parameter λ? Several authors have argued that confidence intervals for linear model parameters ψ can be constructed as if λ. were known in advance, rather than estimated, provided the estimand is interpreted conditionally given $\hat \lambda$. If the estimand is defined as $\psi \left( {\hat \lambda } \right)$, a function of the estimated transformation, can the nominal confidence level be regarded as a conditional coverage probability given $\hat \lambda$, where the interval is random and the estimand is fixed? Or should it be regarded as an unconditional probability, where both the interval and the estimand are random? This article investigates these questions via large-n approximations, small- σ approximations, and simulations. It is shown that, when model assumptions are satisfied and n is large, the nominal confidence level closely approximates the conditional coverage probability. When n is small, this conditional approximation is still good for regression models with small error variance. The conditional approximation can be poor for regression models with moderate error variance and single-factor ANOVA models with small to moderate error variance. In these situations the nominal confidence level still provides a good approximation for the unconditional coverage probability. This suggests that, while the estimand may be interpreted conditionally, the confidence level should sometimes be interpreted unconditionally.     

Multivariate Kendall's tau for change‐point detection in copulas

Statistical procedures for the detection of a change in the dependence structure of a series of multivariate observations are studied in this work. The test statistics that are proposed are $L_1$ , $L_2$ , and $L_{\infty }$ distances computed from vectors of differences of Kendall's tau; two multivariate extensions of Kendall's measure of association are used. Since the distributions of these statistics under the null hypothesis of no change depend on the unknown underlying copula of the vectors, a procedure based on the multiplier central limit theorem is used for the computation of p‐values; the method is shown to be valid both asymptotically and for moderate sample sizes. Alternative versions of the tests that take into account possible breakpoints in the marginal distributions are also investigated. Monte Carlo simulations show that the tests are powerful under many scenarios of change‐point. In addition, two estimators of the time of change are proposed and their efficiency is carefully studied. The methodologies are illustrated on simulated series from the Canadian Regional Climate Model. The Canadian Journal of Statistics 41: 65–82; 2013 © 2012 Statistical Society of Canada     

Robust location estimation with missing data

In a missing data setting, we have a sample in which a vector of explanatory variables ${\bf x}_i$ is observed for every subject i, while scalar responses $y_i$ are missing by happenstance on some individuals. In this work we propose robust estimators of the distribution of the responses assuming missing at random (MAR) data, under a semiparametric regression model. Our approach allows the consistent estimation of any weakly continuous functional of the response's distribution. In particular, strongly consistent estimators of any continuous location functional, such as the median, L‐functionals and M‐functionals, are proposed. A robust fit for the regression model combined with the robust properties of the location functional gives rise to a robust recipe for estimating the location parameter. Robustness is quantified through the breakdown point of the proposed procedure. The asymptotic distribution of the location estimators is also derived. The proofs of the theorems are presented in Supplementary Material available online. The Canadian Journal of Statistics 41: 111–132; 2013 © 2012 Statistical Society of Canada     

Contaminated normal modeling with application to microarray data analysis

A contaminated beta model $(1-\gamma) B(1,1) + \gamma B(\alpha,\beta)$ is often used to describe the distribution of $P$ ‐values arising from a microarray experiment. The authors propose and examine a different approach: namely, using a contaminated normal model $(1-\gamma) N(0,\sigma^2) + \gamma N(\mu,\sigma^2)$ to describe the distribution of $Z$ statistics or suitably transformed $T$ statistics. The authors then address whether a researcher who has $Z$ statistics should analyze them using the contaminated normal model or whether the $Z$ statistics should be converted to $P$ ‐values to be analyzed using the contaminated beta model. The authors also provide a decision‐theoretic perspective on the analysis of $Z$ statistics. The Canadian Journal of Statistics 38: 315–332; 2010 © 2010 Statistical Society of Canada     

Estimators of shift based on statistics of the Kolmogorov-Smirnov type

This paper is concerned with the estimation of a shift parameter δ_o, based on some nonnegative functional Hg₁ of the pair (D^δ_N(x), f?^δ_N(x)), where D^δ_N(x) = K_N/b {F_2,n(x)—F_1,m (x + δ)}, +^δ_N(x) = {mF_1,m (x + δ) + nF_2,n(x)}/N, where F_1,m and F_2,n are the empirical distribution functions of two independent random samples (N = m + n), and where K²_N = mn/N. First an estimator δ_N, is defined as a value of δ minimizing a functional H of the type of H₁. A second estimator δ¹_N is also defined which is a linearized version of the first. Finite and asymptotic properties of these estimators are considered. It is also shown that most well-known test statistics of the Kolmogorov-Smirnov type are particular cases of such functionals H₁. The asymptotic distribution and the asymptotic efficiency of some estimators are given.     

Consistency of maximum likelihood estimators in a large class of deconvolution models

We consider the maximum likelihood estimator $\hat{F}_n$ of a distribution function in a class of deconvolution models where the known density of the noise variable is of bounded variation. This class of noise densities contains in particular bounded, decreasing densities. The estimator $\hat{F}_n$ is defined, characterized in terms of Fenchel optimality conditions and computed. Under appropriate conditions, various consistency results for $\hat{F}_n$ are derived, including uniform strong consistency. The Canadian Journal of Statistics 41: 98–110; 2013 © 2012 Statistical Society of Canada     

Strassen type limit points for moving averages of a wiener process

Let {W(s); 8 ≥ 0} be a standard Wiener process, and let β_N = (2a_N (log (N/a_N) + log log N)^-1/2, 0 < α_N ≤ N < ∞, where α_N↑ and α_N/N is a non-increasing function of N, and define γ_N(t) = β_N[W(n_N + ta_N) ? W(n_N)), 0 ≥ t ≥ 1, with n_N = N – a_N. Let K = {x ? C[0,1]: x is absolutely continuous, x(0) = 0 and }. We prove that, with probability one, the sequence of functions {γ_N(t), t ? [0,1]} is relatively compact in C[0,1] with respect to the sup norm ||·||, and its set of limit points is K. With a_N = N, our result reduces to Strassen's well-known theorem. Our method of proof follows Strassen's original, direct approach. The latter, however, contains an oversight which, in turn, renders his proof invalid. Strassen's theorem is true, of course, and his proof can also be rectified. We do this in a somewhat more general context than that of his original theorem. Applications to partial sums of independent identically distributed random variables are also considered.     

Estimating prediction error in microarray classification: Modifications of the 0.632+ bootstrap when ${\bf n} < {\bf p}$

We are interested in estimating prediction error for a classification model built on high dimensional genomic data when the number of genes (p) greatly exceeds the number of subjects (n). We examine a distance argument supporting the conventional 0.632+ bootstrap proposed for the $n > p$ scenario, modify it for the $n < p$ situation and develop learning curves to describe how the true prediction error varies with the number of subjects in the training set. The curves are then applied to define adjusted resampling estimates for the prediction error in order to achieve a balance in terms of bias and variability. The adjusted resampling methods are proposed as counterparts of the 0.632+ bootstrap when $n < p$ , and are found to improve on the 0.632+ bootstrap and other existing methods in the microarray study scenario when the sample size is small and there is some level of differential expression. The Canadian Journal of Statistics 41: 133–150; 2013 © 2012 Statistical Society of Canada