Limit laws for the cumulative number of ties for the maximum in a random sequence

Let {_Xn,n?1}$\{X_n,n?1\}$ be a sequence of independent identically distributed random variables, taking nonnegative integer values. An observation _Xn$X_n$ is a tie for the maximum if _Xn=max{_X1,…,_Xn-1}$X_n=\max \{X_1,\dots ,X_{n-1}\}$. In this paper, we obtain weak and strong laws of large numbers and central limit theorems for the cumulative number of ties for the maximum among the first n$n$ observations.     

The use of an identity in Anderson for multivariate multiple testing

Consider the model where there are I$I$ independent multivariate normal treatment populations with p×1$p\times 1$ mean vectors _μi${\mathit{\mu }}_i$, i=1,…,I$i=1,\dots ,I$, and covariance matrix Σ$\Sigma$. Independently the (I+1)$(I+1)$st population corresponds to a control and it too is multivariate normal with mean vector _μI+1${\mathit{\mu }}_{I+1}$ and covariance matrix Σ$\Sigma$. Now consider the following two multiple testing problems.     

Prediction of long memory processes on same-realisation

For the class of stationary Gaussian long memory processes, we study some properties of the least-squares predictor of _Xn+1$X_{n+1}$ based on (_Xn,…,_X1)$(X_n,\dots ,X_1)$. The predictor is obtained by projecting _Xn+1$X_{n+1}$ onto the finite past and the coefficients of the predictor are estimated on the same realisation. First we prove moment bounds for the inverse of the empirical covariance matrix. Then we deduce an asymptotic expression of the mean-squared error. In particular we give a relation between the number of terms used to estimate the coefficients and the number of past terms used for prediction, which ensures the L²$L^2$- sense convergence of the predictor. Finally we prove a central limit theorem when our predictor converges to the best linear predictor based on all the past.     

Improving density estimators of discretely observed processes by interpolation

We consider density estimation for a smooth stationary process _Xt$X_t$, t∈R$t\in \mathbf{R}$, based on a discrete sample _Yi=_XΔi$Y_i=X_{\mathrm{\Delta }i}$, i=0,…,n=T/Δ$i=0,\dots ,n=T/\Delta$. By a suitable interpolation scheme of order p  , we augment data to form an approximation _Xp,t$X_{p,t}$, t∈[0,T]$t\in [0,T]$, of the continuous-time process and base our density estimate on the augmented sample path. Our results show that this can improve the rate of convergence (measured in terms of n) of the density estimate. Among other things, this implies that recording n   observations using a small Δ$\Delta$ can be more efficient than recording n independent observations.     

Nonparametric Bayes estimation in repair models

Consider a sequence of dependent random variables _X1,_X2,…,_Xn$X_1,X_2,\dots ,X_n$, where _X1$X_1$ has distribution F (or probability measure P  ), and the distribution of _Xi+1$X_{i+1}$ given _X1,…,_Xi$X_1,\dots ,X_i$ and other covariates and environmental factors depends on F   and the previous data, i=1,…,n-1$i=1,\dots ,n-1$. General repair models give rise to such random variables as the failure times of an item subject to repair. There exist nonparametric non-Bayes methods of estimating F in the literature, for instance, Whitaker and Samaniego [1989. Estimating the reliability of systems subject to imperfect repair. J. Amer. Statist. Assoc. 84, 301–309], Hollander et al. [1992. Nonparametric methods for imperfect repair models. Ann. Statist. 20, 879–896] and Dorado et al. [1997. Nonparametric estimation for a general repair model. Ann. Statist. 25, 1140–1160], etc. Typically these methods apply only to special repair models and also require repair data on N independent items until exactly only one item is left awaiting a “perfect repair”.     

Characterizations based on record values and order statistics

Consider a sequence of independent and identically distributed random variables {_Xi,i?1}$\{X_i,i?1\}$ with a common absolutely continuous distribution function F  . Let _X1:n?_X2:n???_Xn:n$X_{1:n}?X_{2:n}???X_{n:n}$ be the order statistics of {_X1,_X2,…,_Xn}$\{X_1,X_2,\dots ,X_n\}$ and {_Yl,l?1}$\{Y_l,l?1\}$ be the sequence of record values generated by {_Xi,i?1}$\{X_i,i?1\}$. In this work, the conditional distribution of _Yl$Y_l$ given _Xn:n$X_{n:n}$ is established. Some characterizations of F   based on record values and _Xn:n$X_{n:n}$ are then given.     

