M-Estimators of Scale with Minimum Gross Errors Sensitivity

The median absolute deviation (MAD) is known to be the M-estimator of scale with minimum gross errors sensitivity (GES) when the error distribution is known to be symmetric and strongly unimodal. The problem considered here is to find the Fisher consistent M-estimator with minimum GES when the error distribution is symmetric but not necessarily unimodal. Under some general conditions, the score function χ corresponding to the minimizing M-estimator has the form χ(x) = ?1 when |x| < a; χ(x) = c when a < |x| < b; χ(x) = 1 when |x| > b. An example is given in which the M-estimator with minimum GES does not correspond to the MAD.     

Estimation and testing stationarity for double-autoregressive models

Summary.  The paper considers the double-autoregressive model y _t  =  φ y _{t −1}+ ɛ _t with ɛ _t  =     . Consistency and asymptotic normality of the estimated parameters are proved under the condition E  ln | φ  +√ α η _t |<0, which includes the cases with | φ |=1 or | φ |>1 as well as     . It is well known that all kinds of estimators of φ in these cases are not normal when ɛ _t are independent and identically distributed. Our result is novel and surprising. Two tests are proposed for testing stationarity of the model and their asymptotic distributions are shown to be a function of bivariate Brownian motions. Critical values of the tests are tabulated and some simulation results are reported. An application to the US 90-day treasury bill rate series is given.     

Nonparametric recursive estimation in stationary markov processes

This paper deals with a class of recursive kernel estimators of the transition probability density function t(y|x) of a stationary Markov process. A sufficient condition for such estimators to be weakly and strongly 2 consistent for almost all (x,y)∈R² is given. Further an L, convergence result is obtained. No continuity conditions are imposed on t(y|x).     

On the invertibility of EGARCH(p,q)

Of the two most widely estimated univariate asymmetric conditional volatility models, the exponential GARCH (or EGARCH) specification is said to be able to capture asymmetry, which refers to the different effects on conditional volatility of positive and negative effects of equal magnitude, and leverage, which refers to the negative correlation between the returns shocks and subsequent shocks to volatility. However, the statistical properties of the (quasi-)maximum likelihood estimator (QMLE) of the EGARCH(p, q) parameters are not available under general conditions, but only for special cases under highly restrictive and unverifiable sufficient conditions, such as EGARCH(1,0) or EGARCH(1,1), and possibly only under simulation. A limitation in the development of asymptotic properties of the QMLE for the EGARCH(p, q) model is the lack of an invertibility condition for the returns shocks underlying the model. It is shown in this article that the EGARCH(p, q) model can be derived from a stochastic process, for which sufficient invertibility conditions can be stated simply and explicitly when the parameters respect a simple condition.¹¹Using the notation introduced in part 2, this refers to the cases where α ≥ |γ| or α ≤ ? |γ|. The first inequality is generally assumed in the literature related to the invertibility of EGARCH. This article provides (in the Appendix) an argument for the possible lack of invertibility when these conditions are not met. This will be useful in reinterpreting the existing properties of the QMLE of the EGARCH(p, q) parameters.     

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 NEW APPROXIMATION FOR FISHER'S Z

As the sample size increases, the coefficient of skewness of the Fisher's transformation z= tanh^-1r, of the correlation coefficient decreases much more rapidly than the excess of its kurtosis. Hence, the distribution of standardized z can be approximated more accurately in terms of the t distribution with matching kurtosis than by the unit normal distribution. This t distribution can, in turn be subjected to Wallace's approximation resulting in a new normal approximation for the Fisher's z transform. This approximation, which can be used to estimate the probabilities, as well as the percentiles, compares favorably in both accuracy and simplicity, with the two best earlier approximations, namely, those due to Ruben (1966) and Kraemer (1974). Fisher (1921) suggested approximating distribution of the variance stabilizing transform z=(1/2) log ((1 +r)/(1r)) of the correlation coefficient r by the normal distribution with mean = (1/2) log ((1 + p)/(lp)) and variance =l/(n3). This approximation is generally recognized as being remarkably accurate when ||Gr| is moderate but not so accurate when ||Gr| is large, even when n is not small (David (1938)). Among various alternatives to Fisher's approximation, the normalizing transformation due to Ruben (1966) and a t approximation due to Kraemer (1973), are interesting on the grounds of novelty, accuracy and/or aesthetics. If r?= r/√ (1r²) and r?|Gr = |Gr/√(1|Gr²), then Ruben (1966) showed that (1) g_n (r,|Gr) ={(2n5)/2}^1/2r?r{(2n3)/2}^1/2r?|GR, {1 + (1/2)(r?r²+r?|Gr²)}^1/2 is approximately unit normal. Kraemer (1973) suggests approximating (2) t_n (r, |Gr) = (r|GR¹) √ (n2), √(11r²) √(1|Gr²) by a Student's t variable with (n2) degrees of freedom, where after considering various valid choices for |Gr¹ she recommends taking |Gr¹= |Gr*, the median of r given n and |Gr.     

