Approximate Formulae for Bias and Variance of Ratios

Rao ([1], p. 475, equation 8c.6.10) considers a certain minimization problem in which one is required to minimize a sum of quadratic forms subjected to certain linear restrictions. The proof given by Rao, although elegant, is involved and complicated as he uses N dimensional geometric and regression theory arguments. Perhaps, an alternative simpler and straightforward algebraic proof of this minimization problem might be of interest.     

A New Proof of Murthy's Estimator which Applies to Sequential Sampling

Murthy's estimator has been used for constructing an unbiased estimator of a population total or mean from a sample of fixed size when there is unequal probability sampling without replacement. Traditionally, the estimator is derived by constructing an unordered version of Raj's ordered unbiased estimator. This paper presents an elementary proof of Murthy's estimator which applies the Rao–Blackwell theorem to a very simple estimator. This proof includes any sequential sampling scheme, thus extending the usefulness of Murthy's estimator. We demonstrate this extension by deriving unbiased estimators for inverse sampling.     

Corrected proof of the result of 'A prediction error property of the Lasso estimator and its generalization' by Huang (2003)

The Lasso achieves variance reduction and variable selection by solving an ?₁‐regularized least squares problem. Huang (2003) claims that ‘there always exists an interval of regularization parameter values such that the corresponding mean squared prediction error for the Lasso estimator is smaller than for the ordinary least square estimator’. This result is correct. However, its proof in Huang (2003) is not. This paper presents a corrected proof of the claim, which exposes and uses some interesting fundamental properties of the Lasso.     

Analytic approach to coset–leader decoding leads to extension of the Welch–Berlekamp theorem

This paper provides a complete proof of the Welch–Berlekamp theorem on which the Welch–Berlekamp algorithm was founded. By introducing an analytic approach to coset–leader decoders for Reed–Solomon codes, the Welch–Berlekamp key-equation of error corrections is enlarged and a complete proof of the Welch–Berlekamp theorem is derived in a natural way, and the theorem is extended such that the BCH-bound constraint is moved.     

Deviation of order p for estimators of the variance in first-order stochastic differential equation (SDE)

In this work, we consider a non-parametric estimator of the variance in one-dimensional diffusion models or, more generally, in Itô processes with a deterministic diffusion term and a general non-anticipative drift. The estimation is based on the quadratic variation of discrete time observations over a finite interval. In particular, a central limit theorem (CLT) is proved for the deviation in L ^p norm (p≥; 1) between the variance and this estimator. The method of the proof consists in writing the L ^p norm of the deviation, when the drift term is equal to zero, as a sum of 4-dependent random variables. The moments are then computed by means of a Gaussian approximation and a CLT for m-dependent random variables is applied. The convergence is stable in law, this allows the result for processes with general drifts to be obtained, by using Girsanov's formula.     

A note on mixingale limit theorems and stable convergence in law

A gap in the proof of a non stationary mixingale invariance principle is identified and fixed by introducing a skipped subsampling of a partial sum process and letting the skipped interval vanish asymptotically at an appropriate rate as the sample size increases. The corrected proof produces a mixingale limit theorem in the form of a mixing convergence in law, occurring jointly with the stable convergence in law for the same σ-field relative to which they are stable and mixing. The applicability of established results to a high-frequency estimation of the quadratic variation of financial price process is discussed.     

Score test of homogeneity for survival data

If follow-up is made for subjects which are grouped into units, such as familial or spatial units then it may be interesting to test whether the groups are homogeneous (or independent for given explanatory variables). The effect of the groups is modelled as random and we consider a frailty proportional hazards model which allows to adjust for explanatory variables. We derive the score test of homogeneity from the marginal partial likelihood and it turns out to be the sum of a pairwise correlation term of martingale residuals and an overdispersion term. In the particular case where the sizes of the groups are equal to one, this statistic can be used for testing overdispersion. The asymptotic variance of this statistic is derived using counting process arguments. An extension to the case of several strata is given. The resulting test is computationally simple; its use is illustrated using both simulated and real data. In addition a decomposition of the score statistic is proposed as a sum of a pairwise correlation term and an overdispersion term. The pairwise correlation term can be used for constructing a statistic more robust to departure from the proportional hazard model, and the overdispesion term for constructing a test of fit of the proportional hazard model.     

Mathematical proof of the third order accuracy of the speedy double bootstrap method

Abstract

In our previous research, we proposed a speedy double bootstrap method for assessing the reliability of statistical models with maximum log-likelihood criterion. It can provide 3rd order accurate probabilities. In this study, our focus switches to the mathematical proof. We propose an alternative proof of the third order accuracy in the context of the multivariate normal model. Our proof is based on tube formula differential geometric methodology and an Taylor series approach to the asymptotic analysis of the bootstrap method.     

A Proof of Bell's Inequality in Quantum Mechanics Using Causal interactions

We give a simple proof of Bell's inequality in quantum mechanics using theory from causal interaction, which, in conjunction with experiments, demonstrates that the local hidden variable assumption is false. The proof sheds light on relationships between the notion of causal interaction and interference between treatments.     

Constructing optimal univariate tests

