Perfect simulation of positive Gaussian distributions

We provide an exact simulation algorithm that produces variables from truncated Gaussian distributions on ( ₊) ^p via a perfect sampling scheme, based on stochastic ordering and slice sampling, since accept-reject algorithms like the one of Geweke (1991) and Robert (1995) are difficult to extend to higher dimensions.     

Comparing several exponential populations with more than one control

Suppose there are k ₁ (k ₁ ≥ 1) test treatments that we wish to compare with k ₂ (k ₂ ≥ 1) control treatments. Assume that the observations from the ith test treatment and the jth control treatment follow a two-parameter exponential distribution and , where θ is a common scale parameter and and are the location parameters of the ith test and the jth control treatment, respectively, i = 1, . . . ,k ₁; j = 1, . . . ,k ₂. In this paper, simultaneous one-sided and two-sided confidence intervals are proposed for all k ₁ k ₂ differences between the test treatment location and control treatment location parameters, namely , and the required critical points are provided. Discussions of multiple comparisons of all test treatments with the best control treatment and an optimal sample size allocation are given. Finally, it is shown that the critical points obtained can be used to construct simultaneous confidence intervals for Pareto distribution location parameters.     

Evaluation of Tweedie exponential dispersion model densities by Fourier inversion

The Tweedie family of distributions is a family of exponential dispersion models with power variance functions V(μ)=μ ^p for . These distributions do not generally have density functions that can be written in closed form. However, they have simple moment generating functions, so the densities can be evaluated numerically by Fourier inversion of the characteristic functions. This paper develops numerical methods to make this inversion fast and accurate. Acceleration techniques are used to handle oscillating integrands. A range of analytic results are used to ensure convergent computations and to reduce the complexity of the parameter space. The Fourier inversion method is compared to a series evaluation method and the two methods are found to be complementary in that they perform well in different regions of the parameter space.     

Estimation of a normal mean relative to balanced loss functions

LetX ₁,…,X _nbe a random sample from a normal distribution with mean θ and variance σ². The problem is to estimate θ with Zellner's (1994) balanced loss function, % MathType!End!2!1!, where 0<ω<1. It is shown that the sample mean % MathType!End!2!1!, is admissible. More generally, we investigate the admissibility of estimators of the form % MathType!End!2!1! under % MathType!End!2!1!. We also consider the weighted balanced loss function, % MathType!End!2!1!, whereq(θ) is any positive function of θ, and the class of admissible linear estimators is obtained under such loss withq(θ) =e ^θ .     

Convexity-based clustering criteria: theory,algorithms, and applications in statistics

This paper deals with the construction of optimum partitions of for a clustering criterion which is based on a convex function of the class centroids as a generalization of the classical SSQ clustering criterion for n data points. We formulate a dual optimality problem involving two sets of variables and derive a maximum-support-plane (MSP) algorithm for constructing a (sub-)optimum partition as a generalized k-means algorithm. We present various modifications of the basic criterion and describe the corresponding MSP algorithm. It is shown that the method can also be used for solving optimality problems in classical statistics (maximizing Csiszárs -divergence) and for simultaneous classification of the rows and columns of a contingency table.     

On the invariance of conditioning procedures for the specification of prior distributions for nested DAG models

Given a prior distribution for a model , the prior information specified on a nested submodel by means of a conditioning procedure crucially depends on the parameterisation used to describe the model. Regression coefficients represent the most common parameterisation of Gaussian DAG models. Nevertheless, in the specification of prior distributions, invariance considerations lead to the use of different parameterisations of the model, depending on the required invariance class. In this paper we consider the problem of prior specification by conditioning on zero regression coefficients and show that also such a procedure satisfies the property of invariance with respect to a class of parameterisations and characterise such a class.     

Chain graph models: topological sorting of meta-arrows and efficient construction of $${\mathcal{B}}$$ -essential graphs

Essential graphs and largest chain graphs are well-established graphical representations of equivalence classes of directed acyclic graphs and chain graphs respectively, especially useful in the context of model selection. Recently, the notion of a labelled block ordering of vertices was introduced as a flexible tool for specifying subfamilies of chain graphs. In particular, both the family of directed acyclic graphs and the family of “unconstrained” chain graphs can be specified in this way, for the appropriate choice of . The family of chain graphs identified by a labelled block ordering of vertices is partitioned into equivalence classes each represented by means of a -essential graph. In this paper, we introduce a topological ordering of meta-arrows and use this concept to devise an efficient procedure for the construction of -essential graphs. In this way we also provide an efficient procedure for the construction of both largest chain graphs and essential graphs. The key feature of the proposed procedure is that every meta-arrow needs to be processed only once.     

