The Recursive Kernel Distribution Function Estimator Based on Negatively and Positively Associated Sequences

Let {X _j , j ≥ 1} be a strictly stationary negatively or positively associated sequence of real valued random variables with unknown distribution function F(x). On the basis of the random variables {X _j , j ≥ 1}, we propose a smooth recursive kernel-type estimate of F(x), and study asymptotic bias, quadratic-mean consistency and asymptotic normality of the recursive kernel-type estimator under suitable conditions.     

A Fast Wavelet Algorithm for Analyzing One-Dimensional Signal Processing and Asymptotic Distribution of Wavelet Coefficients With Numerical Example and Simulation

In this article, we consider a sample point (t _j , s _j ) including a value s _j  = f(t _j ) at height s _j and abscissa (time or location) t _j . We apply wavelet decomposition by using shifts and dilations of the basic Häar transform and obtain an algorithm to analyze a signal or function f. We use this algorithm in practical to approximating function by numerical example. Some relationships between wavelets coefficients and asymptotic distribution of wavelet coefficients are investigated. At the end, we illustrate the results on simulated data by using MATLAB and R software.     

A One Sided Test Based on Sample Quasi Ranges

Abstract

Let the data from the ith treatment/population follow a distribution with cumulative distribution function (cdf) F _i (x) = F[(x ? μ _i )/θ _i ], i = 1,…, k (k ≥ 2). Here μ _i (?∞ < μ _i  < ∞) is the location parameter, θ _i (θ _i  > 0) is the scale parameter and F(?) is any absolutely continuous cdf, i.e., F _i (?) is a member of location-scale family, i = 1,…, k. In this paper, we propose a class of tests to test the null hypothesis H ₀ ? θ₁ = · = θ _k against the simple ordered alternative H _A  ? θ₁ ≤ · ≤ θ _k with at least one strict inequality. In literature, use of sample quasi range as a measure of dispersion has been advocated for small sample size or sample contaminated by outliers [see David, H. A. (1981). Order Statistics. 2nd ed. New York: John Wiley, Sec. 7.4]. Let X _i1,…, X _in be a random sample of size n from the population π _i and R _ir  = X _i:n?r  ? X _i:r+1, r = 0, 1,…, [n/2] ? 1 be the sample quasi range corresponding to this random sample, where X _i:j represents the jth order statistic in the ith sample, j = 1,…, n; i = 1,…, k and [x] is the greatest integer less than or equal to x. The proposed class of tests, for the general location scale setup, is based on the statistic W _r  = max_1≤i<j≤k (R _jr /R _ir ). The test is reject H ₀ for large values of W _r . The construction of a three-decision procedure and simultaneous one-sided lower confidence bounds for the ratios, θ _j /θ _i , 1 ≤ i < j ≤ k, have also been discussed with the help of the critical constants of the test statistic W _r . Applications of the proposed class of tests to two parameter exponential and uniform probability models have been discussed separately with necessary tables. Comparisons of some members of our class with the tests of Gill and Dhawan [Gill A. N., Dhawan A. K. (1999). A One-sided test for testing homogeneity of scale parameters against ordered alternative. Commun. Stat. – Theory and Methods 28(10):2417–2439] and Kochar and Gupta [Kochar, S. C., Gupta, R. P. (1985). A class of distribution-free tests for testing homogeneity of variances against ordered alternatives. In: Dykstra, R. et al., ed. Proceedings of the Conference on Advances in Order Restricted Statistical Inference at Iowa city. Springer Verlag, pp. 169–183], in terms of simulated power, are also presented.     

Adjusted Confidence Bands in Nonparametric Regression

Suppose we have {(x _i , y _i )} i = 1, 2,…, n, a sequence of independent observations. We wish to find approximate 1 ? α simultaneous confidence bands for the regression curve. Many previous confidence bands in the literature have practical difficulties. In this article, the local linear smoother is used to estimate the regression curve. The bias of the estimator is considered. Different methods of constructing confidence bands are discussed. Finally, a possible method incorporating logistic regression in an innovative way is proposed to construct the bands for random designs. Simulations are used to study the performance or properties of the methods. The procedure for constructing confidence bands is entirely data-driven. The advantage of the proposed method is that it is simple to use and can be applied to random designs. It can be considered as a practically useful and efficient method.     

Markov-modulated infinite-server queues driven by a common background process

This paper studies a system with multiple infinite-server queues that are modulated by a common background process. If this background process, being modeled as a finite-state continuous-time Markov chain, is in state j, then the arrival rate into the i-th queue is λ_{i, j}, whereas the service times of customers present in this queue are exponentially distributed with mean μ^{? 1}_{i, j}; at each of the individual queues all customers present are served in parallel (thus reflecting their infinite-server nature).

Three types of results are presented: in the first place (i) we derive differential equations for the probability-generating functions corresponding to the distributions of the transient and stationary numbers of customers (jointly in all queues), then (ii) we set up recursions for the (joint) moments, and finally (iii) we establish a central limit theorem in the asymptotic regime in which the arrival rates as well as the transition rates of the background process are simultaneously growing large.     

