Vector random fields with compactly supported covariance matrix functions

The objective of this paper is to construct covariance matrix functions whose entries are compactly supported, and to use them as building blocks to formulate other covariance matrix functions for second-order vector stochastic processes or random fields. In terms of the scale mixture of compactly supported covariance matrix functions, we derive a class of second-order vector stochastic processes on the real line whose direct and cross covariance functions are of Pólya type. Then some second-order vector random fields in R^d${\mathbb{R}}^d$ whose direct and cross covariance functions are compactly supported are constructed by using a convolution approach and a mixture approach.     

Weighted composite likelihood-based tests for space-time separability of covariance functions

Testing for separability of space-time covariance functions is of great interest in the analysis of space-time data. In this paper we work in a parametric framework and consider the case when the parameter identifying the case of separability of the associated space-time covariance lies on the boundary of the parametric space. This situation is frequently encountered in space-time geostatistics. It is known that classical methods such as likelihood ratio test may fail in this case.     

Simulating random variables using moment-generating functions and the saddlepoint approximation

When we are given only a transform such as the moment-generating function of a distribution, it is rare that we can efficiently simulate random variables. Possible approaches such as the inverse transform using numerical inversion of the transform are computationally very expensive. However, the saddlepoint approximation is known to be exact for the Normal, Gamma, and inverse Gaussian distribution and remarkably accurate for a large number of others. We explore the efficient use of the saddlepoint approximation for simulating distributions and provide three examples of the accuracy of these simulations.     

Chebyshev's inequality for Hilbert-space valued random elements with estimated mean and covariance

We obtain a generalization of the Chebyshev's inequality for random elements taking values in a separable Hilbert space with estimated mean and covariance.     

New compactly supported spatiotemporal covariance functions from SPDEs

Potential theory and Dirichlet’s priciple constitute the basic elements of the well-known classical theory of Markov processes and Dirichlet forms. This paper presents new classes of fractional spatiotemporal covariance models, based on the theory of non-local Dirichlet forms, characterizing the fundamental solution, Green kernel, of Dirichlet boundary value problems for fractional pseudodifferential operators. The elements of the associated Gaussian random field family have compactly supported non-separable spatiotemporal covariance kernels admitting a parametric representation. Indeed, such covariance kernels are not self-similar but can display local self-similarity, interpolating regular and fractal local behavior in space and time. The associated local fractional exponents are estimated from the empirical log-wavelet variogram. Numerical examples are simulated for illustrating the properties of the space–time covariance model class introduced.     

Modeling of covariance structures of random effects and random errors in linear mixed models

Abstract

In this paper, we discuss how to model the mean and covariancestructures in linear mixed models (LMMs) simultaneously. We propose a data-driven method to modelcovariance structures of the random effects and random errors in the LMMs. Parameter estimation in the mean and covariances is considered by using EM algorithm, and standard errors of the parameter estimates are calculated through Louis’ (1982 Louis, T.A. (1982). Finding observed information using the EM algorithm. J. Royal Stat. Soc. B 44:98–130. [Google Scholar]) information principle. Kenward’s (1987 Kenward, M.G. (1987). A method for comparing profiles of repeated measurements. Appl. Stat. 36:296–308.[Crossref], [Web of Science ®] , [Google Scholar]) cattle data sets are analyzed for illustration,and comparison to the literature work is made through simulation studies. Our numerical analysis confirms the superiority of the proposed method to existing approaches in terms of Akaike information criterion.     

Testing for separability of spatial–temporal covariance functions

Most applications in spatial statistics involve modeling of complex spatial–temporal dependency structures, and many of the problems of space and time modeling can be overcome by using separable processes. This subclass of spatial–temporal processes has several advantages, including rapid fitting and simple extensions of many techniques developed and successfully used in time series and classical geostatistics. In particular, a major advantage of these processes is that the covariance matrix for a realization can be expressed as the Kronecker product of two smaller matrices that arise separately from the temporal and purely spatial processes, and hence its determinant and inverse are easily determinable. However, these separable models are not always realistic, and there are no formal tests for separability of general spatial–temporal processes. We present here a formal method to test for separability. Our approach can be also used to test for lack of stationarity of the process. The beauty of our approach is that by using spectral methods the mechanics of the test can be reduced to a simple two-factor analysis of variance (ANOVA) procedure. The approach we propose is based on only one realization of the spatial–temporal process.We apply the statistical methods proposed here to test for separability and stationarity of spatial–temporal ozone fields using data provided by the US Environmental Protection Agency (EPA).     

A random cluster algorithm for some continuous Markov random fields

Based on a random cluster representation, the Swendsen–Wang algorithm for the Ising and Potts distributions is extended to a class of continuous Markov random fields. The algorithm can be described briefly as follows. A given configuration is decomposed into clusters. Probabilities for flipping the values of the random variables in each cluster are calculated. According to these probabilities, values of all the random variables in each cluster will be either updated or kept unchanged and this is done independently across the clusters. A new configuration is then obtained. We will show through a simulation study that, like the Swendsen–Wang algorithm in the case of Ising and Potts distributions, the cluster algorithm here also outperforms the Gibbs sampler in beating the critical slowing down for some strongly correlated Markov random fields.     

Convergence properties of the expected improvement algorithm with fixed mean and covariance functions