Lehmann (1959) derives various univariate optimal tests and gives a technique that can be used to construct some of them. Although the technique is correct, the proof is not. Here the proof is corrected and an alternative derivation given. The alternative derivation is generalised to situations not covered by the Lehmann technique.     

A very simple proof of the multivariate Chebyshev's inequality

Abstract

In this short note, a very simple proof of the Chebyshev's inequality for random vectors is given. This inequality provides a lower bound for the percentage of the population of an arbitrary random vector X with finite mean μ = E(X) and a positive definite covariance matrix V = Cov(X) whose Mahalanobis distance with respect to V to the mean μ is less than a fixed value. The main advantage of the proof is that it is a simple exercise for a first year probability course. An alternative proof based on principal components is also provided. This proof can be used to study the case of a singular covariance matrix V.     

Percentiles from a set of classes or from the raw data? an argument based on the trinomial distribution

In a former study (Chatillon, Gelinas, Martin and Laurencelle, 1987), the authors arrived at the conclusion that for small to moderate sample sizes (n≦90), and for population distributions that are not too skewed nor heavy tailed, the percentiles computed from a set of 9 classes are at least as precise as the corresponding percentiles computed with raw data. Their proof was based essentially on Monte Carlo simulations. The present paper gives a different and complementary proof, based on an exact evaluation of the mean squared error. The method of proof uses the trinomial distribution in an interesting way.     

Asymptotic normality of linear combinations of functions of the concomitant order statistics

In this note we derive asymptotic normality for a class of linear combinations of functions of concomitant order statistics by exploiting the relation between these statistics and rank statistics for testing independence. The proof can at once be obtained from the proof of the asymptotic normality (under fixed alternatives) of the statistics of the latter type by a slight modification which is in fact a simplification. The score function is allowed to have a finite number of discontinuities (so that one- or two- sided trimmed means are included) and need not be bounded. In this way we prove results similar to those in Yang (1981b) in a different and simple manner.     

Identification of parametric Rasch-type models

In modern Item Response Theory, the Rasch model is viewed as a Generalized Linear Mixed Model, where the item parameters correspond to the fixed-effects, whereas the person specific parameters are the random-effects. The statistical model, bearing on the observable variables only, is obtained after integrating out the random-effects. Although it is widely accepted that the parameters of this model are identified, it is hard to find a correct justification. Furthermore, the meaning of the parameters of the Rasch model – as well as of its extensions – is typically based on the fixed-effects specification of the model, that is, when the person specific parameters are also treated as fixed-effects. The contribution of this paper is to provide an explicit proof of the identification of the random-effects Rasch model. The proof is valid for a large class of Rasch-type models. It is also shown that such a proof can be applied to analyze the identification of Explanatory Rasch Models. Finally, the meaning of the parameters of interest with respect to the different data generating process is discussed.     

On estimating the conditional probability of discovering a new species

Based on a capture-recapture sample of size $i;n+k,n≥ l,k ≥ 0, from a population of an unknown number of distinct species (or classes), the problem of estimating the total probability of the species unobserved in the first n selections is considered. As the estimand depends on both the unknown parameters and the data, the standard theory of estimation is inadequate for this problem A suitable definition of sufficiency is introduced and used to prove a Rao-Blackwell type result and discuss uniformly minimum mean squared error unbiased estimation. An alternative proof for an inadmissibility result is presented. The new proof gives more insight and a method for deriving improved estimators. The theoretical developments may be useful in other problems concerning inferences about random parametric functions.     

An easy method of constructing latin square designs balanced for the immediate residual and other order effects

Bradley (1958) proposed a very simple procedure for constructing latin square designs to counterbalance the immediate sequential effect for an even number of treatments. When the number of treatments is odd, balance in a single latin square is not possible. In the present note we have developed an analogous method for the construction of such designs which may be used for an even or odd number of treatments. A proof has also been offered to assure the general validity of the procedure.     

Equality of two blues and ridge-type estimates

Equality is shown of the g-inverse and Moore-Penrose inverse representation of the BLUE in the general linear model. The proof is based on a matrix identity which allows also to establish a functional relationship between the BLUE and Ridge-type estimates.     

U2n test for uniformity of discrete distributions

Lockhart et al. have given an elegant account of this recently. In this paper, I will show that the method which originally led to U2n works just as well in the discrete case-and suggests a proof in the continuous case.     

On simultaneous closeness probabilities of order statistics from odd sample sizes to the population median

In this note, we present alternative derivations for the probability that an individual order statistic is closest to the target parameter among all order statistics from a complete random sample. This approach is simpler than the geometric arguments used earlier. We also provide a simple direct proof for the symmetry property of the simultaneous closeness probabilities among order statistics for the estimation of percentiles from a symmetric family. Finally, we offer an alternative simpler proof for the result that sample medians from larger odd sample sizes are Pitman closer to the population median than sample medians from smaller odd sample sizes.     

On a Theorem of Quine and Seneta for the Galton-Watson Process With Immigration

Recently a limit theorem has been obtained for the limiting-stationary distribution of a process in which individuals reproduce as in a subcritical Galton-Watson process and are subject to an independent immigration component at each generation. This paper provides a different proof of this theorem, and under slightly weaker conditions. A similar approach is used to obtain a limit form of Taglom's theorem for the ordinary subcritical Galton-Watson process.