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 The Role of a Certain Eigenvalue in Estimating the Growth Rate of a Branching Process

In many situations, the data given on a p-type Galton-Watson process Z_n eP N^p will consist of the total generation sizes |Z_n| only. In that case, the maximum likelihood estimator ρ_ML of the growth rate ρ is not observable, and the asymptotic properties of the most obvious estimators of ρ based on the |Z_n|, as studied by Asmussen & Keiding (1978), show a crucial dependence on |ρ₁|,ρ₁ being a certain other eigenvalue of the offspring mean matrix. In fact, if |ρ₁|²≤ρ, then the speed of convergence compares badly with ρ_ML. In the present note, it is pointed out that recent results of Heyde (1981) on so-called Fibonacci branching processes provide further examples of this phenomenon, and an estimator with the same speed of convergence as ρ_ML and based on the |Z_n| alone is exhibited for the case p= 2, ρ₁²≥ρ.     

A GALTON-WATSON BRANCHING PROCESS IN VARYING ENVIRONMENTS WITH ESSENTIALLY CONSTANT OFFSPRING MEANS AND TWO RATES OF GROWTH1

A Galton-Watson process in varying environments (Z_n), with essentially constant offspring means, i.e. E(Z_n)/mⁿ→α∈(0, ∞), and exactly two rates of growth is constructed. The underlying sample space Ω can be decomposed into parts A and B such that (Z_n)_n grows like 2ⁿon A and like mⁿon B (m > 4).     

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

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

Prediction based on linear combinations of order statistics and bivariate concomitants in the case of multivariate elliptical distributions

In this paper, by considering a (3n+1) -dimensional random vector (X₀, X^T, Y^T, Z^T)^T having a multivariate elliptical distribution, we derive the exact joint distribution of (X₀, a^TX_(n), b^TY_[n], c^TZ_[n])^T, where a, b, c∈?ⁿ, X_(n)=(X₍₁₎, …, X_(n))^T, X₍₁₎<···<X_(n), is the vector of order statistics arising from X, and Y_[n]=(Y_[1], …, Y_[n])^T and Z_[n]=(Z_[1], …, Z_[n])^T denote the vectors of concomitants corresponding to X_(n) ((Y_[r], Z_[r])^T, for r=1, …, n, is the vector of bivariate concomitants corresponding to X_(r)). We then present an alternate approach for the derivation of the exact joint distribution of (X₀, X_(r), Y_[r], Z_[r])^T, for r=1, …, n. We show that these joint distributions can be expressed as mixtures of four-variate unified skew-elliptical distributions and these mixture forms facilitate the prediction of X_(r), say, based on the concomitants Y_[r] and Z_[r]. Finally, we illustrate the usefulness of our results by a real data.     

Estimation of Conditional Ranks and Tests of Exogeneity in Nonparametric Nonseparable Models

Consider a nonparametric nonseparable regression model Y = ?(Z, U), where ?(Z, U) is strictly increasing in U and U ～ U[0, 1]. We suppose that there exists an instrument W that is independent of U. The observable random variables are Y, Z, and W, all one-dimensional. We construct test statistics for the hypothesis that Z is exogenous, that is, that U is independent of Z. The test statistics are based on the observation that Z is exogenous if and only if V = F_Y|Z(Y|Z) is independent of W, and hence they do not require the estimation of the function ?. The asymptotic properties of the proposed tests are proved, and a bootstrap approximation of the critical values of the tests is shown to be consistent and to work for finite samples via simulations. An empirical example using the U.K. Family Expenditure Survey is also given. As a byproduct of our results we obtain the asymptotic properties of a kernel estimator of the distribution of V, which equals U when Z is exogenous. We show that this estimator converges to the uniform distribution at faster rate than the parametric n^{? 1/2}-rate.     

THE CONVERGENCE OF AUTOCORRELATIONS AND AUTOREGRESSIONS1

For a general class of scalar stationary processes, essentially those for which the best linear predictor is the best predictor (in the mean square sense), it is shown that, under fairly minor additional conditions, the sample autocorrelations converge to the true values almost surely and hniformly in the lag, t, at a rate (T^-1log T)^1/2, where T is the sample size. For ARMA processes, if |t|(log T)^a, a < ∞, the rate is the best possible, namely (T^-1log log T)^1/2. In particular the somewhat implausible condition, on the innovations, that E{ε(t)²| F_t-l} is constant is avoided in these results. The theorems are used to discuss autoregressive approximation. When the stationary process is a vector process the condition on the innovation sequence, ε(t), that E{ε(t)ε(t)| F_t-l} be constant, cannot be entirely avoided in relation to autoregressive approximation. This is also discussed.     

CERTAIN BOUNDS CONCERNING CHARACTERISTIC FUNCTIONS1

