Bounds for Expectations of Differences of Generalized Order Statistics Based on General and Life Distributions

Let X _? ^(r), r ≥ 1, denote generalized order statistics based on an arbitrary distribution function F with finite pth absolute moment for some 1 ≤ p ≤ ∞. We present sharp upper bounds on E(X _? ^(s) ? X _? ^(r)), 1 ≤ r < s, for F being either general or life distribution. The bounds are expressed in various scale units generated by pth central absolute or raw moments of F, respectively. The distributions achieving the bounds are specified.     

A general non-central hypergeometric distribution

We construct a general non-central hypergeometric distribution, which models biased sampling without replacement. Our distribution is constructed from the combined order statistics of two samples: one of independent and identically distributed random variables with absolutely continuous distribution F and the other of independent and identically distributed random variables with absolutely continuous distribution G. The distribution depends on F and G only through F○G^{( ? 1)} (F composed with the quantile function of G), and the standard hypergeometric distribution and Wallenius’ non-central hypergeometric distribution arise as special cases. We show in efficient economic markets the quantity traded has a general non-central hypergeometric distribution.     

Attainability of the Upper Bounds for the Mean Past Lifetime of Parallel System Components

Among reliability systems, one of the basic systems is a parallel system. In this article, we consider a parallel system consisting of n identical components with independent lifetimes having a common distribution function F. Under the condition that the system has failed by time t, with t being 100pth percentile of F(t = F ^?1(p), 0 < p < 1), we characterize the probability distributions based on the mean past lifetime of the components of the system. These distributions are described in the form of a specific shape on the left of t and arbitrary continuous function on the right tail.     

A modified kernel quantile estimator under censoring

Based on right-censored data from a lifetime distribution F₀, a modification of the kernel quantile estimator is proposed. The advantage of this estimator is that the data play a role in the degree of smoothing of the estimator while retaining the desirable features of the kernel estimator. Convergence in probability and almost sure convergence of the estimator are discussed. Also, asymptotic normality and confidence bands are presented and some examples are given.     

Exponential stability of stochastic cellular neural networks with mixed delays

In this paper, almost sure exponential stability and pth moment exponential stability of stochastic cellular neural networks with mixed delays are investigated. Employing the methods of stochastic analysis, the Lyapunov’s method, and useful inequality techniques, a sufficient condition ensuring the almost sure exponential stability and pth moment exponential stability is obtained. Two examples are given to illustrate this sufficient condition.     

The asymptotic behavior of monotone percentile regression estimates

The least-absolute-deviation estimate of a monotone regression function on an interval has been studied in the literature. If the observation points become dense in the interval, the almost sure rate of convergence has been shown to be O(n^1/4). Applying the techniques used by Brunk (1970, Nonparametric, Techniques in Statistical Inference. Cambridge Univ. Press), the asymptotic distribution of the l₁ estimator at a point is obtained. If the underlying regression function has positive slope at the point, the rate of convergence is seen to be O(n^1/3). Monotone percentile regression estimates are also considered.     

On testing more IFRA ordering-II

ABSTRACT

Suppose F and G are two life distribution functions. It is said that F is more IFRA (increasing failure rate average) than G (written by F ? _*G) if G^{? 1}F(x) is star-shaped on (0, ∞). In this paper, the problem of testing H₀: F = _*G against H₁: F ? _*G and F ≠ _*G is considered in both cases when G is known and when G is unknown. We propose a new test based on U-statistics and obtain the asymptotic distribution of the test statistics. The new test is compared with some well-known tests in the literature. In addition, we apply our test to a real data set in the context of reliability.     

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 ?}.     

Multiplicative Algorithms for Maximum Penalized Likelihood Inversion with Non Negative Constraints and Generalized Error Distributions

In many linear inverse problems the unknown function f (or its discrete approximation Θ _p×1), which needs to be reconstructed, is subject to the non negative constraint(s); we call these problems the non negative linear inverse problems (NNLIPs). This article considers NNLIPs. However, the error distribution is not confined to the traditional Gaussian or Poisson distributions. We adopt the exponential family of distributions where Gaussian and Poisson are special cases. We search for the non negative maximum penalized likelihood (NNMPL) estimate of Θ. The size of Θ often prohibits direct implementation of the traditional methods for constrained optimization. Given that the measurements and point-spread-function (PSF) values are all non negative, we propose a simple multiplicative iterative algorithm. We show that if there is no penalty, then this algorithm is almost sure to converge; otherwise a relaxation or line search is necessitated to assure its convergence.     

The geometrical interpretation of statistical tests in multivariate linear regression

A geometrical interpretation of the classical tests of the relation between two sets of variables is presented. One of the variable sets may be considered as fixed and then we have a multivariate regression model. When the Wilks’ lambda distribution is viewed geometrically it is obvious that the two special cases, theF distribution and the HotellingT ² distribution are equivalent. From the geometrical perspective it is also obvious that the test statistic and thep-value are unchanged if the responses and the predictors are interchanged.     

THE MULTIPLE CORRELATION COEFFICIENT AND FISHER'S A STATISTIC1

Fisher's A statistic, often called the adjusted R² statistic, is shown to be a close approximation to the maximum likelihood estimate of the multiple correlation coefficient, p², based on the marginal distribution of R². Expansions for the estimate are obtained. The same methods lead to maximum marginal likelihood estimators for the noncentrality parameters for noncentral X² and F.     

Precedence tests and Lehmann alternatives

