Expected Power for the False Discovery Rate with Independence

The Benjamini-Hochberg procedure is widely used in multiple comparisons. Previous power results for this procedure have been based on simulations. This article produces theoretical expressions for expected power. To derive them, we make assumptions about the number of hypotheses being tested, which null hypotheses are true, which are false, and the distributions of the test statistics under each null and alternative. We use these assumptions to derive bounds for multiple dimensional rejection regions. With these bounds and a permanent based representation of the joint density function of the largest p-values, we use the law of total probability to derive the distribution of the total number of rejections. We derive the joint distribution of the total number of rejections and the number of rejections when the null hypothesis is true. We give an analytic expression for the expected power for a false discovery rate procedure that assumes the hypotheses are independent.     

Expected Power for the False Discovery Rate with Independence

The Benjamini–Hochberg procedure is widely used in multiple comparisons. Previous power results for this procedure have been based on simulations. This article produces theoretical expressions for expected power. To derive them, we make assumptions about the number of hypotheses being tested, which null hypotheses are true, which are false, and the distributions of the test statistics under each null and alternative. We use these assumptions to derive bounds for multiple dimensional rejection regions. With these bounds and a permanent based representation of the joint density function of the largest p-values, we use the law of total probability to derive the distribution of the total number of rejections. We derive the joint distribution of the total number of rejections and the number of rejections when the null hypothesis is true. We give an analytic expression for the expected power for a false discovery rate procedure that assumes the hypotheses are independent.     

Fast Computation by Block Permanents of Cumulative Distribution Functions of Order Statistics from Several Populations

The joint cumulative distribution function for order statistics arising from several different populations is given in terms of the distribution functions of the populations. The computational cost of our formula in the case of two populations is still exponential in the worst case, but it is a dramatic improvement compared to the general formula by Bapat and Beg. In the case when only the joint distribution function of a subset of the order statistics of fixed size is needed, the complexity is polynomial, for the case of two populations.     

Probability of ties and Markov property in discrete order statistics

It is well known that, in the continuous case, the probability that two consecutive order statistics are equal to zero, whereas it is not true when the distribution is discrete. It is, perhaps, for this reason that order statistics from discrete distributions has not been investigated in the literature as much as from a continuous distribution. The main purpose of this paper, therefore, is to obtain the probability of ties when the distribution is discrete. Also it is shown that, in the discrete case, the Markov property does not hold good. However, the order statistics from a geometric distribution forms a Markov chain.     

On the sums of probability functions of order statistics

When a random vector is independent and identically distributed, we have expressed the sums of the marginal probability functions of the order statistics of the random vector in terms of the common marginal probability functions of the random vector. We have also derived the relationships between the sums of the joint probability functions of two order statistics of the random vector and the common marginal probability functions of the random vector.     

Distributions of Runs and Scans on Higher-Order Markov Trees

In this article, we consider the distributions of the number of success runs of specified length and scans on a higher-order Markov tree under three different enumeration schemes (the “non overlapping”, the “at least”, and the “overlapping” scheme). Recursive formulae for the evaluation of their probability generating functions are established. We provide a proper framework for extending the exact distribution theory of runs and scans from based on sequences to based on directed trees. Some numerical results for the run and scan statistics are given in order to illustrate the computational aspects and the feasibility of our theoretical results. Finally, two special reliability systems are considered, which are closely related to our general results.     

Certain nonparametric classification rules and their asymptotic efficiencies

Two nonparametric classification rules for e-univariace populations are proposed, one in which the probability of correct classification is a specified number and the other in which one has to evaluate the probability of correct classification. In each case the classification is with respect to the Chernoff and Savage (1958) class of statistics, with possible specialization to populations having different location shifts and different changes of scale. An optimum property, namely the consistency of the classification procedure, is established for the second rule, when the distributions are either fixed or “near” in the Pitman sense and are tending to a common distribution at a specified rate. A measure of asymptotic efficiency is defined for the second rule and its asymptotic efficiency based on the Chernoff-Savage class of statistics relative to the parametric competitors ie the case of location shifts and scale changes is shown to be equal to the analogous Pitman efficiency.     

A Positive False Discovery Rate Convergence Result

