Equivariant prediction in finite populations

A theory of equivariant prediction is developed for predicting the population total in finite populations. Minimum risk equivariant predictors (MREP) are derived under the location, scale and locationscale superpopulation models. Under the general linear model, it is shown that the best(linear) unbiased predictor (B(L)UP) is an MREP.     

Some tests for the power series distibutions in one parameter using the kullback-leibler information measure

The purpose of the article is, in case of one sample, to obtain tests concerning the parameter in the power series distribution in one parameter using Ku11back-Leibier information measure. The class of power series distibutions contains a host of discrete distributions. Ve illustrate the general results obtained in case of the geometric distibution.     

Geeta distribution and its properties

A new discrete distribution defined over all the positive integers and with the name of Geeta distribution is described. It is L-shaped like the logarithmic series distribution, Yule distribution and the discrete Pareto distribution but is far more versatile than them as it has two parameters. It belongs to the classes of location parameter distributions, modified power series distributions, Lagrange series distributions and exponential distributions. Its mean fi, variance a2 and two recurrence formulae for higher central moments are obtained. Convolution theorem and variations in the model with changes in the parameters have been considered. ML estimators, MVU estimators and estimators based of mean and variance and on mean and first frequency have been derived.     

Comparison of estimators of the location parameter using pitman's closeness criterion

Necessary and sufficient conditions for a linear estimator to dominate another linear estimator of a location parameter under the Pitman's criterion of comparison are discussed. Consequently it is demonstrated that a linear biased estimator can not dominate a linear unbiased estimator under Pitman's criterion and that the sample mean is the Closest Linear Unbiased Estimator (CLUE). It is also shown that the ridge regression estimator with a known biasing constant can not dominate the ordinary least squares estimator. If an estimator δdominates an estimator δin the average loss sense then sufficient conditions are obtained under which δis also preferred over δunder Pitman's criterion. Further we obtain sufficient conditions under which preference under the Pitman's criterion will lead to preference under the mean squared error sense.     

Unbiastld estimation of parametric functions in sampling from two two-truncation parameter families

We consider the problem of UMVU estimation of a U-estimable function of four unknown truncation parameters based on two independent random samples from two two-truncation parameter families. In particular, we obtain the UMVU estimator of functional, P (Y > X). Also the confidence intervals for some parametric functions are obtained.     

Combined estimate of a location parameter

In this paper, we revisit the problem of combining estimates of location considered by Cohen (1976). Our results unify and strengthen the results of Cohen (1976), Bhattacharya (1981) and Akai (1982).     

Transformed generalized linear models

The estimation of data transformation is very useful to yield response variables satisfying closely a normal linear model. Generalized linear models enable the fitting of models to a wide range of data types. These models are based on exponential dispersion models. We propose a new class of transformed generalized linear models to extend the Box and Cox models and the generalized linear models. We use the generalized linear model framework to fit these models and discuss maximum likelihood estimation and inference. We give a simple formula to estimate the parameter that index the transformation of the response variable for a subclass of models. We also give a simple formula to estimate the r$r$th moment of the original dependent variable. We explore the possibility of using these models to time series data to extend the generalized autoregressive moving average models discussed by Benjamin et al. [Generalized autoregressive moving average models. J. Amer. Statist. Assoc. 98, 214–223]. The usefulness of these models is illustrated in a simulation study and in applications to three real data sets.     

Quantile dispersion graphs to compare the efficiencies of cluster randomized designs

The purpose of this article is to compare efficiencies of several cluster randomized designs using the method of quantile dispersion graphs (QDGs). A cluster randomized design is considered whenever subjects are randomized at a group level but analyzed at the individual level. A prior knowledge of the correlation existing between subjects within the same cluster is necessary to design these cluster randomized trials. Using the QDG approach, we are able to compare several cluster randomized designs without requiring any information on the intracluster correlation. For a given design, several quantiles of the power function, which are directly related to the effect size, are obtained for several effect sizes. The quantiles depend on the intracluster correlation present in the model. The dispersion of these quantiles over the space of the unknown intracluster correlation is determined, and then depicted by the QDGs. Two applications of the proposed methodology are presented.     

Asymptotic Bias in Parameter Estimation of AR-Processes Using Recursive Least Squares with Exponential Forgetting

The recursive least squares technique is often extended with exponential forgetting as a tool for parameter estimation in time-varying systems. The distribution of the resulting parameter estimates is, however, unknown when the forgetting factor is less than one. In this paper an approximative expression for bias of the recursively obtained parameter estimates in a time-invariant AR( n_a ) process with arbitrary noise is given, showing that the bias is non-zero and giving bounds on the approximation errors. Simulations confirm the approximation expressions.