This paper deals with the convergence of the expected improvement algorithm, a popular global optimization algorithm based on a Gaussian process model of the function to be optimized. The first result is that under some mild hypotheses on the covariance function k of the Gaussian process, the expected improvement algorithm produces a dense sequence of evaluation points in the search domain, when the function to be optimized is in the reproducing kernel Hilbert space generated by k  . The second result states that the density property also holds for P-almost$\mathsf{P}\text{-almost}$ all continuous functions, where P is the (prior) probability distribution induced by the Gaussian process.     

Posterior moments of scalar functions of a covariance matrix

Given multivariate normal data and a certain spherically invariant prior distribution on the covariance matrix, it is desired to estimate the moments of the posterior marginal distributions of some scalar functions of the covariance matrix by importance sampling. To this end a family of distributions is defined on the group of orthogonal matrices and a procedure is proposed for selecting one of these distributions for use as a weighting distribution in the importance sampling process. In an example estimates are calculated for the posterior mean and variance of each element in the covariance matrix expressed in the original coordinates, for the posterior mean of each element in the correlation matrix expressed in the original coordinates, and for the posterior mean of each element in the covariance matrix expressed in the coordinates of the principal variables.     

Mixed-spectra analysis for stationary random fields

We consider a, discrete time, weakly stationary bidimensional process, for which the spectral measure is the sum of an absolutely continuous measure, a discrete measure of finite order and a finite number of absolutely continuous measures on several lines. In this paper we are interested in estimating the spectral density of the absolutely continuous measure and of the density on the lines. For this aim, by using the double kernel method, we construct consistent estimators of these densities and we study their asymptotic behaviors in term of the mean squared error with rate.     

Estimation of context in random fields

When considering the problem of the classification of satellite data, several authors have shown the superiority of the contextual method over the blind (pixel by pixel) method. Determining the discriminating functions which define the best contextual strategy (in the Bayesian sense) requires knowledge of the distribution of the restriction of the random field which models the picture, to the given context. We propose an estimator of this distribution and demonstrate its good asymptotic behaviour in very weak hypotheses.     

Construction of non-Gaussian random fields with any given correlation structure

A positive definite function can be thought of as the covariance function of a Gaussian random field, according to the celebrated Kolmogorov existence theorem. A question of great theoretical and practical interest is: how could one construct a non-Gaussian random field with the given positive definite function as its covariance function? In this paper we demonstrate a novel and simple method for constructing many such non-Gaussian random fields, with the corresponding finite-dimensional distributions identified. Also, we show how to construct a non-Gaussian random field with a given negative definite function as its variogram.     

Estimation for hidden Markov random fields

A finite state Markov random field is noisily observed via a second finite state process. The parameters of the model are estimated, as well as the most likely signal given the observations.     

Approximating hidden Gaussian Markov random fields

Summary.  Gaussian Markov random-field (GMRF) models are frequently used in a wide variety of applications. In most cases parts of the GMRF are observed through mutually independent data; hence the full conditional of the GMRF, a hidden GMRF (HGMRF), is of interest. We are concerned with the case where the likelihood is non-Gaussian, leading to non-Gaussian HGMRF models. Several researchers have constructed block sampling Markov chain Monte Carlo schemes based on approximations of the HGMRF by a GMRF, using a second-order expansion of the log-density at or near the mode. This is possible as the GMRF approximation can be sampled exactly with a known normalizing constant. The Markov property of the GMRF approximation yields computational efficiency.The main contribution in the paper is to go beyond the GMRF approximation and to construct a class of non-Gaussian approximations which adapt automatically to the particular HGMRF that is under study. The accuracy can be tuned by intuitive parameters to nearly any precision. These non-Gaussian approximations share the same computational complexity as those which are based on GMRFs and can be sampled exactly with computable normalizing constants. We apply our approximations in spatial disease mapping and model-based geostatistical models with different likelihoods, obtain procedures for block updating and construct Metropolized independence samplers.     

Selection of the neighborhood structure for space-time Markov random field models

A space-time, univariate dataset is assumed to have been sampled from a 3-dimensional Markov Random Field where the data dependence structure is modeled through pairwise interaction parameters. The likelihood function depends upon (1) an undirected, 3-dimensional graph, where edges connect observation points, and (2) the parameter dimension that captures possible space-time anisotropy of data interaction. Automatic model selection to discriminate both the graph and the model dimension is suggested on the basis of a penalized Pseudo-likelihood function. In most cases, the procedure can be implemented using standard statistical packages capable of GLM estimation. Weak consistency of the criterion is shown to hold under mild and easily verifiable sufficient conditions. Its performance in small samples is studied providing simulation results.     

Generation of random matrices with orthonormal columns and multivariate normal wariates with given sample mean and covariance

In this paper, an algorithm for generating random matrices with orthonormal columns is introduced. As pointed out by a referee, the algorithm is almost identical to Wedderburn's (1975) unpublished method. The method can also be considered as an extension of Stewart's (1980) method, which was designed to generate random orthogonal matrices. It is found outperforming a simple extension of the QR factorization method and that of Heiberger's (1978) method. This paper also demonstrates how the algorithm can be used in generating multivariate normal variates with given sample mean and sample covariance matrix.