The positive false discovery rate (pFDR) is the average proportion of false rejections given that the overall number of rejections is greater than zero. Assuming that the proportion of true null hypotheses, proportion of false positives, and proportion of true positives all converge pointwise, the pFDR converges to a continuous limit uniformly over all significance levels. We are showing that the uniform convergence still holds given a weaker assumption that the proportion of true positives converges in L ¹.     

Probability density function of quotient of order statistics from the pareto,power and weibull distributions

This paper deals with the probability density functions of quotient of order statistics. We use the Mellin transform technique, to find the distribution of the quotient Z= X/Xwhere X.,X(i < j) are the ith and jth order statistics from the Pareto, Power and Weibull distributions     

How Important Is the Effect of Rounding in Goodness-of-Fit

Abstract

In the area of goodness-of-fit there is a clear distinction between the problem of testing the fit of a continuous distribution and that of testing a discrete distribution. In all continuous problems the data is recorded with a limited number of decimals, so in theory one could say that the problem is always of a discrete nature, but it is a common practice to ignore discretization and proceed as if the data is continuous. It is therefore an interesting question whether in a given problem of test of fit, the “limited resolution” in the observed recorded values may be or may be not of concern, if the analysis done ignores this implied discretization. In this article, we address the problem of testing the fit of a continuous distribution with data recorded with a limited resolution. A measure for the degree of discretization is proposed which involves the size of the rounding interval, the dispersion in the underlying distribution and the sample size. This measure is shown to be a key characteristic which allows comparison, in different problems, of the amount of discretization involved. Some asymptotic results are given for the distribution of the EDF (empirical distribution function) statistics that explicitly depend on the above mentioned measure of degree of discretization. The results obtained are illustrated with some simulations for testing normality when the parameters are known and also when they are unknown. The asymptotic distributions are shown to be an accurate approximation for the true finite n distribution obtained by Monte Carlo. A real example from image analysis is also discussed. The conclusion drawn is that in the cases where the value of the measure for the degree of discretization is not “large”, the practice of ignoring discreteness is of no concern. However, when this value is “large”, the effect of ignoring discreteness leads to an exceded number of rejections of the distribution tested, as compared to what would be the number of rejections if no rounding is taking into account. The error made in the number of rejections might be huge.     

Stochastic equivalence of ranking methods

The asymptotic behavior of linear rank statistics for comparing the locations of two populations, where the observations are ranked jointly with other populations, is considered. Under certain conditions, the asymptotic behavior of these statistics does not depend on which other populations are included in the ranking. In particular, the difference of a pair of these statistics, with the same score function, but based on two different rankings, converges to zero in probability under Pitman alternatives and Chernoff-Savage conditions on the scores and underlying distributions.     

An identity for the joint distribution of order statistics and its applications

It is shown that the joint distribution function of several order statistics can be expressed in terms of the distribution functions of the maximum (or the minimum) order statistics of suitable subsamples. The result is used to derive explicit expressions for the expectations of functions of order statistics from certain families of distributions which include the exponential distribution and the power function distribution. The results generalize earlier work by the authors for a single order statistic.     

Two population classification in Gaussian process

The problem is to classify an individual into one of two populations based on an observation on the individual which follows a stationary Gaussian process and the populations are two distinct time points. Plug-in likelihood ratio rules are considered using samples from the process. The distribution of associated classification statistics are derived. For the special case when the mis-classification probabilities are equal, the nature of dependence between the population distributions on the probability of correct classification is studied. Lower bounds and iterative method of evaluation of the optimal correlation between the populations are obtained.     

Assessing a hypothesis test for the difference between two quantiles from independent populations

An empirical distribution function estimator for the difference of order statistics from two independent populations can be used for inference between quantiles from these populations. The inferential properties of the approach are evaluated in a simulation study where different sample sizes, theoretical distributions, and quantiles are studied. Small to moderate sample sizes, tail quantiles, and quantiles which do not coincide with the expectation of an order statistic are identified as problematic for appropriate Type I error control.     

Quasi-nonparametric upper tolerance regions based on the bootstrap