A New Type of Discrete Self-Decomposability and Its Application to Continuous-Time Markov Processes for Modeling Count Data Time Series

We propose a family of extended thinning operators, indexed by a parameter γ in [0, 1), with the boundary case of γ=0 corresponding to the well-known binomial thinning operator. The extended thinning operators can be used to construct a class of continuous-time Markov processes for modeling count time series data. The class of stationary distributions of these processes is called generalized discrete self-decomposable, denoted by DSD (γ). We obtain characterization results for the DSD (γ) class and investigate relationships among the classes for different γ's.     

On the Exponential Decay Rate of the Tail of a Discrete Probability Distribution

Abstract

We give a sufficient condition for the exponential decay of the tail of a discrete probability distribution π = (π _n ) _n≥0 in the sense that lim _n→∞(1/n) log∑ _i>n π _i  = ?θ with 0 < θ < ∞. We focus on analytic properties of the probability generating function of a discrete probability distribution, especially, the radius of convergence and the number of poles on the circle of convergence. Furthermore, we give an example of an M/G/1 type Markov chain such that the tail of its stationary distribution does not decay exponentially.     

On comparing two poisson intensity functions

Given realizations of two possion processes with unknown intensities A(·) and F(·) observed over the interval (t₁,t₂), we suppose that it is desired to distinution between H₀ Ξ(·)/λ(·) is constant on (t₁,t₂) versus H₊:Ξ(·)/λ(·) increases on (t₁,t₂). We propose a decision rule which uses the percentage points of the Mann-Whitney U-distribution. We show that the decision rule is unbiased and that the set of alternatives in H₊ can be weakly ordered, specifically: if Ξ(·)/λ(·), β(·)/λ(·) and Ξ(·)/β(·) are increasing on (t₁, t₂) then P{H₀ is rejected |Ξ(·)}≧P{H₀ is rejected|B(·)}≧P{H₀ is rejected|H₀}.     

A MAP/G/1 Queue with an Underlying Birth–Death Process

Abstract

In this paper, we define a birth–death‐modulated Markovian arrival process (BDMMAP) as a Markovian arrival process (MAP) with an underlying birth–death process. It is proved that the zeros of det(zI ? A(z)) in the unit disk are real and simple. In order to analyze a BDMMAP/G/1 queue, two spectral methods are proposed. The first one is a bisection method for calculation of the zeros from which the boundary vector is derived. The second one is the Fourier inversion transform of the probability generating function for the calculation of the stationary probability distribution of the queue length. Eigenvalues required in this calculation are obtained by the Duran–Kerner–Aberth (DKA) method. For numerical examples, the stationary probability distribution of the queue length is calculated by using the spectral methods. Comparisons of the spectral methods with the currently best methods available are discussed.     

Operating Characteristics for Group Sequential Trials Monitored Under Fractional Brownian Motion

Brownian motion has been used to derive stopping boundaries for group sequential trials, however, when we observe dependent increment in the data, fractional Brownian motion is an alternative to be considered to model such data. In this article we compared expected sample sizes and stopping times for different stopping boundaries based on the power family alpha spending function under various values of Hurst coefficient. Results showed that the expected sample sizes and stopping times will decrease and power increases when the Hurst coefficient increases. With same Hurst coefficient, the closer the boundaries are to that of O'Brien-Fleming, the higher the expected sample sizes and stopping times are; however, power has a decreasing trend for values start from H = 0.6 (early analysis), 0.7 (equal space), 0.8 (late analysis). We also illustrate study design changes using results from the BHAT study.     

On the choice of transformations of the correlation coefficient with or without an outlier

Five transformations of the correlation coefficient, namely, Fisher's z, Nair's u, Sankaran's v, Ruben's y and Samiuddin's t are compared numerically using confidence intervals. Samiuddin's t_s transformation is close to the exact nominal confidence level for a small sample size ≤ 25 from a bivariate normal density. For a sample size > 25 both Samiuddin's t_s and Fisher's z can be used. In the presence of an outlier (on a minor axis), both Fisher's z and Samiuddin's t_s are not affected as long as |p| ≤ 0.3 but are seriously affected when |p&| > 0.3.     

Nonstationary Data Analysis by Time Deformation

ABSTRACT

In this article we discuss methodology for analyzing nonstationary time series whose periodic nature changes approximately linearly with time. We make use of the M-stationary process to describe such data sets, and in particular we use the discrete Euler(p) model to obtain forecasts and estimate the spectral characteristics. We discuss the use of the M-spectrum for displaying linear time-varying periodic content in a time series realization in much the same way that the spectrum shows periodic content within a realization of a stationary series. We also introduce the instantaneous frequency and spectrum of an M-stationary process for purposes of describing how frequency changes with time. To illustrate our techniques we use one simulated data set and two bat echolocation signals that show time varying frequency behavior. Our results indicate that for data whose periodic content is changing approximately linearly in time, the Euler model serves as a very good model for spectral analysis, filtering, and forecasting. Additionally, the instantaneous spectrum is shown to provide better representation of the time-varying frequency content in the data than window-based techniques such as the Gabor and wavelet transforms. Finally, it is noted that the results of this article can be extended to processes whose frequencies change like at^α, a > 0, ?∞ < α < ? ∞.     

