Pmc-optimal nonparametric quantile estimator

According to Pitman's Measure of Closeness, if T₁and T₂are two estimators of a real parameter $[d], then T₁is better than T₂if Po[d]{\T₁-o[d] < \T₂-0[d]\} > 1/2 for all 0[d]. It may however happen that while T₁is better than T₂and T₂is better than T₃, T₃is better than T₁. Given q ? (0,1) and a sample X₁, X₂, ..., X_nfrom an unknown F ? F, an estimator T* = T*(X₁,X₂...X_n)of the q-th quantile of the distribution F is constructed such that P_F{\F(T*)-q\ <[d] \F(T)-q\} >[d] 1/2 for all F?F and for all T€T, where F is a nonparametric family of distributions and T is a class of estimators. It is shown that T* =X_j:n'for a suitably chosen jth order statistic.     

Kolmogorov-type tests of goodness-of-fit against stochastic ordering

This article addresses the problem of testing the null hypothesis H₀ that a random sample of size n is from a distribution with the completely specified continuous cumulative distribution function F_n(x). Kolmogorov-type tests for H₀ are based on the statistics C⁺ _n = Sup[F_n(x)?F₀(x)] and C^? _n=Sup[F₀(x)?F_n(x)], where F_n(x) is an empirical distribution function. Let F(x) be the true cumulative distribution function, and consider the ordered alternative H₁: F(x)≥F₀(x) for all x and with strict inequality for some x. Although it is natural to reject H₀ and accept H₁ if C ⁺ _n is large, this article shows that a test that is superior in some ways rejects F₀ and accepts H₁ if C^mdash _n is small. Properties of the two tests are compared based on theoretical results and simulated results.     

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     

A zero-one law for large order statistics

Fix r ≥ 1, and let {M_nr} be the rth largest of {X₁,X₂,…X_n}, where X₁,X₂,… is a sequence of i.i.d. random variables with distribution function F. It is proved that P[M_nr ≤ u_n i.o.] = 0 or 1 according as the series Σ^∞_n=3Fⁿ(u_n)(log log n)^r/n converges or diverges, for any real sequence {u_n} such that n{1 -F(u_n)} is nondecreasing and divergent. This generalizes a result of Bamdorff-Nielsen (1961) in the case r = 1.     

Asymptotic expaxsioxs for the joint distribution of cirrelated hotellings t2 statlstics under normality

Let T² _i=z′_iS^?1z_i, i==,…k be correlated Hotelling's T² statistics under normality. where z=(z′_i,…,z′_k)′ and nS are independently distributed as N_kp((O,ρ?∑) and Wishart distribution W_p(∑, n), respectively. The purpose of this paper is to study the distribution function F(x₁,…,x_k) of (T² _i,…,T² _k) when n is large. First we derive an asymptotic expansion of the characteristic function of (T² _i,…,T² _k) up to the order n^?2. Next we give asymptotic expansions for (T² _i,…,T² _k) in two cases (i)ρ=I_k and (ii) k=2 by inverting the expanded characteristic function up to the orders n^?2 and n^?1, respectively. Our results can be applied to the distribution function of max (T² _i,…,T² _k) as a special case.     

A note on a strong renewal theorem

Let {S_n, n ≥ 1} be a sequence of partial sums of independent and identically distributed non-negative random variables with a common distribution function F. Let F belong to the domain of attraction of a stable law with exponent α, 0 < α < 1. Suppose H(t) = ? N(t), t ? 0, where N(t) = max(n : S_n ≥ t). Under some additional assumptions on F, the difference between H(t) and its asymptotic value as t → ∞ is estimated.     

Limiting distributions of Kolmogorov-Lévy-type statistics under the alternative

Let X_i, 1 ≤ i ≤ n, be independent identically distributed random variables with a common distribution function F, and let G be a smooth distribution function. We derive the limit distribution of □{ρ_α(F_n, G) - _α(F, G)}, where F_n is the empirical distribution function based on X₁,…,X_n and _α is a Kolmogorov-Lévy-type metric between distribution functions. For α ≤ 0 and two distribution functions F and G the metric p_α is given by p_α(F, G) = inf {? ≤ 0: G(x - α?) - ? F(x) ≤ G(x + α?) + ? for all x ?}.     

Jackknifing L-estimates