The largest value of the constant c for which holds over the class of random variables X with non-zero mean and finite second moment, is c=π. Let the random variable (r.v.) X with distribution function F(·) have non-zero mean and finite second moment. In studying a certain random walk problem (Daley, 1976) we sought a bound on the characteristic function of the form for some positive constant c. Of course the inequality is non-trivial only provided that . This note establishes that the best possible constant c =π. The wider relevance of the result is we believe that it underlines the use of trigonometric inequalities in bounding the (modulus of a) c.f. (see e.g. the truncation inequalities in §12.4 of Loève (1963)). In the present case the bound thus obtained is the best possible bound, and is better than the bound (2) |1-?(θ)| ≥ |θEX|-θ²EX²\2 obtained by applying the triangular inequality to the relation which follows from a two-fold integration by parts in the defining equation (*). The treatment of the counter-example furnished below may also be of interest. To prove (1) with c=π, recall that sin u > u(1-u/π) (all real u), so Since |E sinθX|-|E sin(-θX)|, the modulus sign required in (1) can be inserted into (4). Observe that since sin u > u for u < 0, it is possible to strengthen (4) to (denoting max(0,x) by x₊) To show that c=π is the best possible constant in (1), assume without loss of generality that EX > 0, and take θ > 0. Then (1) is equivalent to (6) c < θEX²/{EX-|1-?(θ)|/θ} for all θ > 0 and all r.v.s. X with EX > 0 and EX². Consider the r.v. where 0 < x < 1 and 0 < γ < ∞. Then EX=1, EX²=1+γx², From (4) it follows that |1-?(θ)| > 0 for 0 < |θ| <π|EX|/EX² but in fact this positivity holds for 0 < |θ| < 2π|EX|/EX² because by trigonometry and the Cauchy-Schwartz inequality, |1-?(θ)| > |Re(1-?(θ))| = |E(1-cosθX)| = 2|E sin²θX/2| (10) >2(E sinθX/2)² (11) >(|θEX|-θ²EX²/2π)²/2 > 0, the inequality at (11) holding provided that |θEX|-θ²EX²/2π > 0, i.e., that 0 < |θ| < 2π|EX|/EX². The random variable X at (7) with x= 1 shows that the range of positivity of |1-?(θ)| cannot in general be extended. If X is a non-negative r.v. with finite positive mean, then the identity shows that (1-?(θ))/iθEX is the c.f. of a non-negative random variable, and hence (13) |1-?(θ)| < |θEX| (all θ). This argument fans if pr{X < 0}pr{X> 0} > 0, but as a sharper alternative to (14) |1-?(θ)| < |θE|X||, we note (cf. (2) and (3)) first that (15) |1-?(θ)| < |θEX| +θ²EX²/2. For a bound that is more precise for |θ| close to 0, |1-?(θ)|²= (Re(1-?(θ)))²+ (Im?(θ))² <(θ²EX²/2)²+(|θEX| +θ²EX²_-/π)², so (16) |1-?(θ)| <(|θEX| +θ²EX²_-/π) + |θ|³(EX²)²/8|EX|.     

A Strong Invariance Theorem of the Tail Empirical Copula Processes

We study the behavior of bivariate empirical copula process 𝔾 _n (·, ·) on pavements [0, k _n /n]² of [0, 1]², where k _n is a sequence of positive constants fulfilling some conditions. We provide a upper bound for the strong approximation of 𝔾 _n (·, ·) by a Gaussian process when k _n /n↘γ as n → ∞, where 0 ≤ γ ≤1.     

ON THE NUMBER OF RECORDS NEAR THE MAXIMUM

Recent work has considered properties of the number of observations X_j, independently drawn from a discrete law, which equal the sample maximum X_(n) The natural analogue for continuous laws is the number K_n(a) of observations in the interval (X_(n)–a, X_(n)], where a > 0. This paper derives general expressions for the law, first moment, and probability generating function of K_n(a), mentioning examples where evaluations can be given. It seeks limit laws for n→ and finds a central limit result when a is fixed and the population law has a finite right extremity. Whenever the population law is attracted to an extremal law, a limit theorem can be found by letting a depend on n in an appropriate manner; thus the limit law is geometric when the extremal law is the Gumbel type. With these results, the paper obtains limit laws for ‘top end’ spacings X_(n) - X_(n-j) with j fixed.     

A NEW APPROXIMATION FOR FISHER'S Z

As the sample size increases, the coefficient of skewness of the Fisher's transformation z= tanh^-1r, of the correlation coefficient decreases much more rapidly than the excess of its kurtosis. Hence, the distribution of standardized z can be approximated more accurately in terms of the t distribution with matching kurtosis than by the unit normal distribution. This t distribution can, in turn be subjected to Wallace's approximation resulting in a new normal approximation for the Fisher's z transform. This approximation, which can be used to estimate the probabilities, as well as the percentiles, compares favorably in both accuracy and simplicity, with the two best earlier approximations, namely, those due to Ruben (1966) and Kraemer (1974). Fisher (1921) suggested approximating distribution of the variance stabilizing transform z=(1/2) log ((1 +r)/(1r)) of the correlation coefficient r by the normal distribution with mean = (1/2) log ((1 + p)/(lp)) and variance =l/(n3). This approximation is generally recognized as being remarkably accurate when ||Gr| is moderate but not so accurate when ||Gr| is large, even when n is not small (David (1938)). Among various alternatives to Fisher's approximation, the normalizing transformation due to Ruben (1966) and a t approximation due to Kraemer (1973), are interesting on the grounds of novelty, accuracy and/or aesthetics. If r?= r/√ (1r²) and r?|Gr = |Gr/√(1|Gr²), then Ruben (1966) showed that (1) g_n (r,|Gr) ={(2n5)/2}^1/2r?r{(2n3)/2}^1/2r?|GR, {1 + (1/2)(r?r²+r?|Gr²)}^1/2 is approximately unit normal. Kraemer (1973) suggests approximating (2) t_n (r, |Gr) = (r|GR¹) √ (n2), √(11r²) √(1|Gr²) by a Student's t variable with (n2) degrees of freedom, where after considering various valid choices for |Gr¹ she recommends taking |Gr¹= |Gr*, the median of r given n and |Gr.     

