An investigation of lag identification tools for vector nonlinear time series

Exploratory methods for determining appropriate lagged vsrlables in a vector nonlinear time series model are investigated. The first is a multivariate extension of the R statistic considered by Granger and Lin (1994), which is based on an estimate of the mutual information criterion. The second method uses Kendall's ρ and partial ρ statistics for lag determination. The methods provide nonlinear analogues of the autocorrelation and partial autocorrelation matrices for a vector time series. Simulation studies indicate that the R statistic reliabiy identifies appropriate lagged nonlinear moving average terms in a vector time series, while Kendall's ρ and partial ρ statistics have some power in identifying appropirate lagged nonlinear moving average and autoregressive terms, respectively, when the nonlinear relationship between lagged variables is monotonic. For illustration, the methods are applied to set of annual temperature and tree ring measurements at Campito Mountain In California.     

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.     

Efficient use of exact samples

Propp and Wilson (Random Structures and Algorithms (1996) 9: 223–252, Journal of Algorithms (1998) 27: 170–217) described a protocol called coupling from the past (CFTP) for exact sampling from the steady-state distribution of a Markov chain Monte Carlo (MCMC) process. In it a past time is identified from which the paths of coupled Markov chains starting at every possible state would have coalesced into a single value by the present time; this value is then a sample from the steady-state distribution.Unfortunately, producing an exact sample typically requires a large computational effort. We consider the question of how to make efficient use of the sample values that are generated. In particular, we make use of regeneration events (cf. Mykland et al. Journal of the American Statistical Association (1995) 90: 233–241) to aid in the analysis of MCMC runs. In a regeneration event, the chain is in a fixed reference distribution– this allows the chain to be broken up into a series of tours which are independent, or nearly so (though they do not represent draws from the true stationary distribution).In this paper we consider using the CFTP and related algorithms to create tours. In some cases their elements are exactly in the stationary distribution; their length may be fixed or random. This allows us to combine the precision of exact sampling with the efficiency of using entire tours.Several algorithms and estimators are proposed and analysed.     

Perfect slice samplers

Perfect sampling allows the exact simulation of random variables from the stationary measure of a Markov chain. By exploiting monotonicity properties of the slice sampler we show that a perfect version of the algorithm can be easily implemented, at least when the target distribution is bounded. Various extensions, including perfect product slice samplers, and examples of applications are discussed.     

Comparative Study of Robust Estimators Based on a Sensitivity Coefficient in Principal Component Analysis

This work is devoted to robust principal component analysis (PCA). We give a comparison between some multivariate estimators of location and scatter by computing the influence functions of the sensitivity coefficient ρ corresponding to these estimators, and the mean squared error (MSE) of estimators of ρ. The coefficient ρ measures the closeness between the subspaces spanned by the initial eigenvectors and their corresponding version derived from an infinitesimal perturbation of the data distribution.     

Pseudo-perfect and adaptive variants of the Metropolis–Hastings algorithm with an independent candidate density

We describe and examine an imperfect variant of a perfect sampling algorithm based on the Metropolis–Hastings algorithm that appears to perform better than a more traditional approach in terms of speed and accuracy. We then describe and examine an ‘adaptive’ Metropolis–Hastings algorithm which generates and updates a self-target candidate density in such a way that there is no ‘wrong choice’ for an initial candidate density. Simulation examples are provided.     

Perfect simulation of an inventory model for perishable products

We study an inventory model for perishable products with a critical-number ordering policy under the assumption that demand for the product forms an i.i.d. sequence, so that the state of the system forms a Markov chain. Explicit calculation of the stationary distribution has proved impractical in cases where items have reasonably long lifetimes and for systems with large under-up-to levels. Using the recently developed coupling-from-the-past method, we introduce a technique to estimate the stationary distribution of the Markov chain via perfect simulation. The Markov chain that results from the use of a critical-number policy is particularly amenable to these simulation techniques, despite not being ordered in its initial state, since the recursive equations satisfied by the Markov chain enable us to identify specific demand patterns where the backward coupling occurs.     

Tests and confidence intervals for the shape parameter of a gamma distribution

Inference based on the Central Limit Theorem has only first order accuracy. We give tests and confidence intervals (CIs) of second orderaccuracy for the shape parameter ρ of a gamma distribution for both the unscaled and scaled cases.