Linear functions of order statistics (“L-estimates”) of the form T_n =under jackknifing are investigated. This paper proves that with suitable conditions on the function J, the jackknifed version T_n of the L-estimate T_n has the same limit distribution as T_n. It is also shown that the jackknife estimate of the asymptotic variance of n^1/2 is consistent. Furthermore, the Berry-Esséen rate associated with asymptotic normality, and a law of the iterated logarithm of a class of jackknife L-estimates, are characterized.     

A note on hazard rates of order statistics

Let F_k:m be the cumulative disribution function of the kth order statistic in a sample of size n from a distribution

F(x) with density function f(x).The primary objective of this paper is to show that F_k+1mis IHR(increasing hazard rate) if F_km(x)is IHH and that F_k-1:n(x)is DHR.(decreasing hazard rate) if F_km(x) is DHR.     

An asymptotic representation of a ratio of two statistics and its applications

Some statistics in common use take a form of a ratio of two statistics.In this paper, we will discuss asymptotic properties of the ratio statistic.We obtain an asymptotic representation of the ratio with remainder term o _p(n ^-1) and a Edgeworth expansion with remainder term o(n ^-1/2) And as example, the asymptotic representation and the Edgeworth expansion of the jackknife skewness estimator for U-statistics are established and we discuss the biases of the skewness estimator theoretically.We also apply the result to an estimator of Pearson’s coefficient of variation and the sample correlation coefficient.     

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.     

On a conjecture of Kakosyan,Klebanov and Melamed

Suppose X₁, X₂, ..., X_m is a random sample of size m from a population with probability density function f(x), x>0 and let X_1,m<...m,m be the corresponding order statistics. We assume m as an integer valued random variable with P(m=k)=p(1?p)^k?1, k=1, 2, ... and 0 and n X_1,n for fixed n characterizes the exponential distribution. In this paper we prove that under the assumption of monotone hazard rate the identical distribution of and (n?r+1) (X_r,n?X_r?1,n) for some fixed r and n with 1≤r≤n, n≥2, X_0,n=0, characterizes the exponential distribution. Under the assumption of monotone hazard rate the conjecture of Kakosyan, Klebanov and Melamed follows from the above result with r=1.     

Efficient Estimation of a Distribution Function under Quadrant Dependence

LetX₁,X₂, ..., be real-valued random variables forming a strictly stationary sequence, and satisfying the basic requirement of being either pairwise positively quadrant dependent or pairwise negatively quadrant dependent. LetF^ be the marginal distribution function of theX_ips, which is estimated by the empirical distribution functionF_n and also by a smooth kernel-type estimateF_n, by means of the segmentX₁, ...,X_n. These estimates are compared on the basis of their mean squared errors (MSE). The main results of this paper are the following. Under certain regularity conditions, the optimal bandwidth (in the MSE sense) is determined, and is found to be the same as that in the independent identically distributed case. It is also shown thatn MSE(F_n(t)) andnMSE (F^_n(t)) tend to the same constant, asn→∞ so that one can not discriminate be tween the two estimates on the basis of the MSE. Next, ifi(n) = min {k∈{1, 2, ...}; MSE (F_k(t)) ≤ MSE (F_n(t))}, then it is proved thati(n)/n tends to 1, asn→∞. Thus, once again, one can not choose one estimate over the other in terms of their asymptotic relative efficiency. If, however, the squared bias ofF^_n(t) tends to 0 sufficiently fast, or equivalently, the bandwidthh_n satisfies the requirement thatnh³_n→ 0, asn→∞, it is shown that, for a suitable choice of the kernel, (i(n) ?n)/(nh_n) tends to a positive number, asn→∞ It follows that the deficiency ofF_n(t) with respect toF^_n(t),i(n) ?n, is substantial, and, actually, tends to ∞, asn→∞. In terms of deficiency, the smooth estimateF^_n(t) is preferable to the empirical distribution functionF_n(t)     

Zur abschätzung von lösungen linearer integralgleichungen mit hilfe der monte-carlo-methode

Let X₁, X₂, … be i.i.d.r.v. and write (X₁+…X_n?A_n)/B_n?F_n, where B_n >0.A_nER₁, n≥1. It is known that solely one–sided asymptotic assumptions imposed on F_n imply F_n0. In the present note we show that stronger one–sided assumptions lead even to the existence of EX₁ ³ so that the BERRY-ESSEEN inequalities hold true.     

