Lower bounds on the expectations of upper record values

For infinite sequences of independent random variables with identical continuous distributions, we establish optimal lower bounds on the deviations of the expectations of record values from population means in units generated by the central absolute moments of various orders. The bounds are non-negative for the classic record values, and non-positive for the other kth records with k?2. We also provide analogous bounds for the record increments.     

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.     

On bootstrapping the number of components in finite mixtures of Poisson distributions

Finite mixture models arise in a natural way in that they are modeling unobserved population heterogeneity. It is assumed that the population consists of an unknown number k of subpopulations with parameters λ₁, ..., λ_k receiving weights p₁, ..., p_k. Because of the irregularity of the parameter space, the log-likelihood-ratio statistic (LRS) does not have a (χ²) limit distribution and therefore it is difficult to use the LRS to test for the number of components. These problems are circumvented by using the nonparametric bootstrap such that the mixture algorithm is applied B times to bootstrap samples obtained from the original sample with replacement. The number of components k is obtained as the mode of the bootstrap distribution of k. This approach is presented using the Times newspaper data and investigated in a simulation study for mixtures of Poisson data.     

A generalized p-value approach to inference on the performance measures of an M/Ek/1 queueing system

Abstract

The hypothesis tests of performance measures for an M/E_k/1 queueing system are considered. With pivotal models deduced from sufficient statistics for the unknown parameters, a generalized p-value approach to derive tests about parametric functions are proposed. The focus is on derivation of the p-values of hypothesis testing for five popular performance measures of the system in the steady state. Given a sample T, let p(T) be the p values we developed. We derive a closed form expression to show that, for small samples, the probability P(p(T) ? γ) is approximately equal to γ, for 0 ? γ ? 1.     

Lower bound of average centered L2-discrepancy for U-type designs

Uniform designs are widely used in various scientific investigations and industrial applications. By considering all possible level permutation of the factors, a connection between average centered L₂-discrepancy and generalized wordlength pattern for asymmetrical fractional factorial designs is derived. Moreover, we present new lower bounds to the average centered L₂-discrepancy for symmetrical and asymmetrical U-type designs. For illustration of the theoretical results, the lower bounds for symmetrical and asymmetrical U-type designs are tabulated, and numerical results indicate that our lower bounds behave well and can be recommended for use in practice.     

Dependence Structure of Spacings of Order Statistics

Let X_1:n ≤ X_2:n ≤···≤ X_n:n denote the order statistics of a sample of n independent random variables X₁, X₂,…, X_n, all identically distributed as some X. It is shown that if X has a log-convex [log-concave] density function, then the general spacing vector (X_k1:n, X_k2:n ? X_k1:n,…, X_kr:n ? X_kr?1:n) is MTP₂ [S-MRR₂] whenever 1 ≤ k₁ < k₂ <···< k_r ≤ n and 1 ≤ r ≤ n. Multivariate likelihood ratio ordering of such general spacing vectors corresponding to two random samples is also considered. These extend some of the results in the literature for usual spacing vectors.     

Remarks on the L1 distance in statistical data analysis

We propose the L₁ distance between the distribution of a binned data sample and a probability distribution from which it is hypothetically drawn as a statistic for testing agreement between the data and a model. We study the distribution of this distance for N-element samples drawn from k bins of equal probability and derive asymptotic formulae for the mean and dispersion of L₁ in the large-N limit. We argue that the L₁ distance is asymptotically normally distributed, with the mean and dispersion being accurately reproduced by asymptotic formulae even for moderately large values of N and k.     

The mean general residual lifetime of (n − k + 1)-out-of-n systems with exchangeable components

The study of the reliability properties of (n ? k + 1)-out-of-n systems has gained a great deal of attention, from both theoretical and practical perspectives. In this article, we consider (n ? k + 1)-out-of-n systems with exchangeable components and study the stochastic properties of two forms of residual lifetimes of such systems under the following conditions: n ? r + 1 (r ? k) components of the system are operating at time t > 0, and/or the rth (r < k) component has failed, but the system is working at time t. In addition, some results relating to the functions of the mean general residual lifetimes (MGRL) are derived for these systems. Finally, in accordance with the generalized Farlie–Gumbel–Morgenstern model, we present the reliability properties of the general residual lifetime of (n ? k + 1)-out-of-n systems and investigate the asymptotic behavior of the proposed MGRL functions with exponential marginals.     

