THE CONVERGENCE RATE OF SEQUENTIAL FIXED-WIDTH CONFIDENCE INTERVALS FOR REGULAR FUNCTIONALS

Let X₁X₂,.be i.i.d. random variables and let U_n= (n r)^-1S?^(n,r) h (X_i1,., X_ir,) be a U-statistic with EU_n= v, v unknown. Assume that g(X₁) =E[h(X₁,.,X_r) - v |X₁]has a strictly positive variance s?². Further, let a be such that φ(a) - φ(-a) =α for fixed α, 0 < α < 1, where φ is the standard normal d.f., and let S²_n be the Jackknife estimator of n Var U_n. Consider the stopping times N(d)= min {n: S²_n: + n^-1≤²a^-2},d > 0, and a confidence interval for v of length 2d,of the form I_n,d= [U_n,-d, Un + d]. We assume that Var U_n is unknown, and hence, no fixed sample size method is available for finding a confidence interval for v of prescribed width 2d and prescribed coverage probability α Turning to a sequential procedure, let I_N(d),d be a sequence of sequential confidence intervals for v. The asymptotic consistency of this procedure, i.e. lim_{d → 0}P(v ∈ I_N(d),d)=α follows from Sproule (1969). In this paper, the rate at which |P(v ∈ I_N(d),d) converges to α is investigated. We obtain that |P(v ∈ I_N(d),d) - α| = 0 (d^{1/2-(1+k)/2(1+m)}), d → 0, where K = max {0,4 - m}, under the condition that E|h(X₁, X_r)|^m < ∞m > 2. This improves and extends recent results of Ghosh & DasGupta (1980) and Mukhopadhyay (1981).     

On moments of the supremum of normed weighted averages

Let {X, X_n; n ≥ 1} be a sequence of real-valued iid random variables, 0 < r < 2 and p > 0. Let D = { A = (a_nk; 1 ≤ k ≤ n, n ≥ 1); a_nk, ? R and sup_{n, k} |a_n,k| < ∞}. Set S_n( A ) = ∑ⁿ_k=1a_{n, k}X_k for A ? D and n ≥ 1. This paper is devoted to determining conditions whereby E{sup_{n ≥ 1}, |S_n( A )|/n^1/r}^p < ∞ or E{sup_{n ≥ 2} |S_n( A )|/2n log n)^1/2}^p < ∞ for every A ? D. This generalizes some earlier results, including those of Burkholder (1962), Choi and Sung (1987), Davis (1971), Gut (1979), Klass (1974), Siegmund (1969) and Teicher (1971).     

Sequential estimation of the mean of NEF-PVF distributions

Let F = {F₀: 0 ϵ Θ} denote the class of natural exponential family of distributions having power variance function, (NEF-PVF). We consider the problem of sequentially estimating the mean μ of F₀ ϵ F, based on i.i.d. observations from F₀. We propose an appropriate sequential estimation procedure under a combined loss of estimation error and sampling cost. We provide expansion for the regret R_a and study its asymptotic properties. We show that R_a = cv²(μ) + o(1) as a → ∞, where c > 0 is a known constant and v(μ) denotes the coefficient of variation of F₀.     

Rates of convergence for the k-nearest neighbor estimators with smoother regression functions

Let (X, Y  ) be a R^d×R-valued${\mathbb{R}}^d\times \mathbb{R}\mathrm{-}\mathrm{valued}$ random vector. In regression analysis one wants to estimate the regression function m(x)?E(Y|X=x)$m(x)?\mathbf{E}(Y|X=x)$ from a data set. In this paper we consider the rate of convergence for the k-nearest neighbor estimators in case that X   is uniformly distributed on [0,1]^d$[\mathrm{0,1}{]}^d$, Var(Y|X=x)$\mathbf{Var}(Y|X=x)$ is bounded, and m is (p, C)-smooth. It is an open problem whether the optimal rate can be achieved by a k  -nearest neighbor estimator for 1<p≤1.5$1<p\le 1.5$. We solve the problem affirmatively. This is the main result of this paper. Throughout this paper, we assume that the data is independent and identically distributed and as an error criterion we use the expected L₂ error.     

ON TRANSITION PROBABILITIES OF SKIP-FREE MARKOV CHAINS

