LIMIT THEOREMS FOR ASYMPTOTICALLY MINIMAX ESTIMATION OF A DISTRIBUTION WITH INCREASING FAILURE RATE UNDER A RANDOM MIXED CENSORSHIP/TRUNCATION MODEL

ABSTRACT

The search for optimal non-parametric estimates of the cumulative distribution and hazard functions under order constraints inspired at least two earlier classic papers in mathematical statistics: those of Kiefer and Wolfowitz[1] Kiefer, J. and Wolfowitz, J. 1976. Asymptotically Minimax Estimation of Concave and Convex Distribution Functions. Z. Wahrsch. Verw. Gebiete, 34: 73–85. [Crossref], [Web of Science ®] , [Google Scholar] and Grenander[2] Grenander, U. 1956. On the Theory of Mortality Measurement. Part II. Scand. Aktuarietidskrift J., 39: 125–153.  [Google Scholar] respectively. In both cases, either the greatest convex minorant or the least concave majorant played a fundamental role. Based on Kiefer and Wolfowitz's work, Wang3-4 Wang, J.L. 1986. Asymptotically Minimax Estimators for Distributions with Increasing Failure Rate. Ann. Statist., 14: 1113–1131. Wang, J.L. 1987. Estimators of a Distribution Function with Increasing Failure Rate Average. J. Statist. Plann. Inference, 16: 415–427.   found asymptotically minimax estimates of the distribution function F and its cumulative hazard function Λ in the class of all increasing failure rate (IFR) and all increasing failure rate average (IFRA) distributions. In this paper, we will prove limit theorems which extend Wang's asymptotic results to the mixed censorship/truncation model as well as provide some other relevant results. The methods are illustrated on the Channing House data, originally analysed by Hyde.5-6 Hyde, J. 1977. Testing Survival Under Right Censoring and Left Truncation. Biometrika, 64: 225–230. Hyde, J. 1980. “Survival Analysis with Incomplete Observations”. In Biostatistics Casebook 31–46. New York: Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics.       

Four Correlation Coefficients with a Third Blocking Variable: Their Efficacy,Relative Efficiency,and Test Statistics

Abstract

The efficacy and the asymptotic relative efficiency (ARE) of a weighted sum of Kendall's taus, a weighted sum of Spearman's rhos, a weighted sum of Pearson's r's, and a weighted sum of z-transformation of the Fisher–Yates correlation coefficients, in the presence of a blocking variable, are discussed. The method of selecting the weighting constants that maximize the efficacy of these four correlation coefficients is proposed. The estimate, test statistics and confidence interval of the four correlation coefficients with weights are also developed. To compare the small-sample properties of the four tests, a simulation study is performed. The theoretical and simulated results all prefer the weighted sum of the Pearson correlation coefficients with the optimal weights, as well as the weighted sum of z-transformation of the Fisher–Yates correlation coefficients with the optimal weights.     

Third-Order Asymptotic Distributions of Classic Test Statistics for One-Parameter Exponential Family Models

ABSTRACT

In this article we derive third-order asymptotic expansions for the non null distribution functions of four classic statistics under a sequence of local alternatives in one-parameter exponential family models. Our results are quite general and cover a wide range of important distributions.     

SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

We study sojourn times of customers in a processor sharing queue with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace–Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is paid to the conditional mean sojourn time of a customer as a function of his required amount of work, and we establish the existence of an asymptote as the amount of work tends to infinity. The method of random time change is then extended to include the possibility of a varying service rate. By means of this method, we explain the well-established proportionality between the conditional mean sojourn time and required amount of work in processor sharing queues without random environment. Based on numerical experiments, we propose an approximation for the conditional mean sojourn time. Although first presented for exponentially distributed service requirements, the analysis is shown to extend to phase-type services. The service discipline of discriminatory processor sharing is also shown to fall within the framework.     

High-order extensions of the Double Chain Markov Model

The Double Chain Markov Model is a fully Markovian model for the representation of time-series in random environments. In this article, we show that it can handle transitions of high-order between both a set of observations and a set of hidden states. In order to reduce the number of parameters, each transition matrix can be replaced by a Mixture Transition Distribution model. We provide a complete derivation of the algorithms needed to compute the model. Three applications, the analysis of a sequence of DNA, the song of the wood pewee, and the behavior of young monkeys show that this model is of great interest for the representation of data that can be decomposed into a finite set of patterns.     

Approximating M/G/1 Waiting Time Tail Probabilities

Abstract

We propose a new approximation formula for the waiting time tail probability of the M/G/1 queue with FIFO discipline and unlimited waiting space. The aim is to address the difficulty of obtaining good estimates when the tail probability has non-exponential asymptotics. We show that the waiting time tail probability can be expressed in terms of the waiting time tail probability of a notional M/G/1 queue with truncated service time distribution plus the tail probability of an extreme order statistic. The Cramér–Lundberg approximation is applied to approximate the tail probability of the notional queue. In essence, our technique extends the applicability of the Cramér–Lundberg approximation to cases where the standard Lundberg condition does not hold. We propose a simple moment-based technique for estimating the parameters of the approximation; numerical results demonstrate that our approximation can yield very good estimates over the whole range of the argument.     

Homogeneity of Two Straight Lines: Equivalence Approach Using Fitted Regressions

The paper examines the homogeneity of a pair of straight lines, regarded as the expected values of two different linear regressions, from an equivalence point of view. This seems more appropriate than the usual testing of the null hypothesis of homogeneity when the aim is to establish that the lines are close to homogeneous. Upper confidence bounds on the maximum difference between the lines are based on the usual least squares regression estimators, assuming normal distributions. These bounds are constructed for fixed points, or over a fixed interval, and it is concluded that the lines are 1-homogeneous if the bounds are not greater than 1: Also, intervals are constructed over which the lines are concluded to be 1-homogeneous.     

Mixed integer (0–1) fractional programming for decision support in paper production industry

This paper presents an effective and efficient method for solving a special class of mixed integer fractional programming (FP) problems. We take a classical reformulation approach for continuous FP as a starting point and extend it for solving a more general class of mixed integer (0–1) fractional programming problems.To stress the practical relevance of the research we focus on a real-life application in paper production industry. The constantly advancing physical knowledge of large scale pulp and paper production did have a substantial impact on an existing DSS in which mixed integer (0–1) fractional programming is introduced. We show that the motivation to solve a real-life fractional programming problem can provide the basis for a new approach in a new context that has an added value of its own, even outside the given application area. We describe the main characteristics of the DSS, the necessity to develop a non-iterative solution procedure and demonstrate both the effectiveness and efficiency of the proposed approach from practical data sets.     

The exponential distribution analog of the Grubbs–Weaver method

Abstract

Grubbs and Weaver (1947 Grubbs, F. E., and C. L. Weaver. 1947. The best unbiased estimate of population standard deviation based on group ranges. Journal of the American Statistical Association 42 (238):224–41. doi: 10.2307/2280652.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) suggest a minimum-variance unbiased estimator for the population standard deviation of a normal random variable, where a random sample is drawn and a weighted sum of the ranges of subsamples is calculated. The optimal choice involves using as many subsamples of size eight as possible. They verified their results numerically for samples of size up to 100, and conjectured that their “rule of eights” is valid for all sample sizes. Here we examine the analogous problem where the underlying distribution is exponential and find that a “rule of fours” yields optimality and prove the result rigorously.