Asymptotic tail behavior of a random sum with conditionally dependent subexponential summands

In this paper, we obtain some results for the asymptotic behavior of the tail probability of a random sum S_τ = ∑^τ_{k = 1}X_k, where the summands X_k, k = 1, 2, …, are conditionally dependent random variables with a common subexponential distribution F, and the random number τ is a non negative integer-valued random variable, independent of {X_k: k ? 1}.     

Lower Bounds on the Symmetric L 2-Discrepancy and Their Application

The role of uniformity measured by the symmetric L ₂-discrepancy given in Hickernell (1998 Hickernell , F. J. (1998). A generalized discrepancy and quadrature error bound. Math. Computat. 67:299–322.[Crossref], [Web of Science ®] , [Google Scholar]) has been studied in fractional factorial designs. The issue of lower bounds on the symmetric L ₂-discrepancy is crucial in the construction of uniform designs. This article reports some new lower bounds on the symmetric L ₂-discrepancy for symmetric fractional factorials and for a set of asymmetric fractional factorials. It is valuable to use these lower bounds to measure uniformity of given designs.     

A lower bound for the centred L 2-discrepancy on combined designs under the asymmetric factorials

The foldover is a useful technique in the construction of two-level factorial designs for follow-up experiments. To search an optimal foldover plans is an important issue. In this paper, for a set of asymmetric fractional factorials such as the original designs, a lower bound for centred L ₂-discrepancy of combined designs under a general foldover plan is obtained, which can be used as a benchmark for searching optimal foldover plans. All of our results are the extended ones of Ou et al. [Lower bounds of various discrepancies on combined designs, Metrika 74 (2011), pp. 109–119] for symmetric designs to asymmetric designs. Moreover, it also provides a theoretical justification for optimal foldover plans in terms of uniformity criterion.     

Lower confidence bounds as precision measure for truncated processes

Process capability index C_p has been the most popular one used in the manufacturing industry to provide numerical measures on process precision. For normally distributed processes with automatic fully inspections, the inspected processes follow truncated normal distributions. In this article, we provide the formulae of moments used for the Edgeworth approximation on the precision measurement C_p for truncated normally distributed processes. Based on the developed moments, lower confidence bounds with various sample sizes and confidence levels are provided and tabulated. Consequently, practitioners can use lower confidence bounds to determine whether their manufacturing processes are capable of preset precision requirements.     

Estimation of system reliability

In this paper, we estimate the reliability of a system with k components. The system functions when at least s (1≤s≤k) components survive a common random stress. We assume that the strengths of these k components are subjected to a common stress which is independent of the strengths of these k components. If (X ₁,X ₂,…,X _k ) are strengths of k components subjected to a common stress (Y), then the reliability of the system or system reliability is given byR=P[Y<X _(k−s+1)] whereX _(k−s+1) is (k−s+1)-th order statistic of (X ₁,…,X _k ). We estimate R when (X ₁,…,X _k ) follow an absolutely continuous multivariate exponential (ACMVE) distribution of Hanagal (1993) which is the submodel of Block (1975) and Y follows an independent exponential distribution. We also obtain the asymptotic normal (AN) distribution of the proposed estimator.     

Principal points of univariate continuous distributions

The K principal points of a p-variate random variable X are defined as those points ₁,..., _K which minimize the expected squared distance of X from the nearest of the _k . This paper reviews some of the theory of principal points and presents a method of determining principal points of univariate continuous distributions. The method is applied to the uniform distribution, to the normal distribution and to the exponential distribution.     

SHOULD WE ESTIMATE THE PROBABILITY OF CORRECT SELECTION?