A sequential design for a clinical trial with a linear prognostic factor

We study a randomized adaptive design to assign one of the L$L$ treatments to patients who arrive sequentially by means of an urn model. At each stage n$n$, a reward is distributed between treatments. The treatment applied is rewarded according to its response, 0?_Yn?1$0?Y_n?1$, and 1-_Yn$1-Y_n$ is distributed among the other treatments according to their performance until stage n-1$n-1$. Patients can be classified in K+1$K+1$ levels and we assume that the effect of this level in the response to the treatments is linear. We study the asymptotic behavior of the design when the ordinary least square estimators are used as a measure of performance until stage n-1$n-1$.     

Likelihood ratio ordering of order statistics,mixtures and systems

Let X=(_X1,_X2,…,_Xn)$\mathit{X}=(X_1,X_2,\dots ,X_n)$ be an exchangeable random vector, and denote _X1:i=min{_X1,_X2,…,_Xi}$X_{1:i}=\min \{X_1,X_2,\dots ,X_i\}$ and _Xi:i=max{_X1,_X2,…,_Xi}$X_{i:i}=\max \{X_1,X_2,\dots ,X_i\}$, 1?i?n$1?i?n$. These order statistics represent the lifetimes of the series and the parallel systems, respectively, with component lifetimes _Xi$X_i$. In this paper we obtain conditions under which _X1:i$X_{1:i}$ (or _Xi:i$X_{i:i}$) decreases (increases) in i in the likelihood ratio (lr) order. An even more general result involving general (that is, not necessary exchangeable) random vectors is also derived for general series (or parallel) systems. We show that the series (parallel) systems are not necessarily lr-ordered even if the components are independent.     

Lattice and Schröder paths with periodic boundaries

We consider paths in the plane with (1,0$1,0$), (0,1$0,1$), and (a,b$a,b$)-steps that start at the origin, end at height n$n$, and stay strictly to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at most b/a$b/a$, then the ordinary generating function for the number of such paths ending at height n   is algebraic. Our argument is in two parts. We use a simple combinatorial decomposition to obtain an Appell relation or “umbral” generating function, in which the power zⁿ$z^n$ is replaced by a power series of the form zⁿ_φn(z),$z^n{\phi }_n(z),$ where _φn(0)=1.${\phi }_n(0)=1.$ Then we convert (in an explicit way) the umbral generating function to an ordinary generating function by solving a system of linear equations and a polynomial equation. This conversion implies that the ordinary generating function is algebraic. We give several concrete examples, including an alternative way to solve the tennis ball problem.     

Simultaneous estimation of Poisson means of the selected subset

Let _π1,_π2,…,_πp${\pi }_1,{\pi }_2,\dots ,{\pi }_p$ be p   independent Poisson populations with means _λ1,…,_λp${\lambda }_1,\dots ,{\lambda }_p$, respectively. Let {X₁,…,X_p} denote the set of observations, where X_i is from _πi${\pi }_i$. Suppose a subset of populations is selected using Gupta and Huang's (1975) selection rule which selects _πi${\pi }_i$ if and only if _Xi+1?_cX(1)$X_i+1?{\mathit{cX}}_{(1)}$, where X₍₁₎=max{X₁,…,X_p}, and 0<c<1$0<c<1$. In this paper, the simultaneous estimation of the Poisson means associated with the selected populations is considered for the k-normalized squared error loss function. It is shown that the natural estimator is positively biased. Also, a class of estimators that are better than the natural estimator is obtained by solving certain difference inequalities over the sample space. A class of estimators which dominate the UMVUE is also obtained. Monte carlo simulations are used to assess the percentage improvements and an application to a real-life example is also discussed.     

An identity for the Fisher information and Mahalanobis distance