Efficient Block Designs for Dependent Observations—A Computer-Aided Search

In this article, the exchange and interchange algorithm of Zergaw (1989 Zergaw , G. ( 1989 ). A sequential method of constructing optimal block designs . Austral. J. Statist. 31 : 333 – 342 .[Crossref] , [Google Scholar]) and Martin and Eccleston (1992 Martin , R. J. , Eccleston , J. A. ( 1992 ). Recursive formulae for constructing block designs with dependent errors . Biometrika 79 : 426 – 430 .[Crossref], [Web of Science ®] , [Google Scholar]) have been modified and used for searching efficient block designs for making all possible pairwise treatment comparisons when observations are dependent. The lower bounds to the A- and D-efficiencies of the designs in a given class of the designs have been obtained for correlated observation structure and the procedure of computing lower bounds to A- and D-efficiencies has been incorporated in the algorithm. The algorithm has been translated into a computer program using Microsoft Visual C++. Using this program, a search for efficient designs for making all possible pairwise treatment comparisons has been made for v ≤ 10, b ≤ 33, k ≤ 10 such that bk ≤ 100 and v > k. The block designs considered are usual block designs (rectangular block designs) and circular block designs. Nearest neighbor (NN), autoregressive of order 1 (AR(1)) correlation structures are studied. The ranges of correlation coefficients for different correlation structures investigated are |ρ|≤0.50 for NN correlation structure in rectangular blocks, |ρ|≤0.45 for NN correlation structure in circular blocks, and |ρ|≤0.95 for AR(1) correlation structure. For these ranges, the matrix of correlation coefficients among observations within a block is positive definite. Robustness aspects of designs that are efficient for a given value of correlation have been investigated against other values of correlation coefficients. Robustness aspects of designs that are efficient for independent observations have also been studied for experimental situations with dependent observations.     

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.     

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.     

The Distribution of Sums of Certain I.I.D. Pareto Variates

ABSTRACT

Though the Pareto distribution is important to actuaries and economists, an exact expression for the distribution of the sum of n i.i.d. Pareto variates has been difficult to obtain in general. This article considers Pareto random variables with common probability density function (pdf) f(x) = (α/β) (1 + x/β)^α+1 for x > 0, where α = 1,2,… and β > 0 is a scale parameter. To date, explicit expressions are known only for a few special cases: (i) α = 1 and n = 1,2,3; (ii) 0 < α < 1 and n = 1,2,…; and (iii) 1 < α < 2 and n = 1,2,…. New expressions are provided for the more general case where β > 0, and α and n are positive integers. Laplace transforms and generalized exponential integrals are used to derive these expressions, which involve integrals of real valued functions on the positive real line. An important attribute of these expressions is that the integrands involved are non oscillating.     

Semiparametric Likelihood Based Method for Goodness of Fit Tests and Estimation in Upgraded Mixture Models

We use Owen's (1988, 1990) empirical likelihood method in upgraded mixture models. Two groups of independent observations are available. One is z ₁, ..., z _n which is observed directly from a distribution F ( z ). The other one is x ₁, ..., x _m which is observed indirectly from F ( z ), where the x _i s have density ∫ p ( x | z ) dF ( z ) and p ( x | z ) is a conditional density function. We are interested in testing H ₀: p ( x | z ) = p ( x | z ; θ ), for some specified smooth density function. A semiparametric likelihood ratio based statistic is proposed and it is shown that it converges to a chi-squared distribution. This is a simple method for doing goodness of fit tests, especially when x is a discrete variable with finitely many values. In addition, we discuss estimation of θ and F ( z ) when H ₀ is true. The connection between upgraded mixture models and general estimating equations is pointed out.     

Optimal One-Way Random Effects Designs for the Intraclass Correlation Based on Confidence Intervals

ABSTRACT

Confidence intervals for the intraclass correlation coefficient (ρ) are used to determine the optimal allocation of experimental material in one-way random effects models. Designs that produce narrow intervals are preferred since they provide greater precision to estimate ρ. Assuming the total cost and the relative cost of the two stages of sampling are fixed, the authors investigate the number of classes and the number of individuals per class required to minimize the expected length of confidence intervals. We obtain results using asymptotic theory and compare these results to those obtained using exact calculations. The best design depends on the unknown value of ρ. Minimizing the maximum expected length of confidence intervals guards against worst-case scenarios. A good overall recommendation based on asymptotic results is to choose a design having classes of size 2 + √4 + 3r, where r is the relative cost of sampling at the class-level compared to the individual-level. If r = 0, then the overall cost is the sample size and the recommendation reduces to a design having classes of size 4.