Constants on a Uniform Berry-Esseen Bound on Some Borel Sets in ℝ k via Stein's Method

For each n, k ∈ ?, let Y _i  = (Y _i1, Y _i2,…, Y _ik ), 1 ≤ i ≤ n be independent random vectors in ? ^k with finite third moments and Y _ij are independent for all j = 1, 2,…, k. In this article, we use the Stein's technique to find constants in uniform bounds for multidimensional Berry-Esseen inequality on a closed sphere, a half plane and a rectangular set.     

Computation of the stationary distribution of a markov chain

Eight algorithms are considered for the computation of the stationary distribution l´ of a finite Markov chain with associated probability transition matrix P. The recommended algorithm is based on solving l´(I—P+eú)=ú, where e is the column vector of ones and u´ is a row vector satisfying u´e ≠0.An error analysis is presented for any such u including the choices ú= e_jP and ú=e´_j where é_j is the jth row of the identity matrix. Computationalcomparisons between five of the algorithms are made based on twenty 8 x 8, twenty 20 x 20, and twenty 40 x 40 transition matrices. The matrix (I—P+eú)^?1 is shown to be a non-singular generalized inverse of I—P when the unit root of P is simple and úe ≠ 0. A simple closed form expression is obtained for the Moore-Penrose inverse of I—P whenI—P has nullity one     

A Subset Selection Procedure for Selecting the Exponential Population Having the Longest Mean Lifetime When the Guarantee Times are the Same

ABSTRACT

Consider k(≥ 2) independent exponential populations Π₁, Π₂, …, Π _k , having the common unknown location parameter μ ∈ (?∞, ∞) (also called the guarantee time) and unknown scale parameters σ₁, σ₂, …σ _k , respectively (also called the remaining mean lifetimes after the completion of guarantee times), σ _i  > 0, i = 1, 2, …, k. Assume that the correct ordering between σ₁, σ₂, …, σ _k is not known apriori and let σ_[i], i = 1, 2, …, k, denote the ith smallest of σ _j s, so that σ_[1] ≤ σ_[2] ··· ≤ σ_[k]. Then Θ _i  = μ + σ _i is the mean lifetime of Π _i , i = 1, 2, …, k. Let Θ_[1] ≤ Θ_[2] ··· ≤ Θ_[k] denote the ranked values of the Θ _j s, so that Θ_[i] = μ + σ_[i], i = 1, 2, …, k, and let Π_(i) denote the unknown population associated with the ith smallest mean lifetime Θ_[i] = μ + σ_[i], i = 1, 2, …, k. Based on independent random samples from the k populations, we propose a selection procedure for the goal of selecting the population having the longest mean lifetime Θ_[k] (called the “best” population), under the subset selection formulation. Tables for the implementation of the proposed selection procedure are provided. It is established that the proposed subset selection procedure is monotone for a general k (≥ 2). For k = 2, we consider the loss measured by the size of the selected subset and establish that the proposed subset selection procedure is minimax among selection procedures that satisfy a certain probability requirement (called the P*-condition) for the inclusion of the best population in the selected subset.     

Computing first-order sensitivity indices with contribution to the sample mean plot

In this paper, we investigate the use of the contribution to the sample mean plot (CSM plot) as a graphical tool for sensitivity analysis (SA) of computational models. We first provide an exact formula that links, for each uncertain model input X_j, the CSM plot C_j(·) with the first-order variance-based sensitivity index S_j. We then build a new estimate for S_j using polynomial regression of the CSM plot. This estimation procedure allows the computation of S_j from given data, without any SA-specific design of experiment. Numerical results show that this new S_j estimate is efficient for large sample sizes, but that at small sample sizes it does not compare well with other S_j estimation techniques based on given data, such as the effective algorithm for computing global sensitivity indices method or metamodel-based approaches.     

Stochastic Comparisons and Dependence of Spacings from Two Samples of Exponential Random Variables

Let X ₁,X ₂,…,X _n be independent exponential random variables such that X _i has hazard rate λ for i = 1,…,p and X _j has hazard rate λ* for j = p + 1,…,n, where 1 ≤ p < n. Denote by D _i:n (λ, λ*) = X _i:n  ? X _i?1:n the ith spacing of the order statistics X _1:n  ≤ X _2:n  ≤ ··· ≤ X _n:n , i = 1,…,n, where X _0:n ≡ 0. It is shown that the spacings (D _1,n ,D _2,n ,…,D _n:n ) are MTP₂, strengthening one result of Khaledi and Kochar (2000), and that (D _1:n (λ₂, λ*),…,D _n:n (λ₂, λ*)) ≤ _lr (D _1:n (λ₁, λ*),…,D _n:n (λ₁, λ*)) for λ₁ ≤ λ* ≤ λ₂, where ≤ _lr denotes the multivariate likelihood ratio order. A counterexample is also given to show that this comparison result is in general not true for λ* < λ₁ < λ₂.     

Nearly Gaussian Distributions and Application