Improved estimators of common variance of <Emphasis Type="Italic">p</Emphasis>-populations when Kurtosis is known

The pooled variance of p samples presumed to have been obtained from p populations having common variance σ², has invariably been adopted as the default estimator for σ². In this paper, alternative estimators of the common population variance are developed. These estimators are biased and have lower mean-squared error values than . The comparative merit of these estimators over the unbiased estimator is explored using relative efficiency (a ratio of mean-squared error values).     

Bootstrap inference in local polynomial regression of time series

In this paper we consider the inferential aspect of the nonparametric estimation of a conditional function , where X _t,m represents the vector containing the m conditioning lagged values of the series. Here is an arbitrary measurable function. The local polynomial estimator of order p is used for the estimation of the function g, and of its partial derivatives up to a total order p. We consider α-mixing processes, and we propose the use of a particular resampling method, the local polynomial bootstrap, for the approximation of the sampling distribution of the estimator. After analyzing the consistency of the proposed method, we present a simulation study which gives evidence of its finite sample behaviour.     

Conditional estimation of average on the basis of weighting data

LetF(x,y) be a distribution function of a two dimensional random variable (X,Y). We assume that a distribution functionF _x(x) of the random variableX is known. The variableX will be called an auxiliary variable. Our purpose is estimation of the expected valuem=E(Y) on the basis of two-dimensional simple sample denoted by:U=[(X ₁, Y₁)…(X_n, Y_n)]=[X Y]. LetX=[X ₁…X _n]andY=[Y ₁…Y _n].This sample is drawn from a distribution determined by the functionF(x,y). LetX _(k)be the k-th (k=1, …,n) order statistic determined on the basis of the sampleX. The sampleU is truncated by means of this order statistic into two sub-samples: % MathType!End!2!1! and % MathType!End!2!1!.Let % MathType!End!2!1! and % MathType!End!2!1! be the sample means from the sub-samplesU _k,1 andU _k,2, respectively. The linear combination % MathType!End!2!1! of these means is the conditional estimator of the expected valuem. The coefficients of this linear combination depend on the distribution function of auxiliary variable in the pointx _(k).We can show that this statistic is conditionally as well as unconditionally unbiased estimator of the averagem. The variance of this estimator is derived. The variance of the statistic % MathType!End!2!1! is compared with the variance of the order sample mean. The generalization of the conditional estimation of the mean is considered, too.     

Efficiency comparison of M-estimates for scale at t-distributions

Using Fisher's information fort-distributions, the absolute asymptotic efficiency of some M-estimates for scale with known location parameter is calculated and graphically illustrated. The compared estimators are the standard deviationS _*, the mean absolute deviation, called mean deviationD _*, the median absolute deviation, called MAD_*, and some M-estimates for scale, one, which is very robust, and another one with high asymptotic efficiency fort-distributions close to the normal. The last one is considered with monotone (in the positive field) and with very late redescending χ-function too. Also the , an alternative and generalized excess measure defined as the double relative asymptotic variance of the underlying scale estimator in the previous paper, is calculated fort-distributions and graphically illustrated, because there is the relation that the higher the asymptotic efficiency of is, the lower is the corresponding .     

Improvement of the Liu estimator in linear regression model

In the presence of stochastic prior information, in addition to the sample, Theil and Goldberger (1961) introduced a Mixed Estimator for the parameter vector β in the standard multiple linear regression model (T,Xβ,σ² I). Recently, the Liu estimator which is an alternative biased estimator for β has been proposed by Liu (1993). In this paper we introduce another new Liu type biased estimator called Stochastic restricted Liu estimator for β, and discuss its efficiency. The necessary and sufficient conditions for mean squared error matrix of the Stochastic restricted Liu estimator to exceed the mean squared error matrix of the mixed estimator will be derived for the two cases in which the parametric restrictions are correct and are not correct. In particular we show that this new biased estimator is superior in the mean squared error matrix sense to both the Mixed estimator and to the biased estimator introduced by Liu (1993).     

Constructing an unbiased estimator of population mean in finite populations using auxiliary information

The objective of this paper is to construct an unbiased estimator (up to order 0(1/n)) of the population mean of the study variatey which is more efficient than the sample mean of the ‘n’ obsrvedy-values. In particular, the unbiased estimators are discussed for the cases of positive and negative correlations of the study variatey and the auxiliary variatex.     