Consider an ergodic Markov chain X(t) in continuous time with an infinitesimal matrix Q = (q_ij) defined on a finite state space {0, 1,…, N}. In this note, we prove that if X(t) is skip-free positive (negative, respectively), i.e., q_ij, = 0 for j > i+ 1 (i > j+ 1), then the transition probability p_ij(t) = Pr[X(t)=j | X(0) =i] can be represented as a linear combination of p_0N(t) (p^(m)_(N0)(t)), 0 ≤ m ≤N, where f^(m)(t) denotes the mth derivative of a function f(t) with f⁽⁰⁾(t) =f(t). If X(t) is a birth-death process, then p_ij(t) is represented as a linear combination of p_0N^(m)(t), 0 ≤m≤N - |i-j|.     

Optimum invariant tests for random manova models

Consider the canonical-form MANOVA setup with X: n × p = (+ E, X_i n_i × p, i = 1, 2, 3, M_i: n_i × p, i = 1, 2, n₁ + n₂ + n₃) p, where E is a normally distributed error matrix with mean zero and dispersion I_n (> 0 (positive definite). Assume (in contrast with the usual case) that M₁i is normal with mean zero and dispersion I_n1) and M₂2 is either fixed or random normal with mean zero and different dispersion matrix I_n2 (being unknown. It is also assumed that M₁ E, and M₂ (if random) are all independent. For testing H₀) = 0 versus H₁: (> 0, it is shown that when either n₂ = 0 or M₂ is fixed if n₂ > 0, the trace test of Pillai (1955) is uniformly most powerful invariant (UMPI) if min(n₁, p)= 1 and locally best invariant (LBI) if min(n₁ p) > 1 underthe action of the full linear group Gl (p). When p > 1, the LBI test is also derived under a somewhat smaller group G_T(p) of p × p lower triangular matrices with positive diagonal elements. However, such results do not hold if n₂ > 0 and M₂ is random. The null, nonnull, and optimality robustness of Pillai's trace test under Gl(p) for suitable deviations from normality is pointed out.     

Robustness of locally most powerful invariant test for normal mixture model in control and treatment populations

Two independent samples from control with N(μ₁, σ²) and treatment with pN(μ₁, σ²) + (1 − p)N(μ₂, σ²) are considered. A locally most powerful invariant test for testing H₀: μ₁ = μ₂ against H₁ : μ₂ > μ₁, where σ² > 0, 0 < p < 1 are unknown, is obtained. Also, the robustness of the test statistic on the lines of Kariya and Sinha (Robustness of Statistical Tests (1989). Academic Press, New York) is studied.     

On comparing two poisson intensity functions

Given realizations of two possion processes with unknown intensities A(·) and F(·) observed over the interval (t₁,t₂), we suppose that it is desired to distinution between H₀ Ξ(·)/λ(·) is constant on (t₁,t₂) versus H₊:Ξ(·)/λ(·) increases on (t₁,t₂). We propose a decision rule which uses the percentage points of the Mann-Whitney U-distribution. We show that the decision rule is unbiased and that the set of alternatives in H₊ can be weakly ordered, specifically: if Ξ(·)/λ(·), β(·)/λ(·) and Ξ(·)/β(·) are increasing on (t₁, t₂) then P{H₀ is rejected |Ξ(·)}≧P{H₀ is rejected|B(·)}≧P{H₀ is rejected|H₀}.     

On the asymptotic expectation and variance of the number of boundary crossings

Let X₁,X₂,… be independent and identically distributed nonnegative random variables with mean μ, and let S_n = X₁ + … + X_n. For each λ > 0 and each n ≥ 1, let A_n be the interval [λn^Y, ∞), where γ > 1 is a constant. The number of times that S_n is in A_n is denoted by N. As λ tends to zero, the asymtotic behavior of N is studied. Specifically under suitable conditions, the expectation of N is shown to be (μλ^?1)^β + o(λ^?β/2 where β = 1/(γ-1) and the variance of N is shown to be (μλ^?1)^β(βμ¹)²σ² + o(λ^?β) where σ² is the variance of X_n.     

Slow convergence of the Gibbs sampler

We consider the Gibbs sampler as a tool for generating an absolutely continuous probability measure ≥ on R^d. When an appropriate irreducibility condition is satisfied, the Gibbs Markov chain (X_n;n ≥ 0) converges in total variation to its target distribution ≥. Sufficient conditions for geometric convergence have been given by various authors. Here we illustrate, by means of simple examples, how slow the convergence can be. In particular, we show that given a sequence of positive numbers decreasing to zero, say (b_n;n ≥ 1), one can construct an absolutely continuous probability measure ≥ on R^d which is such that the total variation distance between ≥ and the distribution of X_n, converges to 0 at a rate slower than that of the sequence (b_n;n ≥ 1). This can even be done in such a way that ≥ is the uniform distribution over a bounded connected open subset of R^d. Our results extend to hit-and-run samplers with direction distributions having supports with symmetric gaps.     

The formal posterior of a standard flat prior in MANOVA is incoherent

Summary A standard improper prior for the parameters of a MANOVA model is shown to yield an inference that is incoherent in the sense of Heath and Sudderth. The proof of incoherence is based on the fact that the formal Bayes estimate, sayδ ₀ , of the covariance matrix based on the improper prior and a certain bounded loss function is uniformly inadmissible in that there is another estimatorδ _l and an ɛ>0 such that the risk functions satisfyR(δ _l ,Σ)⩽R δ ₀ ,Σ)−ε for all values of the covariance matrix Σ. The estimatorδ _I is formal Bayes for an alternative improper prior which leads to a coherent inference. Research supported by National Science Foundation grants DMS-89-22607 (for Eaton) and DMS-9123358 (for Sudderth).     

Decomposition for multivariate extremal processes

The probability distribution of an extremal process in R^d with independent max-increments is completely determined by its distribution function. The df of an extremal process is similar to the cdf of a random vector. It is a monotone function on (0, ∞) × R^d with values in the interval [0,1]. On the other hand the probability distribution of an extremal process is a probability measure on the space of sample functions. That is the space of all increasing right continuous functions y: (0, ∞) → R^d with the topology of weak convergence. A sequence of extremal processes converges in law if the probability distributions converge weakly. This is shown to be equivalent to weak convergence of the df's.

An extremal process Y: [0, ∞) → R^d is generated by a point process on the space [0, ∞) × [-∞, ∞)^d and has a decomposition Y = X v Z as the maximum of two independent extremal processes with the same lower curve as the original process. The process X is the continuous part and Z contains the fixed discontinuities of the process Y. For a real valued extremal process the decomposition is unique: for a multivariate extremal process uniqueness breaks down due to blotting.     

Detecting changes from short to long memory

This paper studies well-known tests by Kim et?al. (J Econom 109:389?C392, 2002) and Busetti and Taylor (J Econom 123:33?C66, 2004) for the null hypothesis of short memory against a change to nonstationarity, I (1). The potential break point is not assumed to be known but estimated from the data. First, we show that the tests are also applicable for a change from I (0) to a fractional order of integration I (d) with d?>?0 (long memory) in that the tests are consistent. The rates of divergence of the test statistics are derived as functions of the sample size T and d. Second, we compare their finite sample power experimentally. Third, we consider break point estimation for a change from I (0) to I (d) for finite samples in computer simulations. It turns out that the estimators proposed for the integer case (d?=?1) are practically reliable only if d is close enough to 1.     

Empirical Bayes testing for equivalence

For a fixed point θ₀ and a positive value c₀, this paper studies the problem of testing the hypotheses H₀:|θ−θ₀|≤c₀ against H₁:|θ−θ₀|>c₀ for the normal mean parameter θ using the empirical Bayes approach. With the accumulated past data, a monotone empirical Bayes test is constructed by mimicking the behavior of a monotone Bayes test. Such an empirical Bayes test is shown to be asymptotically optimal and its regret converges to zero at a rate (lnn)^2.5/n where n is the number of past data available, when the current testing problem is considered. A simulation study is also given, and the results show that the proposed empirical Bayes procedure has good performance for small to moderately large sample sizes. Our proposed method can be applied for testing close to a control problem or testing the therapeutic equivalence of one standard treatment compared to another in clinical trials.     

Generation of multivariate distributions by vertical density representation

Troutt (1991,1993) proposed the idea of the vertical density representation (VDR) based on Box-Millar method. Kotz, Fang and Liang (1997) provided a systematic study on the multivariate vertical density representation (MVDR). Suppose that we want to generate a random vector X[d]Rⁿthat has a density function ?(x). The key point of using the MVDR is to generate the uniform distribution on [D]_?(v) = {x :?(x) = v} for any v > 0 which is the surface in RⁿIn this paper we use the conditional distribution method to generate the uniform distribution on a domain or on some surface and based on it we proposed an alternative version of the MVDR(type 2 MVDR), by which one can transfer the problem of generating a random vector X with given density f to one of generating (X, X_n+i) that follows the uniform distribution on a region in Rⁿ⁺¹defined by ?. Several examples indicate that the proposed method is quite practical.     

First-exit times for compound poisson processes for some types of positive and negative jumps

We consider the one-sided and the two-sided first-exit problem for a compound Poisson process with linear deterministic decrease between positive and negative jumps. This process (X(t)) _t≥0 occurs as the workload process of a single-server queueing system with random workload removal, which we denote by M/G _u /G _d /1, where G _u (G _d ) stands for the distribution of the upward (downward) jumps; other applications are to cash management, dams, and several related fields. Under various conditions on G _u and G _d (assuming e.g. that one of them is hyperexponential, Erlang or Coxian), we derive the joint distribution of τ _y =inf{t≥0|X(t)?(0,y)}, y>0, and X(τ _y ) as well as that of T=inf{t≥0|X(t)≤0} and X(T). We also determine the distribution of sup{X(t)|0≤t≤T}.     

SOME LAW OF THE ITERATED LOGARITHM TYPE RESULTS FOR THE EMPIRICAL PROCESS

We consider Z^±_n= sup_{0< t ≤ 1/2}2 U^±_n (t)/(t(1- t))^1/2, where + and -denote the positive and negative parts respectively of the sample paths of the empirical process U_n. U^±_n and U_n are seen to behave rather differently, which is tied to the asymmetry of the binomial distribution, or to the asymmetry of the distribution of small order statistics. Csáki (1975) showed that log Z^±_n/log₂n is the appropriate normalization for a law of the iterated logarithm (LIL) for Z^±_n we show that Z^-_n/(2 log₂n)^1/2 is the appropriate normalization for Z^-_n. Csörgö & Révész (1975) posed the question: if we replace the sup over (0,1/2) above, by -the sup over [a_n, 1-a_n] where a_n→0, how fast can a_n→0 and still have |Z_n|/(2 log₂n)^1/2 maintain a finite lim sup a.s.? This question is answered herein. The techniques developed are then used in Section 4 to give an interesting new proof of the upper class half of a result of Chung (1949) for |U_n(t)|. The proofs draw heavily on James (1975); two basic inequalities of that paper are strengthened to their potential, and are felt to be of independent interest.     

A remark on estimating the mean of a normal distribution with known coefficient of variation

Let X₁, X₂, …, X_n be iid N(μ, aμ²) (a>0) random variables with an unknown mean μ>0 and known coefficient of variation (CV) √a. The estimation of μ is revisited and it is shown that a modified version of an unbiased estimator of μ [cf. Khan RA. A note on estimating the mean of a normal distribution with known CV. J Am Stat Assoc. 1968;63:1039–1041] is more efficient. A certain linear minimum mean square estimator of Gleser and Healy [Estimating the mean of a normal distribution with known CV. J Am Stat Assoc. 1976;71:977–981] is also modified and improved. These improved estimators are being compared with the maximum likelihood estimator under squared-error loss function. Based on asymptotic consideration, a large sample confidence interval is also mentioned.     

A lower bound for the transition density function of a stochastic differential equation

Let W_t be a one-dimensional Brownian motion on the probability space (Ω,F,P), and let dx_t = a(x_t)dt + b(x_t)dw_t, b²(x) > 0, be a one-dimensional Ito stochastic differential equation. For a(x) = a₀ + a₁x + … + a_nxⁿ on a bounded interval we obtain a lower bound for p(t,x,y), the transition density function of the homogeneous Markov process x_t, depending directly on the coefficients a₀,a₁, …, a_n, and b(x).     

Optimal designs for covariates’ models

A linear model with one treatment at V levels and first order regression on K continuous covariates with values on a K-cube is considered. The D-criterion is used to judge the ‘goodness’ of any design for estimating the parameters of this model. Since this criterion is based on the determinant of the information matrix M(d) of a design d, upper bounds for |M(d)| yield lower bounds for the D-efficiency of any design d in estimating the vector of parameters in the model. We consider here only classes of designs d for which the number N of observations to be taken is a multiple of V, that is, there exists R≥2 such that N=V×R.Under these conditions, we determine the maximum of |M(d)|, and conditions under which the maximum is attained. These conditions include R being even, each treatment level being observed the same number of times, that is, R times, and N being a multiple of four. For the other cases of congruence of N (modulo 4) we further determine upper bounds on |M (d)| for equireplicated designs, i.e. for designs with equal number of observations per treatment level. These upper bounds are shown to depend also on the congruence of V (modulo 4). For some triples (N,V,K), the upper bounds determined are shown to be attained.Construction methods yielding families of designs which attain the upper bounds of |M(d)| are presented, for each of the sixteen cases of congruence of N and V.We also determine the upper bound for D-optimal designs for estimating only the treatment parameters, when first order regression on one continuous covariate is present.