An Improved Range Estimator of Sigma for Determining Sample Sizes

The use of a range estimator of the population standard deviation, sigma (σ), for determining sample sizes is discussed in this study. Standardized mean ranges (d_n's), when divided into the ranges of sampling frames, provide estimates of the standard deviation of the population. These estimates can be used for determining sample sizes. The d_n's are provided for seven different distributions for sampling frame sizes that range from 2 to 2000, For each of the seven distributions, functional relationships are developed such that d_n = f(n_SF) where n_SF is the size of the sample frame. From these functions, d_n's can be estimated for sampling frame sizes which are not presented in the study.     

Some competitors of the mood test for the two-sample scale problem

Let X_l,…,X_n (Y_l,…,Y_m) be a random sample from an absolutely continuous distribution with distribution function F(G).A class of distribution-free tests based on U-statistics is proposed for testing the equality of F and G against the alternative that X's are more dispersed then Y's. Let 2 ? C ? n and 2 ? d ? m be two fixed integers. Let ?_c,d(X_il,…,X_ic ; Y_jl,…,X_jd)=1(-1)when max as well as min of {X_il,…,X_ic ; Y_jl,…,Y_jd } are some X_i's (Y_j's)and zero oterwise. Let S_c,d be the U-statistic corresponding to ?_c,d.In case of equal sample sizes, S22 is equivalent to Mood's Statistic.Large values of S_c,d are significant and these tests are quite efficient     

Nonnegative piecewise linear histograms *

We introduce a modified version ?_nof the piecewiss linear hisiugrimi uf Beirlant et al. (1998) which is a true probability density, i.e., ?_n[d] 0 and [d]?_n=1. We prove that ?_nestimates the underlying densitv ? strongly consistently in the L₁mmn, derive large deviation inequalities for the t\ error \?_n- f\ and prove that £||/"-/|| tends to zero with the rate n ^-1\3, We also show that the derivative lf'n estimates consistently in ine expected Lx error the derivative/ of sufficiently smooth density and evaluate the rate of convergence n-i/5 for Epf'n -f'% The estimator/" thus enables to approximate/in the Besov space with a guaranteed rate of convergence. Optimization of the smoothing parameter is also studied. The theoretical or experimentally approximated values of the expected errors E\\?_n- f\\ and E||2?'_n-?' are compared with tiie errors aCiiieveu u-y t"e histogram of Beirlant et ah, and other nonparametric methods.     

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).     

Bayes and Empirical Bayes Two-Stage Procedures for Sampling Inspection

A batch of M items is inspected for defectives. Suppose there are d defective items in the batch. Let d ₀ be a given standard used to evaluate the quality of the population where 0 < d ₀ < M. The problem of testing H ₀: d < d ₀ versus H ₁: d ≥ d ₀ is considered. It is assumed that past observations are available when the current testing problem is considered. Accordingly, the empirical Bayes approach is employed. By using information obtained from the past data, an empirical Bayes two-stage testing procedure is developed. The associated asymptotic optimality is investigated. It is proved that the rate of convergence of the empirical Bayes two-stage testing procedure is of order O (exp(? c? n)), for some constant c? > 0, where n is the number of past observations at hand.     

On some joint distributions in fluctuation theory

For non-negative integral valued interchangeable random variables v₁, v₂,…,v_n, Takács (1967, 70) has derived the distributions of the statistics ?_n' ?¹_n' ?^(c)_n and ?^(-c)_n concerning the partial sums N_r = v₁ + v₂ + ··· + v_rr = 1,…,n. This paper deals with the joint distributions of some other statistics viz., (α^(c)_n, δ^(c)_n, Z_n), (β^(c)_n, Z_n) and (β^(-c)_n, Z_n) concerning the partial sums N_r = ε₁ + ··· + ε_rr = 1,2,…,n, of geometric random variables ε₁, ε₂,…,ε_n.     

An extension of almost sure central limit theorem for self-normalized products of sums for mixing sequences

ABSTRACT

Let X, X₁, X₂, … be a sequence of strictly stationary φ-mixing random variables with EX = μ > 0. In this paper, we show that a self-normalized version of almost sure central limit theorem (ASCLT) holds under the assumptions that the mixing coefficients satisfy ∑^∞_{n = 1}φ^1/2(2ⁿ) < ∞ and the weight sequence {d_k} satisfies a mild growth condition similar to Kolmogorov’s condition for the LIL. This shows that logarithmic averages, used traditionally in ASCLT for products of sums, can be replaced by other averages, leading to considerably sharper results.     

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.     

On tail parameter estimation in certain point process models

Let μ(ds, dx) denote Poisson random measure with intensity dsG(dx) on (0, ∞) × (0, ∞), for a measure G(dx) with tails varying regularly at ∞. We deal with estimation of index of regular variation α and weight parameter ξ if the point process is observed in certain windows K_n = [0, T_n] × [Y_n, ∞), where Y_n → ∞ as n → ∞. In particular, we look at asymptotic behaviour of the Hill estimator for α. In certain submodels, better estimators are available; they converge at higher speed and have a strong optimality property. This is deduced from the parametric case G(dx) = ξαx^−α−1 dx via a neighbourhood argument in terms of Hellinger distances.     

Algorithms for the construction of optimizing distributions