Tests and CIs based on moment and cumulant estimates are considered as well as those based on the maximum likelihood estimate (MLE).

For the unscaled case the MLE is the moment estimate of order zero; the most efficient moment estimate of integral order is the sample mean, having asymptotic relative efficiency (ARE) .61 when ρ= 1.

For the scaled case the most efficient moment estimate is a functionof the mean and variance. Its ARE is .39 when ρ = 1.

Our motivation for constructing these tests of ρ = 1 and CIs forρ is to provide a simple and convenient method for testing whether a distribution is exponential in situations such as rainfall models where such an assumption is commonly made.     

Exact Sampling from a Continuous State Space

Propp & Wilson (1996) described a protocol, called coupling from the past, for exact sampling from a target distribution using a coupled Markov chain Monte Carlo algorithm. In this paper we extend coupling from the past to various MCMC samplers on a continuous state space; rather than following the monotone sampling device of Propp & Wilson, our approach uses methods related to gamma-coupling and rejection sampling to simulate the chain, and direct accounting of sample paths.     

Evaluating modified generalized information criterion in presence of multicollinearity

When there are many explanatory variables in the regression model, there is a chance that some of these are intercorrelated. This is where the problem of multicollinearity creeps in due to which precision and accuracy of the coefficients is marred, and the quest to find the best model becomes tedious. To tackle such a situation, Model selection criteria are applied for selecting the best model that fits the data. Current study focuses on the evaluation of the four unmodified and four modified versions of generalized information criteria—Akaike Information Criterion, Schwarz's Bayes Information Criteria, Hannan-Quinn Information Criterion, and Akaike Information Criterion corrected for small samples. A simulation study using SAS software was carried out in order to compare the unmodified and modified versions of the generalized information criteria and to discover the best version amongst the four modified model selection criteria, for identifying the best model, when the collinearity assumption is violated. For the proposed simulation, two samples of size 50 and 100, for three explanatory variables X₁, X₂, and X₃, are drawn from Normal distribution. Two situations of collinearity violations between X₁ and X₂ are looked into, first when ρ = 0.6 and second when ρ = 0.8. The outcomes of the simulations are displayed in the tables along with visual representations. The results revealed that modified versions of the generalized information criteria are more sensitive in identifying models marred with high multicollinearity as compared to the unmodified generalized information criteria.     

Bayes Estimation of Intraclass Correlation Coefficients Under Unequal Family Sizes

Bayesian inference for the intraclass correlation ρ is considered under unequal family sizes. We obtain the posterior distribution of ρ and then compare the performance of the Bayes estimator (posterior mean of ρ) with that of Srivastava's (1984) estimator through simulation. Simulation study shows that the Bayes estimator performs better than the Srivastava's estimator in terms of lower mean square error. We also obtain large sample posteriors of ρ based on the asymptotic posterior distribution and based on the Laplace approximation.     

Evaluating the Significance Test When the Correlation Coefficient is Different from Zero in the Test of Hypothesis

Sample size and correlation coefficient of populations are the most important factors which influence the statistical significance of the sample correlation coefficient. It is observed that for evaluating the hypothesis when the observed value of the correlation coefficient's r is different from zero, Fisher's Z transformation may be incorrect for small samples especially when population correlation coefficient ρ has big values. In this study, a simulation program has been generated for to illustrate how the bias in the Fisher transformation of the correlation coefficient affects estimate precision when sample size is small and ρ has big value. By the simulation results, 90 and 95% confidence intervals of correlation coefficients have been created and tabled. As a result, it is suggested that especially when ρ is greater than 0.2 and sample sizes of 18 or less, Tables 1 and 2 can be used for the significance test in correlations.     

Perfect Simulation for Length-interacting Polygonal Markov Fields in the Plane

Abstract.  The purpose of this paper was to construct perfect samplers for length-interacting Arak–Clifford–Surgailis polygonal Markov fields in the plane with nodes of order 2 ( V -shaped nodes). This is achieved by providing for the polygonal fields a hard core marked point process representation with individual points carrying polygonal loops as their marks, so that the coupling from the past and clan of ancestors routines can be adopted.     

Some Improvements on Markov's Theorem with Extensions

ABSTRACT