The number of records within a random interval of the current record value

LetX ₁,X ₂, … be a sequence of i.i.d. random variables with some continuous distribution functionF. LetX(n) be then-th record value associated with this sequence and μ _n ⁻ , μ _n ⁺ be the variables that count the number of record values belonging to the random intervals(f−(X(n)), X(n)), (X(n), f+(X(n))), wheref−, f+ are two continuous functions satisfyingf−(x)<x, f+(x)>x. Properties of μ _n ⁻ , μ _n ⁺ are studied in the present paper. Some statistical applications connected with these variables are also provided.     

Estimation of the derivative of a density and related functions

Let Y₁,…,Y _n, (Y₁ <Y₂<…<Y _n) be the order statistics of a random sample from a distribution F with density f on the realline. This paper gives a class of estimators of the derivativef'(x) of the density f at points x for which f has

a continuoussecond derivative. These estimators are based on spacings inthe order statistics Y_j+kn -y _j j = 1,…,n-k_n,k_n<n.     

A closer examination on some parametric alternatives to the ANOVA F-test

In experiments, the classical (ANOVA) F-test is often used to test the omnibus null-hypothesis μ₁ = μ₂ ... = μ _j = ... = μ _n (all n population means are equal) in a one-way ANOVA design, even when one or more basic assumptions are being violated. In the first part of this article, we will briefly discuss the consequences of the different types of violations of the basic assumptions (dependent measurements, non-normality, heteroscedasticity) on the validity of the F-test. Secondly, we will present a simulation experiment, designed to compare the type I-error and power properties of both the F-test and some of its parametric adaptations: the Brown & Forsythe F^*-test and Welch’s V_w-test. It is concluded that the Welch V_w-test offers acceptable control over the type I-error rate in combination with (very) high power in most of the experimental conditions. Therefore, its use is highly recommended when one or more basic assumptions are being violated. In general, the use of the Brown & Forsythe F^*-test cannot be recommended on power considerations unless the design is balanced and the homoscedasticity assumption holds.     

Jackknifing in Categorical Data Analysis

Estimation of nonlinear functions of a multinomial parameter vector is necessary in many categorical data problems. The first and second order jackknife are explored for the purpose of reduction of bias. The second order jackknife of a function g(.) of a multinomial parameter is shown to be asymptotically normal if all second order partials ?²g( p )?dp_i?p_j obey a Hölder condition with exponent α>1/2. Numerical results for the estimation of the log odds ratio in a 2times2 table demonstrate the efficiency of the jackknife method for reduction of mean-square-error and the construction of approximate confidence intervals.     

Nonparametric Estimation of a Regression Function: Limiting Distribution2

Consider the regression model Y_i= g(x_i) + e_i, i = 1,…, n, where g is an unknown function defined on [0, 1], 0 = x₀ < x₁ < … < x_n≤ 1 are chosen so that max_1≤i≤n(x_i-x_{i- 1}) = 0(n^-1), and where {e_i} are i.i.d. with Ee₁= 0 and Var e₁ - s?². In a previous paper, Cheng & Lin (1979) study three estimators of g, namely, g_1n of Cheng & Lin (1979), g_2n of Clark (1977), and g_3n of Priestley & Chao (1972). Consistency results are established and rates of strong uniform convergence are obtained. In the current investigation the limiting distribution of &_in, i = 1, 2, 3, and that of the isotonic estimator g**_n are considered.     

On the construction of orthogonal F-squares of order n from an orthogonal array (n, k, s, 2) and an OL(s, t) set

Complete sets of orthogonal F-squares of order n = s^p, where g is a prime or prime power and p is a positive integer have been constructed by Hedayat, Raghavarao, and Seiden (1975). Federer (1977) has constructed complete sets of orthogonal F-squares of order n = 4t, where t is a positive integer. We give a general procedure for constructing orthogonal F-squares of order n from an orthogonal array (n, k, s, 2) and an OL(s, t) set, where n is not necessarily a prime or prime power. In particular, we show how to construct sets of orthogonal F-squares of order n = 2s^p, where s is a prime or prime power and p is a positive integer. These sets are shown to be near complete and approach complete sets as s and/or p become large. We have also shown how to construct orthogonal arrays by these methods. In addition, the best upper bound on the number t of orthogonal F(n, λ₁), F(n, λ₂), …, F(n, λ₁) squares is given.