In this paper the upper tolerance problem for random samples will be investigated. Here we will be concerned with populations that are skewed to the right and possess a finite minimum (e.g. the Exponential distribution). The method developed here takes the form of a multiplicative factor times a quantile estimate. The multiplicative factor is simple in form and is based on bootstrapped quantiles of order statistics, though no resampling is required. The quantile estimate itself could be of any desired form; for example, it could be nonparametric, and, therefore based on order statistics as well. The proposed tolerance limit has the desirable property of allowing for the possibility of exceeding the sample maximum, and therefore capturing more probability content, while avoiding, in general, use of the extreme order statistics.     

The analysis of ratios and cross-product ratios of poisson variates with application to incidence rates

The incidence of most diseases is low enough that in. large populations the number of new cases may be considered a Poisson variate. This paper explores models and methods for analyzing such data Specific cases are the estimation and testing of ratios and the cross-product ratios, both simple and stratified* We assume the Poisson means are exponential functions of the relevant parameters. The resulting sets of sufficient statistics are partitioned into a test statistic and a vector of statistics related to the nuisance parameters . The methods derived are based on the conditional distribution of the test statistic given the other sufficient statistics. The analyses of stratified cross-product ratios are seen to be analogues of the noncentral distribution associated with theanalysis of the common odds ratio in several 2×2 tables. The various methods are illustrated in numerical examples involving incidence rates of cancer in two metropolitan areas adjusting for both age and sex.     

Rank statistics expressible as integrals under P–P-plots and receiver operating characteristic curves

Given a probability measure on the unit square, the measure of the region under an empirical P – P -plot defines a two-sample rank statistic. Instances include trimmed and censored versions of the Mann–Whitney–Wilcoxon statistic and a class of statistics with applications in the analysis of receiver operating characteristic (ROC) curves. A large sample distribution for such a statistic is obtained, which is valid under sampling from general populations. Explicit results are presented for comparing arbitrary quantile segments of two populations. The results are not restricted to continuous data and incorporate adjustments for tied values in the discrete case. A multivariate version of the large sample distribution extends the class of tractable statistics in ROC analysis and facilitates the use of methods based on partial areas when the data are discrete.     

Some Aspects of Probability of Correct Selections

In an experiment of treatment selections, random samples are drawn from k populations with ordered means. The probability that a sample statistic from the population with the highest mean turns out to be ranked the highest is referred to as the probability of correct selection (PCS). An inequality was proved previously that shows the monotonicity of PCS with respect to change in variance of the samples. In this article, we first present a more general form of the probability inequality to be used to investigate PCS. An extension of the monotonicity of PCS to order statistics is considered. We show that the PCS of the smallest order statistic preserves the monotonicity. Additionally, a normal approximation method is used to further generalize the theory. The general order statistics will not enjoy the same properties, as we reveal the obstacles, and a numerical counter example.     

Rényi statistics for testing equality of autocorrelation coefficients

The problem of testing for equality of autocorrelation coefficients of two populations in multivariate data when errors are autocorrelated is considered. We derive Rényi statistics defined as divergences between unrestricted and restricted estimated joint probability density functions and we show that they are asymptotically chi-square distributed under the null hypothesis of interest. Monte Carlo simulation experiments are carried out to investigate the behavior of Rényi statistics and to make comparisons with test statistics based on the approach of Bhandary [M. Bhandary, Test for equality of autocorrelation coefficients for two populations in multivariate data when the errors are autocorrelated, Statistics & Probability Letters 73 (2005) 333–342] for the problem under consideration. Rényi statistics showed to have significantly better behavior.     

The Marshall-Olkin Fréchet Distribution

We introduce a new distribution, namely Marshall–Olkin Fréchet distribution. The probability density and hazard rate functions are derived and their shape properties are considered. Expressions for the nth moments are given. Various results with respect to quantiles, Rényi entropy and order statistics are obtained. The unknown parameters of the new distribution are estimated using the maximum likelihood estimation method adopting three different iterative procedures. The model is applied on a real data set on survival times.

[Supplementary materials are available for this article. Go to the publisher's online edition of Communications in Statistics—Theory and Methods for the following free supplemental resource: A file that will allow the random variables from MOF distribution to be generated.]