Markov's theorem for an upper bound of the probability related to a nonnegative random variable has been improved using additional information in almost the nontrivial entire range of the variable. In the improvement, Cantelli's inequality is applied to the square root of the original variable, whose expectation is finite when that of the original variable is finite. The improvement has been extended to lower bounds and monotonic transformations of the original variable. The improvements are used in Chebyshev's inequality and its multivariate version.     

Simulated annealing for the bounds of Kendall's τ and Spearman's ρ

It has long been known that, for many joint distributions, Kendall's τ and Spearman's ρ have different values, as they measure different aspects of the dependence structure. Although the classical inequalities between Kendall's τ and Spearman's ρ for pairs of random variables are given, the joint distributions which can attain the bounds between Kendall's τ and Spearman's ρ are difficult to find. We use the simulated annealing method to find the bounds for ρ in terms of τ and its corresponding joint distribution which can attain those bounds. Furthermore, using this same method, we find the improved bounds between τ and ρ, which is different from that given by Durbin and Stuart.     

Perfect Forward Simulation via Simulated Tempering

Several authors discuss how the simulated tempering scheme provides a very simple mechanism for introducing regenerations within a Markov chain. In this article we explain how regenerative simulated tempering schemes provide a very natural mechanism for perfect simulation. We use this to provide a perfect simulation algorithm, which uses a single-sweep forward-simulation without the need for recursively searching through negative times. We demonstrate this algorithm in the context of several examples.     

Estimating a covariance function having an un unknown scale kakameter

The structure of a family ρ of measures corresponding to a zero-mean Gaussian process with covariance αR(s,t) is discussed. When R itself is known (R and T completely arbitrary), it is shown that ρ is either homogeneous or composed of singular measures, depending on whether the reproducing kernel Hilbert space H(R,T) is finite- or infinite-dimensional. For the case dim H < ∞ the MLE α is given; when dim H = ∞ an almost sure discriminator is constructed. More generally, it is shown that when R itself depends upon a parameter θ (not necessarily a scalar) and certain broad assumptions are met, one may describe the orthogonal decomposition of P and estimate both a and θ.     

Signed directed acyclic graphs for causal inference

Summary.  Formal rules governing signed edges on causal directed acyclic graphs are described and it is shown how these rules can be useful in reasoning about causality. Specifically, the notions of a monotonic effect, a weak monotonic effect and a signed edge are introduced. Results are developed relating these monotonic effects and signed edges to the sign of the causal effect of an intervention in the presence of intermediate variables. The incorporation of signed edges in the directed acyclic graph causal framework furthermore allows for the development of rules governing the relationship between monotonic effects and the sign of the covariance between two variables. It is shown that when certain assumptions about monotonic effects can be made then these results can be used to draw conclusions about the presence of causal effects even when data are missing on confounding variables.     

In Memoriam: Bernard George Greenberg 1919-1985

The bivariate normal density with unit variance and correlation ρ is well known. We show that by integrating out ρ, the result is a function of the maximum norm. The Bayesian interpretation of this result is that if we put a uniform prior over ρ, then the marginal bivariate density depends only on the maximal magnitude of the variables. The square-shaped isodensity contour of this resulting marginal bivariate density can also be regarded as the equally weighted mixture of bivariate normal distributions over all possible correlation coefficients. This density links to the Khintchine mixture method of generating random variables. We use this method to construct the higher dimensional generalizations of this distribution. We further show that for each dimension, there is a unique multivariate density that is a differentiable function of the maximum norm and is marginally normal, and the bivariate density from the integral over ρ is its special case in two dimensions.     

A monte carlo investigation of a statistic for a bivariate missing data problem

Testing the equal means hypothesis of a bivariate normal distribution with homoscedastic varlates when the data are incomplete is considered. If the correlational parameter, ρ, is known, the well-known theory of the general linear model is easily employed to construct the likelihood ratio test for the two sided alternative. A statistic, T, for the case of ρ unknown is proposed by direct analogy to the likelihood ratio statistic when ρ is known. The null and nonnull distribution of T is investigated by Monte Carlo techniques. It is concluded that T may be compared to the conventional t distribution for testing the null hypothesis and that this procedure results in a substantial increase in power-efficiency over the procedure based on the paired t test which ignores the incomplete data. A Monte Carlo comparison to two statistics proposed by Lin and Stivers (1974) suggests that the test based on T is more conservative than either of their statistics.