We consider the random variable X that is not Gaussian but for which X ^c , where c = (2k + 1)/(2j + 1) with k, j ? {0, 1,…}, is approximately Gaussian. A variable of this type is used to model the errors made by meteorologists when forecasting temperatures.     

Some New Results on Likelihood Ratio Orderings for Spacings of Heterogeneous Exponential Random Variables

Let X ₁, X ₂,…, X _n be independent exponential random variables with X _i having failure rate λ _i for i = 1,…, n. Denote by D _i:n  = X _i:n  ? X _i?1:n the ith spacing of the order statistics X _1:n  ≤ X _2:n  ≤ ··· ≤ X _n:n , i = 1,…, n, where X _0:n ≡ 0. It is shown that if λ _n+1 ≤ [≥] λ _k for k = 1,…, n then D _n:n  ≤ _lr D _n+1:n+1 and D _1:n  ≤ _lr D _2:n+1 [D _2:n+1 ≤ _lr D _2:n ], and that if λ _i  + λ _j  ≥ λ _k for all distinct i,j, and k then D _n?1:n  ≤ _lr D _n:n and D _n:n+1 ≤ _lr D _n:n , where ≤ _lr denotes the likelihood ratio order. We also prove that D _1:n  ≤ _lr D _2:n for n ≥ 2 and D _2:3 ≤ _lr D _3:3 for all λ _i 's.     

The Likelihood Ratio Test with the Box–Cox Transformation for the Normal Mixture Problem: Power and Sample Size Study

Abstract

Through simulation and regression, we study the alternative distribution of the likelihood ratio test in which the null hypothesis postulates that the data are from a normal distribution after a restricted Box–Cox transformation and the alternative hypothesis postulates that they are from a mixture of two normals after a restricted (possibly different) Box–Cox transformation. The number of observations in the sample is called N. The standardized distance between components (after transformation) is D = (μ₂ ? μ₁)/σ, where μ₁ and μ₂ are the component means and σ² is their common variance. One component contains the fraction π of observed, and the other 1 ? π. The simulation results demonstrate a dependence of power on the mixing proportion, with power decreasing as the mixing proportion differs from 0.5. The alternative distribution appears to be a non-central chi-squared with approximately 2.48 + 10N ^?0.75 degrees of freedom and non-centrality parameter 0.174N(D ? 1.4)² × [π(1 ? π)]. At least 900 observations are needed to have power 95% for a 5% test when D = 2. For fixed values of D, power, and significance level, substantially more observations are necessary when π ≥ 0.90 or π ≤ 0.10. We give the estimated powers for the alternatives studied and a table of sample sizes needed for 50%, 80%, 90%, and 95% power.     

Minimum-Distance Estimator for Stable Exponent

Assume that X ₁, X ₂,…, X _n is a sequence of i.i.d. random variables with α-stable distribution (α ∈ (0,2], the stable exponent, is the unknown parameter). We construct minimum distance estimators for α by minimizing the Kolmogorov distance or the Cramér–von-Mises distance between the empirical distribution function G _n , and a class of distributions defined based on the sum-preserving property of stable random variables. The minimum distance estimators can also be obtained by minimizing a U-statistic estimate of an empirical distribution function involving the stable exponent. They share the same invariance property with the maximum likelihood estimates. In this article, we prove the strong consistency of the minimum distance estimators. We prove the asymptotic normality of our estimators. Simulation study shows that the new estimators are competitive to the existing ones and perform very closely even to the maximum likelihood estimator.     

A Property of Count Distributions in the Hinde–Demétrio Family

The Hinde–Demétrio (HD) family of distributions, which are discrete exponential dispersion models with an additional real index parameter p, have been recently characterized from the unit variance function μ + μ ^p . For p equals to 2, 3,…, the corresponding distributions are concentrated on non negative integers, overdispersed and zero-inflated with respect to a Poisson distribution having the same mean. The negative binomial (p = 2) and strict arcsine (p = 3) distributions are HD families; the limit case (p → ∞) is associated to a suitable Poisson distribution. Apart from these count distributions, none of the HD distributions has explicit probability mass functions p _k . This article shows that the ratios r _k  = k p _k /p _k?1, k = 1,…, p ? 1, are equal and different from r _p . This new property allows, for a given count data set, to determine the integer p by some tests. The extreme situation of p = 2 is of general interest for count data. Some examples are used for illustrations and discussions.     

The one-way analysis of variance with ordered alternatives: A modification of bartholomew's Ē2 Test

Tests of homogeneity of normal means with the alternative restricted by an ordering on the means are considered. The simply ordered case, μ₁ ≤ μ₂ ≤ ··· ≤ μ_k, and the simple tree ordering, μ₁ ≤ μ_j, for; j= 2, 3,…, k, are emphasized. A modification of the likelihood-ratio test is proposed which is asymptotically equivalent to it but is more robust to violations of the hypothesized orderings. The new test has power at the points satisfying the hypothesized ordering which is similar to that of the likelihood-ratio test provided the degrees of freedom are not too small. The modified test is shown to be unbiased and consistent.     

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.