On directional Metropolis–Hastings algorithms

New Metropolis–Hastings algorithms using directional updates are introduced in this paper. Each iteration of a directional Metropolis–Hastings algorithm consists of three steps (i) generate a line by sampling an auxiliary variable, (ii) propose a new state along the line, and (iii) accept/reject according to the Metropolis–Hastings acceptance probability. We consider two classes of directional updates. The first uses a point in ⁿ as auxiliary variable, the second an auxiliary direction vector. The proposed algorithms generalize previous directional updating schemes since we allow the distribution of the auxiliary variable to depend on properties of the target at the current state. By letting the proposal distribution along the line depend on the density of the auxiliary variable, we identify proposal mechanisms that give unit acceptance rate. When we use direction vector as auxiliary variable, we get the advantageous effect of large moves in the Markov chain and hence the autocorrelation length of the samples is small. We apply the directional Metropolis–Hastings algorithms to a Gaussian example, a mixture of Gaussian densities, and a Bayesian model for seismic data.     

Generating random numbers of prescribed distribution using physical sources

When constructing uniform random numbers in [0, 1] from the output of a physical device, usually n independent and unbiased bits B _j are extracted and combined into the machine number . In order to reduce the number of data used to build one real number, we observe that for independent and exponentially distributed random variables X _n (which arise for example as waiting times between two consecutive impulses of a Geiger counter) the variable U _n : = X _{2n – 1}/(X _{2n – 1} + X _2n ) is uniform in [0, 1]. In the practical application X _n can only be measured up to a given precision (in terms of the expectation of the X _n ); it is shown that the distribution function obtained by calculating U _n from these measurements differs from the uniform by less than /2.We compare this deviation with the error resulting from the use of biased bits B _j with P {B _j = 1{ = (where ] – [) in the construction of Y above. The influence of a bias is given by the estimate that in the p-total variation norm Q ^TV _p = ( |Q()| ^p )^1/p (p 1) we have P _Y – P ⁰ _Y ^TV _p (c _n · )^1/p with c _n p for n . For the distribution function F _Y – F ⁰ _Y 2(1 – 2^–n )|| holds.     

Partial cell suppression: A new methodology for statistical disclosure control

In this paper we address the problem of protecting confidentiality in statistical tables containing sensitive information that cannot be disseminated. This is an issue of primary importance in practice. Cell Suppression is a widely-used technique for avoiding disclosure of sensitive information, which consists in suppressing all sensitive table entries along with a certain number of other entries, called complementary suppressions. Determining a pattern of complementary suppressions that minimizes the overall loss of information results into a difficult (i.e., -hard) optimization problem known as the Cell Suppression Problem. We propose here a different protection methodology consisting of replacing some table entries by appropriate intervals containing the actual value of the unpublished cells. We call this methodology Partial Cell Suppression, as opposed to the classical complete cell suppression. Partial cell suppression has the important advantage of reducing the overall information loss needed to protect the sensitive information. Also, the new method provides automatically auditing ranges for each unpublished cell, thus saving an often time-consuming task to the statistical office while increasing the information explicitly provided with the table. Moreover, we propose an efficient (i.e., polynomial-time) algorithm to find an optimal partial suppression solution. A preliminary computational comparison between partial and complete suppression methologies is reported, showing the advantages of the new approach. Finally, we address possible extensions leading to a unified complete/partial cell suppression framework.     

The type I distribution of the ratio of independent “Weibullized” generalized beta-prime variables

In this paper we introduce the distribution of , with c >  0, where X _i , i =  1, 2, are independent generalized beta-prime-distributed random variables, and establish a closed form expression of its density. This distribution has as its limiting case the generalized beta type I distribution recently introduced by Nadarajah and Kotz (2004). Due to the presence of several parameters the density can take a wide variety of shapes.      

Biased estimation of a variance

Summary Let , whereX _i are i.i.d. random variables with a finite variance σ² and is the usual estimate of the mean ofX _i. We consider the problem of finding optimal α with respect to the minimization of the expected value of |S ²(σ)−σ²|^k for variousk and with respect to Pitman's nearness criterion. For the Gaussian case analytical results are obtained and for some non-Gaussian cases we present Monte Carlo results regarding Pitman's criteron. This research was supported by Science Fund of Serbia, grant number 04M03, through Mathematical Institute, Belgrade.