Estimating the quantile function of a location-scale family of distributions based on few selected order statistics

Some general asymptotic methods of estimating the quantile function, Q(ξ), 0<ξ<1, of location-scale families of distributions based on a few selected order statistics are considered, with applications to some nonregular distributions. Specific results are discussed for the ABLUE of Q(ξ) for the location-scale exponential and double exponential distributions. As a further application of the exponential results, we discuss a nonlinear estimator of Q(ξ) for the scale-shape Pareto distribution.     

On the normal approximation of an estimate of the mean residual life of a multicomponent system

An estimate of the mean residual life function of a complex system of k independent identically distributed components is proposed and studied with emphasis being on the order of normal approximation.     

Asymptotics for tests on mean profiles,additional information and dimensionality under non-normality

We consider the comparison of mean vectors for k groups when k is large and sample size per group is fixed. The asymptotic null and non-null distributions of the normal theory likelihood ratio, Lawley–Hotelling and Bartlett–Nanda–Pillai statistics are derived under general conditions. We extend the results to tests on the profiles of the mean vectors, tests for additional information (provided by a sub-vector of the responses over and beyond the remaining sub-vector of responses in separating the groups) and tests on the dimension of the hyperplane formed by the mean vectors. Our techniques are based on perturbation expansions and limit theorems applied to independent but non-identically distributed sequences of quadratic forms in random matrices. In all these four MANOVA problems, the asymptotic null and non-null distributions are normal. Both the null and non-null distributions are asymptotically invariant to non-normality when the group sample sizes are equal. In the unbalanced case, a slight modification of the test statistics will lead to asymptotically robust tests. Based on the robustness results, some approaches for finite approximation are introduced. The numerical results provide strong support for the asymptotic results and finiteness approximations.     

Representations of moments using lower-order conditional moments

Moments and central moments of a random variable X   are expressed as integrals of functions of lower-order conditional moments and the cumulative distribution of X$X$. In particular, sample central moments of order 2k$2k$ are expressed as the sum of between groups variations, providing an analogue to the analysis of variance. Similar expressions are obtained for the expectations of real-valued and measurable functions of X$X$.     

The consistency of a matching test

Let $\text{X}{}^1{}_1\text{?X}{}^1{}_2\text{???X}{}^1{}_{\mathrm{n}}$ be the order statistics of a random sample from a distribution on [0, 1]. Let A_k, the kth match, be the event that $\text{X}{}^1{}_{\mathrm{k}}\text{?(}\text{(k?1)}\text{n}\text{k}\text{n}$], and let S_n be the total number of matches. The consistency of S_n for testing uniform df, U, against df G≠U is investigated, and it is shown that S_n is consistent if the intersection of G with U has Lebesgue measure zero. It is also consistent against a sequence of alternatives approaching U at a rate less faster than $\text{n}{}^{\mathrm{<mtext>-1</mtext><mtext>2</mtext>}}$.     

Estimating the distribution function using k-tuple ranked set samples

The basic assumption underlying the concept of ranked set sampling is that actual measurement of units is expensive, whereas ranking is cheap. This may not be true in reality in certain cases where ranking may be moderately expensive. In such situations, based on total cost considerations, k-tuple ranked set sampling is known to be a viable alternative, where one selects k units (instead of one) from each ranked set. In this article, we consider estimation of the distribution function based on k-tuple ranked set samples when the cost of selecting and ranking units is not ignorable. We investigate estimation both in the balanced and unbalanced data case. Properties of the estimation procedure in the presence of ranking error are also investigated. Results of simulation studies as well as an application to a real data set are presented to illustrate some of the theoretical findings.     

Partitioning k multivariate normal populations according to equivalence with respect to a standard vector

We propose optimal procedures to achieve the goal of partitioning k multivariate normal populations into two disjoint subsets with respect to a given standard vector. Definition of good or bad multivariate normal populations is given according to their Mahalanobis distances to a known standard vector as being small or large. Partitioning k multivariate normal populations is reduced to partitioning k non-central Chi-square or non-central F distributions with respect to the corresponding non-centrality parameters depending on whether the covariance matrices are known or unknown. The minimum required sample size for each population is determined to ensure that the probability of correct decision attains a certain level. An example is given to illustrate our procedures.     

Improved reduced-bias tail index and quantile estimators

In this paper, we deal with bias reduction techniques for heavy tails, trying to improve mainly upon the performance of classical high quantile estimators. High quantiles depend strongly on the tail index γ$\gamma$, for which new classes of reduced-bias estimators have recently been introduced, where the second-order parameters in the bias are estimated at a level _k1$k_1$ of a larger order than the level k at which the tail index is estimated. Doing this, it was seen that the asymptotic variance of the new estimators could be kept equal to the one of the popular Hill estimators. In a similar way, we now introduce new classes of tail index and associated high quantile estimators, with an asymptotic mean squared error smaller than that of the classical ones for all k in a large class of heavy-tailed models. We derive their asymptotic distributional properties and compare them with those of alternative estimators. Next to that, an illustration of the finite sample behavior of the estimators is also provided through a Monte Carlo simulation study and the application to a set of real data in the field of insurance.     

On the Markov property of order statistics

The order statistics from a sample of size n≥3 from a discrete distribution form a Markov chain if and only if the parent distribution is supported by one or two points. More generally, a necessary and sufficient condition for the order statistics to form a Markov chain for (n≥3) is that there does not exist any atom x₀ of the parent distribution F satisfying F(x₀-)>0 and F(x₀)<1. To derive this result a formula for the joint distribution of order statistics is proved, which is of an interest on its own. Many exponential characterizations implicitly assume the Markov property. The corresponding putative geometric characterizations cannot then be reasonably expected to obtain. Some illustrative geometric characterizations are discussed.     

