Two point priors and Γ-minimax estimating in families of uniform distributions

It is shown that when a parameter lying in a sufficiently small interval is to be estimated in a family of uniform distributions, a two point prior is least favourable under squared error loss. The unique Bayes estimator with respect to this prior is minimax. The Γ-minimax estimator is derived for sets Γ of priors consisting of all priors that give fixed probabilities to two specified subintervals of the parameter space if a two point prior is least favourable in Γ.     

Rényi statistics for testing hypotheses in mixed linear regression models

Rényi divergences are used to propose some statistics for testing general hypotheses in mixed linear regression models. The asymptotic distribution of these tests statistics, of the Kullback–Leibler and of the likelihood ratio statistics are provided, assuming that the sample size and the number of levels of the random factors tend to infinity. A simulation study is carried out to analyze and compare the behavior of the proposed tests when the sample size and number of levels are small.     

《101/2章世界史》中的反讽艺术

《10 1/2章世界史》是英国当代作家朱利安.巴恩斯的代表作之一。作者以《圣经》中的诺亚方舟为基本意象,敷衍出10 1/2章故事,同时以反讽的姿态重新审视神话传说和历史事件,在有限的篇幅内展现出了一幅独特的人类历史画卷。     

Robust estimating equation based on statistical depth

In this paper the estimating equation is constructed via statistical depth. The obtained estimating equation and parameter estimation have desirable robustness, which attain very high breakdown values close to 1/2. At the same time, the obtained parameter estimation still has ordinary asymptotic behaviours such as asymptotic normality. In particular, the robust quasi likelihood and depth-weighted LSE respectively for nonlinear and linear regression model are introduced. A suggestion for choosing weight function and a method of constructing depth-weighed quasi likelihood equation are given. This paper is supported by NNSF projects (10371059 and 10171051) of China.     

Do bootstrap confidence procedures behave well uniformly in P?

An important statistical problem is to construct a confidence set for some functional T(P) of some unknown probability distribution P. Typically, this involves approximating the sampling distribution J_n(P) of some pivot based on a sample of size n from P. A bootstrap procedure is to estimate J_n(P) by J_n(&Pcirc;_n), where P?_n is the empirical measure based on a sample of size n from P. Typically, one has that J_n(P) and J_n(P?_n) are close in an appropriate sense. Two questions are addressed in this note. Are J_n(P) and J_n(P?_n) uniformly close as P varies as well? If so, do confidence statements about T(P) possess a corresponding uniformity property? In the case T(P) = P, the answer to the first questions is yes; the answer to the second is no. However, bootstrap confidence statements about T(P) can be made uniform over a restricted, though large, class of P. Similar results apply to other functional T(P).     

Rate of strong uniform convergence of k-NN density estimates

Let f_n(x) be the univariate k-nearest neighbor (k-NN) density estimate proposed by Loftsgaarden and Quesenberry (1965). By using similar techniques as in Bahadur's representation of sample quantiles (1966), and by the recent results on the oscillation of empirical processes by Stute (1982), we derive the rate of strong uniform convergence of f_n(x) on some suitably chosen interval J_δ. Some comparison with the kernel estimates is given, as well as the choice of the bandwidth sequence relative to the sample size.     

Non-parametric recursive estimates of a probability density function and its derivatives

Recursive estimates of a probability density function (pdf) are known. This paper presents recursive estimates of a derivative of any desired order of a pdf. Let f be a pdf on the real line and p?0 be any desired integer. Based on a random sample of size n from f, estimators f^(p)_n of f^(p), the pth order derivatives of f, are exhibited. These estimators are of the form $\text{n}{}^{\mathrm{?1}}\text{∑n}\text{j=1}\text{δ}{}_{\mathrm{jp}}$, where δ_jp depends only on p and the jth observation in the sample, and hence can be computed recursively as the sample size increases. These estimators are shown to be asymptotically unbiased, mean square consistent and strongly consistent, both at a point and uniformly on the real line. For pointwise properties, the conditions on f^(p) have been weakened with a little stronger assumption on the kernel function.     

Characterizations of geometric distribution and discrete IFR (DFR) distributions using order statistics

Let X be a discrete random variable the set of possible values (finite or infinite) of which can be arranged as an increasing sequence of real numbers a₁<a₂<a₃<…. In particular, a_i could be equal to i for all i. Let X_1n≦X_2n≦?≦X_nn denote the order statistics in a random sample of size n drawn from the distribution of X, where n is a fixed integer ≧2. Then, we show that for some arbitrary fixed k(2≦k≦n), independence of the event {X_kn=X_1n} and X_1n is equivalent to X being either degenerate or geometric. We also show that the montonicity in i of P{X_kn = X_1n | X_1n = a_i} is equivalent to X having the IFR (DFR) property. Let a_i = i and $\text{G(i) = P(X≧i), i = 1, 2, …}$. We prove that the independence of {X_2n ? X_1n ∈B} and X_1n for all i is equivalent to X being geometric, where B = {m} (B = {m,m+1,…}), provided G(i) = q^i?1, 1≦i≦m+2 (1≦i≦m+1), where 0<q<1.     

Construction of Youden hyperrectangles

Youden hyperrectangles are higher-dimensional generalizations of balanced block designs and generalized Youden designs. This kind of design has been shown to be optimal for the elimination of multi-way heterogeneity. In this paper, patchwork and geometric methods are combined to construct Youden hyperrectangles for many parameter values.     

On UMVU estimators and Bhattacharya bounds in exponential distributions

A subfamily of exponential distributions is considered and it is shown that the variance of the UMVU estimator of an estimable function g(θ) having power series expansion is the limit of Bhattacharya bounds.