Various authors, given k location parameters, have considered lower confidence bounds on (standardized) dserences between the largest and each of the other k - 1 parameters. They have then used these bounds to put lower confidence bounds on the probability of correct selection (PCS) in the same experiment (as was used for finding the lower bounds on differences). It is pointed out that this is an inappropriate inference procedure. Moreover, if the PCS refers to some later experiment it is shown that if a non-trivial confidence bound is possible then it is already possible to conclude, with greater confidence, that correct selection has occurred in the first experiment. The short answer to the question in the title is therefore ‘No’, but this should be qualified in the case of a Bayesian analysis.     

Comparisons of the <Emphasis Type="Italic">r</Emphasis> − <Emphasis Type="Italic">k</Emphasis> class estimator to the ordinary least squares estimator under the Pitman’s closeness criterion

In the presence of multicollinearity, the r − k class estimator is proposed as an alternative to the ordinary least squares (OLS) estimator which is a general estimator including the ordinary ridge regression (ORR), the principal components regression (PCR) and the OLS estimators. Comparison of competing estimators of a parameter in the sense of mean square error (MSE) criterion is of central interest. An alternative criterion to the MSE criterion is the Pitman’s (1937) closeness (PC) criterion. In this paper, we compare the r − k class estimator to the OLS estimator in terms of PC criterion so that we can get the comparison of the ORR estimator to the OLS estimator under the PC criterion which was done by Mason et al. (1990) and also the comparison of the PCR estimator to the OLS estimator by means of the PC criterion which was done by Lin and Wei (2002).     

On the performance of L2E estimation in modelling heterogeneous count responses with extreme values

In healthcare studies, count data sets measured with covariates often exhibit heterogeneity and contain extreme values. To analyse such count data sets, we use a finite mixture of regression model framework and investigate a robust estimation approach, called the L₂E [D.W. Scott, On fitting and adapting of density estimates, Comput. Sci. Stat. 30 (1998), pp. 124–133], to estimate the parameters. The L₂E is based on an integrated L₂ distance between parametric conditional and true conditional mass functions. In addition to studying the theoretical properties of the L₂E estimator, we compare the performance of L₂E with the maximum likelihood (ML) estimator and a minimum Hellinger distance (MHD) estimator via Monte Carlo simulations for correctly specified and gross-error contaminated mixture of Poisson regression models. These show that the L₂E is a viable robust alternative to the ML and MHD estimators. More importantly, we use the L₂E to perform a comprehensive analysis of a Western Australia hospital inpatient obstetrical length of stay (LOS) (in days) data that contains extreme values. It is shown that the L₂E provides a two-component Poisson mixture regression fit to the LOS data which is better than those based on the ML and MHD estimators. The L₂E fit identifies admission type as a significant covariate that profiles the predominant subpopulation of normal-stayers as planned patients and the small subpopulation of long-stayers as emergency patients.     

Efficient sampling on the simplex with a self-adjusting logit transform proposal

A vector of k positive coordinates lies in the k-dimensional simplex when the sum of all coordinates in the vector is constrained to equal 1. Sampling distributions efficiently on the simplex can be difficult because of this constraint. This paper introduces a transformed logit-scale proposal for Markov Chain Monte Carlo that naturally adjusts step size based on the position in the simplex. This enables efficient sampling on the simplex even when the simplex is high dimensional and/or includes coordinates of differing orders of magnitude. Implementation of this method is shown with the SALTSampler R package and comparisons are made to other simpler sampling schemes to illustrate the improvement in performance this method provides. A simulation of a typical calibration problem also demonstrates the utility of this method.     

Statistical Discrimination Analysis Using the Maximum Function

The maximum of k functions defined on R ⁿ , n ≥ 1, by f _max (x) = max{f ₁ (x),…, f _k (x)}, ? x ? R ⁿ , can have important roles in Statistics, particularly in Classification. Through its relation with the Bayes error, which is the reference error in classification, it can serve to compute numerical bounds for errors in other classification schemes. It can also serve to define the joint L¹-distance between more than two densities, which, in turn, will serve as a useful tool in Classification and Cluster Analyses. It has a vast potential application in digital image processing too. Finally, its versatile role can be seen in several numerical examples, related to the analysis of Fisher's classical iris data in multidimensional spaces.