Estimation and goodness-of-fit procedures for Farlie–Gumbel–Morgenstern bivariate copula of order statistics

In this study, we provide the Farlie–Gumbel–Morgenstern bivariate copula of rth and sth order statistics. The main emphasis in this study is on the inference procedure which is based on the maximum pseudo-likelihood estimate for the copula parameter. As for the methodology, goodness-of-fit test statistic for copulas which is based on a Cramér–von Mises functional of the empirical copula process is applied for selecting an appropriate model by bootstrapping. An application of the methodology to simulated data set is also presented.     

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.     

Two remarks on order statistics

Let X₍₁₎,…,X_(n) be the order statistics of n iid distributed random variables. We prove that (X_(i)) have a certain Markov property for general distributions and secondly that the order statistics have monotone conditional regression dependence. Both properties are well known in the case of continuous distributions.     

Subset selection of superior populations when the number of populations is large

The situation where k populations are partitioned into one inferior group and one superior group is considered. The statistical problem is to select a random size subset of superior populations while trying to avoid including any inferior populations. A selection procedure is assumed to satisfy the condition that the probability of selecting at least one superior population is bounded below by P¹<1. The performance of a procedure is measured by the probability of including an inferior population.The asymptotic performance, as k→∞ of Gupta's traditional maximum type procedure ψ^G is considered in the location-model. For normally distributed populations, ψ^G turns out to be asymptotically optimal, provided the size of the inferior group does not become infinitely larger than the size of the superior group.     

Second order asymptotic and non-asymptotic optimality properties of combined tests

Let p independent test statistics be available to test a null hypothesis concerned with the same parameter. The p are assumed to be similar tests. Asymptotic and non-asymptotic optimality properties of combined tests are studied. The asymptotic study centers around two notions. The first is Bahadur efficiency. The second is based on a notion of second order comparisons. The non-asymptotic study is concerned with admissibility questions. Most of the popular combining methods are considered along with a method not studied in the past. Among the results are the following: Assume each of the p statistics has the same Bahadur slope. Then the combined test based on the sum of normal transforms, is asymptotically best among all tests studied, by virtue of second order considerations. Most of the popular combined tests are inadmissible for testing the noncentrality parameter of chi-square, t, and F distributions. For chi-square a combined test is offered which is admissible, asymptotically optimal (first order), asymptotically optimal (second order) among all tests studied, and for which critical values are obtainable in special cases. Extensions of the basic model are given.     

Saturated designs for multivariate cubic regression

This paper deals with the problem of finding saturated designs for multivariate cubic regression on a cube which are nearly D-optimal. A finite class of designs is presented for the k dimensional cube having the property that the sequence of the best designs in this class for each k is asymptotically efficient as k increases. A method for constructing good designs in this class is discussed and the construction is carried out for 1?k?8. These numerical results are presented in the last section of the paper.     

Sample quantiles and additive statistics: Information,sufficiency, estimation

The order of the increase in the Fisher information measure contained in a finite number k of additive statistics or sample quantiles, constructed from a sample of size n, as n → ∞, is investigated. It is shown that the Fisher information in additive statistics increases asymptotically in a manner linear with respect to n, if 2 + δ moments of additive statistics exist for some δ > 0. If this condition does not hold, the order of increase in this information is non-linear and the information may even decrease. The problem of asymptotic sufficiency of sample quantiles is investigated and some linear analogues of maximum likelihood equations are constructed.     

Optimal mixed-level k-circulant supersaturated designs

Supersaturated designs (SSDs) offer a potentially useful way to investigate many factors with only few experiments in the preliminary stages of experimentation. This paper explores how to construct E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs using k-cyclic generators. The necessary and sufficient conditions for the existence of mixed-level k-circulant SSDs with the equal occurrence property are provided. Properties of the mixed-level k  -circulant SSDs are investigated, in particular, the sufficient condition under which the generator vector produces an E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal SSD is obtained. Moreover, many new E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs are constructed and listed. The method here generalizes the one proposed by Liu and Dean [2004. k$k$-circulant supersaturated designs. Technometrics 46, 32–43] for two-level SSDs and the one due to Georgiou and Koukouvinos [2006. Multi-level k-circulant supersaturated designs. Metrika 64, 209–220] for the multi-level case.     

Rank-order tests for the parallelism of several regression surfaces

For testing the hypothesis that several (s?2) linear regression surfaces X_ki=α_k+β_kc_ki+Z_ki (k=1,…,s) are parallel to one another, i.e., β₁=?=β_s, a class of rank-order tests are considered. The tests are shown to be asymptotically distribution-free, and their asymptotic efficiency relative to the general likelihood ratio test is derived. Asymptotic optimality in the sense of Wald is also discussed.     

Minimax subset selection for the multinomial distribution

Let (X₁,…,X_k) be a multinomial vector with unknown cell probabilities (p₁,?,p_k). A subset of the cells is to be selected in a way so that the cell associated with the smallest cell probability is included in the selected subset with a preassigned probability, P¹. Suppose the loss is measured by the size of the selected subset, S. Using linear programming techniques, selection rules can be constructed which are minimax with respect to S in the class of rules which satisfy the P¹-condition. In some situations, the rule constructed by this method is the rule proposed by Nagel (1970). Similar techniques also work for selection in terms of the largest cell probability.