We will consider the following problem.Maximise Φ(p)over P={p=(p₁,P₂,…,p_j):P_j≧0,∑p_j=1}". We require to calcute an optimizing distribution. Examples arise in optimal regression design,maximum likelihood estimation and stratified sazmpling problems. A class of multiplicative algorithms, indexed by functions which depend on the derivatives of Φ(·)is considered for solving this problem.Iterations are of the form:p_j ^(r+1)αp_j ^(r)f(x_j ^(r)), where x_{j (r)}=d_j ^(r) or F_j ^(r)and d_j ^(r)=?Φ/?p_j While F_j ^(r)=D_j ^(r)?∑p_i ^(r)d_i ^(r) (a directional derivative)at p=p^(r)f(·)satisfies some suitable properties and may depend on one or more free parameters. These iterations neatly submit to the constraints ofv the problem. Some results will be reported and extensions to problems dependin on two or more distributions and to problems with additional constraints will be considered.     

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.     

On the weak convergence of kernel density estimators in Lp spaces

Since its introduction, the pointwise asymptotic properties of the kernel estimator f?_n of a probability density function f on ?^d, as well as the asymptotic behaviour of its integrated errors, have been studied in great detail. Its weak convergence in functional spaces, however, is a more difficult problem. In this paper, we show that if f_n(x)=(f?_n(x)) and (r_n) is any nonrandom sequence of positive real numbers such that r_n/√n→0 then if r_n(f?_n?f_n) converges to a Borel measurable weak limit in a weighted L^p space on ?^d, with 1≤p<∞, the limit must be 0. We also provide simple conditions for proving or disproving the existence of this Borel measurable weak limit.     

A “Reverse Order” Elementary Statistics Course

A family of coefficients for measuring monotone association is presented. These include measures of association of ordinal or interval variables such as gamma of Goodman and Kruskal, Somers's d_yx , Kendall's tau, or Spearman's rho as special cases. The article shows how a large number of measures of association can be put into a single general form. These coefficients are used as a basis for defining a variety of data analysis techniques.     

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.     

Estimation of the sum of differences distribution

Consider the distribution of Z_i d_iwhere the d.d_i?s are 1=1 lldifferences independently, identically and symmetrically distributed with mean zero. The problem is to determine properties of the sdd given the distribution of the d._i?fs and the sample size n. The standardized moments as a function of the moments of the d._i!s are developed. A variance reduction technique for estimating the quantiles of the sdd using Monte Carlo methods is developed based on using the randomization sample consisting of the 2ⁿ values of Z _i+d. rather than the single observation i=l lZ d. corresponding to each sample d_id_n. The randomization sample is shown to produce unbiased and consistent estimators.     

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.     

Modified kolmogorov-smirnov tests of goodness of fit

The Kolmogorov-Smirnov (K–S) one-sided and two-sided tests of goodness of fit based on the test statistics D⁺ _n D^? _n and D_n are equivalent to tests based on taking the cumulative probability of the i–th order statistic of a sample of size n to be (i–.5)/n. Modified test statistics C⁺ _n, C^? _n and C_n are obtained by taking the cumulative probability to be i/(n+l). More generally, the cumula-tive probability may be taken to be (i?δ)/(n+l?2δ), as suggested by Blom (1958), where 0 less than or equal δ less than or equal .5. Critical values of the test statis-tics can be found by interpolating inversely in tables of the proba-bility integrals obtained by setting a=l/(n+l?2δ) in an expression given by Pyke (1959). Critical values for the D's (corresponding to δ=.5) have been tabulated to 5DP by Miller (1956) for n=1(1)100. The authors have made analogous tabulations for the C's (corresponding to δ=0) [previously tabulated by Durbin (1969) for n=1(1)60(2)100] and for the test statistics E⁺ _n, E^? _n and E_n corresponding to δ f.3. They have also made a Monte Carlo comparison of the power of the modified tests with that of the K–S test for several hypothetical distributions. In a number of cases, the power of the modified tests is greater than that of the K–S test, especially when the standard deviation is greater under the alternative than under the null hypo-thesis.     

Moments of suprema of random variables

The supremum of random variables representing a sequence of rewards is of interest in establishing the existence of optimal stopping rules. Necessary and sufficient conditions are given for existence of moments of sup_n(X_n ? c_n) and sup_n(S_n ? c_n) where X₁, X₂, … are i.i.d. random variables, S_n = X₁ + … + X_n, and c_n = (nL(n))^1/r, 0 < r < 2, L = 1, L = log, and L = log log. Following Cohn (1974), “rates of convergence” results are used in the proof.     

Maximum Likelihood Estimation in the Bivariate Binomial (0,1) Distribution:Application TO 2×2 Tables

We consider a 2×2 contingency table, with dichotomized qualitative characters (A,A) and (B,B), as a sample of size n drawn from a bivariate binomial (0,1) distribution. Maximum likelihood estimates p?₁p?₂ and p? are derived for the parameters of the two marginals p₁p₂ and the coefficient of correlation. It is found that p? is identical to Pearson's (1904)?=(χ²/n)½, where ?² is Pearson's usual chi-square for the 2×2 table. The asymptotic variance-covariance matrix of p?_lp?₂and p is also derived.     

Consistent directions for least-squares estimates

The least-squares estimate θ_n = X_n⁺y_n of the parameter θ in the linear model Y_n = X_nθ + ?_n may not be consistent, but there may be directions u such that u'θ_n tends to u'θ in some sense. This set of directions u has been characterized in two different papers: Drygas (1976) and Wu (1980). The conditions for consistency appear to be different in the two papers. The purpose of this note is to show that the two conditions are equivalent and that they both show that the consistent directions depend upon the geometry of the row vectors v_i, i = 1,…, n, of X_n with respect to the direction u.