On An Intriguing Distributional Identity

For a continuous random variable X with support equal to (a, b), with c.d.f. F, and g: Ω₁ → Ω₂ a continuous, strictly increasing function, such that Ω₁∩Ω₂?(a, b), but otherwise arbitrary, we establish that the random variables F(X) ? F(g(X)) and F(g^{? 1}(X)) ? F(X) have the same distribution. Further developments, accompanied by illustrations and observations, address as well the equidistribution identity U ? ψ(U) = ^dψ^{? 1}(U) ? U for U ～ U(0, 1), where ψ is a continuous, strictly increasing and onto function, but otherwise arbitrary. Finally, we expand on applications with connections to variance reduction techniques, the discrepancy between distributions, and a risk identity in predictive density estimation.     

Strassen type limit points for moving averages of a wiener process

Let {W(s); 8 ≥ 0} be a standard Wiener process, and let β_N = (2a_N (log (N/a_N) + log log N)^-1/2, 0 < α_N ≤ N < ∞, where α_N↑ and α_N/N is a non-increasing function of N, and define γ_N(t) = β_N[W(n_N + ta_N) ? W(n_N)), 0 ≥ t ≥ 1, with n_N = N – a_N. Let K = {x ? C[0,1]: x is absolutely continuous, x(0) = 0 and }. We prove that, with probability one, the sequence of functions {γ_N(t), t ? [0,1]} is relatively compact in C[0,1] with respect to the sup norm ||·||, and its set of limit points is K. With a_N = N, our result reduces to Strassen's well-known theorem. Our method of proof follows Strassen's original, direct approach. The latter, however, contains an oversight which, in turn, renders his proof invalid. Strassen's theorem is true, of course, and his proof can also be rectified. We do this in a somewhat more general context than that of his original theorem. Applications to partial sums of independent identically distributed random variables are also considered.     

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.     

Characterizations of generalized mixtures of geometric and exponential distributions based on upper record values

Let X _{U (1)} < X _{U (2)} < … < X _{U ( n )} < … be the sequence of the upper record values from a population with common distribution function F. In this paper, we first give a theorem to characterize the generalized mixtures of geometric distribution by the relation between E[(X _{U ( n +1)}–X _{U ( n )})²|X _{U ( n )} = x] and the function of the failure rate of the distribution, for any positive integer n. Secondly, we also use the same relation to characterize the generalized mixtures of exponential distribution. The characterizing relations were motivated by the work of Balakrishnan and Balasubramanian (1995). Received: March 31, 1999; revised version: November 22, 1999     

On a Confidence Interval for the Mean of an Asymmetric Distribution

A clarification is given of the main result (1.1) in Communications in Statistics: Theory and Methods 34:753–766. The term {1 + 6a(r ? a)}^1/3 is to be understood as sgn(1 + 6a(r ? a)) | 1 + 6a(r ? a)|^1/3. The result is expressed in a more user-friendly form. An issue is raised regarding the common usage of the expression x ^1/n when n is even.     

The uniform convergence of the nadaraya-watson regression function estimate

If (X₁,Y₁), …, (X_n,Y_n) is a sequence of independent identically distributed R_d × R-valued random vectors then Nadaraya (1964) and Watson (1964) proposed to estimate the regression function m(x) = ? {Y₁|X₁ = x{ by where K is a known density and {h_n} is a sequence of positive numbers satisfying certain properties. In this paper a variety of conditions are given for the strong convergence to 0 of ess_Xsup|m_n (X)-m(X)| (here X is independent of the data and distributed as X₁). The theorems are valid for all distributions of X₁ and for all sequences {h_n} satisfying h_n → 0 and nh/log n→0.     

Uniform asymptotic linearity of a process based on a signed rank statistic

Consider the process with, cf. (1.2) on page 265 in B1, X₁, …, X_N a sample from a distribution F and, for i = 1, …, N, R${}_{\text{|x}{}_{\text{1}}\text{, - q}{}_{\text{1}}\text{ø|}}$ , the rank of |X₁ - q₁ø| among |X₁ - q₁ø|, …, |X_N - q_Nø|. It is shown that, under certain regularity conditions on F and on the constants p_i and q_i, T^ø_N(t) is asymptotically approximately a linear function of ø uniformly in t and in ø for |ø| ≤ C. The special case where the p_i and the q_i, are independent of i is considered.