Consider a mixture problem consisting of k classes. Suppose we observe an s-dimensional random vector X   whose distribution is specified by the relations P(X∈A|Y=i)=_Pi(A)$P(X\in A|Y=i)=P_i(A)$, where Y   is an unobserved class identifier defined on {1,…,k}$\{1,\dots ,k\}$, having distribution P(Y=i)=_pi$P(Y=i)=p_i$. Assuming the distributions _Pi$P_i$ having a common covariance matrix, elegant identities are presented that connect the matrix of Fisher information in Y   on the parameters _p1,…,_pk$p_1,\dots ,p_k$, the matrix of linear information in X, and the Mahalanobis distances between the pairs of P  's. Since the parameters are not free, the information matrices are singular and the technique of generalized inverses is used. A matrix extension of the Mahalanobis distance and its invariant forms are introduced that are of interest in their own right. In terms of parameter estimation, the results provide an independent of the parameter upper bound for the loss of accuracy by esimating _p1,…,_pk$p_1,\dots ,p_k$ from a sample of X^′$X^{\prime }$s, as compared with the ideal estimator based on a random sample of Y^′$Y^{\prime }$s.     

Robust median estimator in logistic regression

This paper introduces a median estimator of the logistic regression parameters. It is defined as the classical _L1$L_1$-estimator applied to continuous data _Z1,…,_Zn$Z_1,\dots ,Z_n$ obtained by a statistical smoothing of the original binary logistic regression observations _Y1,…,_Yn$Y_1,\dots ,Y_n$. Consistency and asymptotic normality of this estimator are proved. A method called enhancement is introduced which in some cases increases the efficiency of this estimator. Sensitivity to contaminations and leverage points is studied by simulations and compared in this manner with the sensitivity of some robust estimators previously introduced to the logistic regression. The new estimator appears to be more robust for larger sample sizes and higher levels of contamination.     

Confidence intervals in regression utilizing prior information

We consider a linear regression model with regression parameter β=(_β1,…,_βp)$\beta =({\beta }_1,\dots ,{\beta }_p)$ and independent and identically N(0,σ²)$N(0,{\sigma }^2)$ distributed errors. Suppose that the parameter of interest is θ=a^Tβ$\theta =a^T\beta$ where a$a$ is a specified vector. Define the parameter τ=c^Tβ-t$\tau =c^T\beta -t$ where the vector c$c$ and the number t$t$ are specified and a$a$ and c$c$ are linearly independent. Also suppose that we have uncertain prior information that τ=0$\tau =0$. We present a new frequentist 1-α$1-\alpha$ confidence interval for θ$\theta$ that utilizes this prior information. We require this confidence interval to (a) have endpoints that are continuous functions of the data and (b) coincide with the standard 1-α$1-\alpha$ confidence interval when the data strongly contradict this prior information. This interval is optimal in the sense that it has minimum weighted average expected length where the largest weight is given to this expected length when τ=0$\tau =0$. This minimization leads to an interval that has the following desirable properties. This interval has expected length that (a) is relatively small when the prior information about τ$\tau$ is correct and (b) has a maximum value that is not too large. The following problem will be used to illustrate the application of this new confidence interval. Consider a 2×2$2\times 2$ factorial experiment with 20 replicates. Suppose that the parameter of interest θ$\theta$ is a specified simple   effect and that we have uncertain prior information that the two-factor interaction is zero. Our aim is to find a frequentist 0.95 confidence interval for θ$\theta$ that utilizes this prior information.     

Distribution of concomitants of order statistics and their order statistics

For a random sample of size n$n$ from an absolutely continuous random vector (X,Y)$(X,Y)$, let _Yi:n$Y_{i:n}$ be i$i$th Y$Y$-order statistic and _Y[j:n]$Y_{[j:n]}$ be the Y$Y$-concomitant of _Xj:n$X_{j:n}$. We determine the joint pdf of _Yi:n$Y_{i:n}$ and _Y[j:n]$Y_{[j:n]}$ for all i,j=1$i,j=1$ to n$n$, and establish some symmetry properties of the joint distribution for symmetric populations. We discuss the uses of the joint distribution in the computation of moments and probabilities of various ranks for _Y[j:n]$Y_{[j:n]}$. We also show how our results can be used to determine the expected cost of mismatch in broken bivariate samples and approximate the first two moments of the ratios of linear functions of _Yi:n$Y_{i:n}$ and _Y[j:n]$Y_{[j:n]}$. For the bivariate normal case, we compute the expectations of the product of _Yi:n$Y_{i:n}$ and _Y[i:n]$Y_{[i:n]}$ for n=2$n=2$ to 8 for selected values of the correlation coefficient and illustrate their uses.