G = F ^k (k > 1); G = 1 − (1−F) ^k (k < 1); G = F ^k (k < 1); and G = 1 − (1−F) ^k (k > 1), where F and G are two continuous cumulative distribution functions. If an optimal precedence test (one with the maximal power) is determined for one of these four classes, the optimal tests for the other classes of alternatives can be derived. Application of this is given using the results of Lin and Sukhatme (1992) who derived the best precedence test for testing the null hypothesis that the lifetimes of two types of items on test have the same distibution. The test has maximum power for fixed κ in the class of alternatives G = 1 − (1−F) ^k , with k < 1. Best precedence tests for the other three classes of Lehmann-type alternatives are derived using their results. Finally, a comparison of precedence tests with Wilcoxon's two-sample test is presented. Received: February 22, 1999; revised version: June 7, 2000     

Phase I monitoring of generalized linear model-based regression profiles

In some industrial applications, the quality of a process or product is characterized by a relationship between the response variable and one or more independent variables which is called as profile. There are many approaches for monitoring different types of profiles in the literature. Most researchers assume that the response variable follows a normal distribution. However, this assumption may be violated in many cases. The most likely situation is when the response variable follows a distribution from generalized linear models (GLMs). For example, when the response variable is the number of defects in a certain area of a product, the observations follow Poisson distribution and ignoring this fact will cause misleading results. In this paper, three methods including a T²-based method, likelihood ratio test (LRT) method and F method are developed and modified in order to be applied in monitoring GLM regression profiles in Phase I. The performance of the proposed methods is analysed and compared for the special case that the response variable follows Poisson distribution. A simulation study is done regarding the probability of the signal criterion. Results show that the LRT method performs better than two other methods and the F method performs better than the T²-based method in detecting either small or large step shifts as well as drifts. Moreover, the F method performs better than the other two methods, and the LRT method performs poor in comparison with the F and T²-based methods in detecting outliers. A real case, in which the size and number of agglomerates ejected from a volcano in successive days form the GLM profile, is illustrated and the proposed methods are applied to determine whether the number of agglomerates of each size is under statistical control or not. Results showed that the proposed methods could handle the mentioned situation and distinguish the out-of-control conditions.     

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.     

SELECTION PROCEDURES FOR SCALE PARAMETERS USING TWO-SAMPLE U-STATISTICS

Let be k independent populations having the same known quantile of order p (0 p 1) and let F(x)=F(x/_i) be the absolutely continuous cumulative distribution function of the ith population indexed by the scale parameter ₁, i = 1,…, k. We propose subset selection procedures based on two-sample U-statistics for selecting a subset of k populations containing the one associated with the smallest scale parameter. These procedures are compared with the subset selection procedures based on two-sample linear rank statistics given by Gill & Mehta (1989) in the sense of Pitman asymptotic relative efficiency, with interesting results.     

A note on simplicial depth function

We investigate the behaviour of simplicial depth under the perturbation (1−ε)F+ε δ _z , where F is a p-dimensional probability distribution and δ _z is the point-mass distribution concentrated at the point z. The influence function of simplicial depth at the point x, up to a scalar multiplier, turns out to be the difference between the conditional depth, given that one of the vertices of the random simplex is fixed at the position z, and the unconditional depth. The scalar multiplier is p+1, which suggests that simplicial depth can be more sensitive to perturbations as the dimensionality grows higher. The geometrical properties of the influence function give new insight into the observed behaviour of simplicial depth and its relation with halfspace depth. The behaviour of the perturbed simplicial median is also investigated.     

A note on LeCam’s bound for the distance between the Poisson binomial and the Poisson distribution

n possibly different success probabilities p ₁, p ₂, ..., p _n is frequently approximated by a Poisson distribution with parameter λ = p ₁ + p ₂ + ... + p _n . LeCam's bound p ² ₁ + p ² ₂ + ... + p _n ² for the total variation distance between both distributions is particularly useful provided the success probabilities are small. The paper presents an improved version of LeCam's bound if a generalized d-dimensional Poisson binomial distribution is to be approximated by a compound Poisson distribution. Received: May 10, 2000; revised version: January 15, 2001     

Changepoint Problems Under Random Censorship

Let X ₁, …, X _[nθ], X _{[nθ] + 1}, …, X _n be a sequence of independent random variables (the “lifetimes”) such that X _j ? F ₁ for 1 ≤ j ≤ [nθ] and X _j ? F ₂ for [nθ] + 1 ≤ j ≤ n, with F ₁ ≠ F ₂ unknown. In this paper we investigate an estimator θ _n for the changepoint θ if the X's are subject to censoring. The rate of almost sure convergence of θ _n to θ is established and a test for the hypothesis θ = 0, i.e. “no change”, is proposed.     

Estimators of shift based on statistics of the Kolmogorov-Smirnov type

This paper is concerned with the estimation of a shift parameter δ_o, based on some nonnegative functional Hg₁ of the pair (D^δ_N(x), f?^δ_N(x)), where D^δ_N(x) = K_N/b {F_2,n(x)—F_1,m (x + δ)}, +^δ_N(x) = {mF_1,m (x + δ) + nF_2,n(x)}/N, where F_1,m and F_2,n are the empirical distribution functions of two independent random samples (N = m + n), and where K²_N = mn/N. First an estimator δ_N, is defined as a value of δ minimizing a functional H of the type of H₁. A second estimator δ¹_N is also defined which is a linearized version of the first. Finite and asymptotic properties of these estimators are considered. It is also shown that most well-known test statistics of the Kolmogorov-Smirnov type are particular cases of such functionals H₁. The asymptotic distribution and the asymptotic efficiency of some estimators are given.