Non-parametric Sampling Approximation via Voronoi Tessellations

In this article we propose a novel non-parametric sampling approach to estimate posterior distributions from parameters of interest. Starting from an initial sample over the parameter space, this method makes use of this initial information to form a geometrical structure known as Voronoi tessellation over the whole parameter space. This rough approximation to the posterior distribution provides a way to generate new points from the posterior distribution without any additional costly model evaluations. By using a traditional Markov Chain Monte Carlo (MCMC) over the non-parametric tessellation, the initial approximate distribution is refined sequentially. We applied this method to a couple of climate models to show that this hybrid scheme successfully approximates the posterior distribution of the model parameters.     

Fitting three-dimensional Laguerre tessellations to foam structures

Foam models, especially random tessellations, are powerful tools to study the relations between the geometric structure of foams and their physical properties. In this paper, we propose the use of random Laguerre tessellations, weighted versions of the well-known Voronoi tessellations, as models for the microstructure of foams. Based on geometric characteristics estimated from a tomographic image of a closed-cell polymer foam, we fit a Laguerre tessellation model to the material. It is shown that this model allows for a better fit of the geometric structure of the foam than some classical Voronoi tessellation models.     

Image segmentation using voronoi polygons and MCMC, with application to muscle fibre images

We investigate a Bayesian method for the segmentation of muscle fibre images. The images are reasonably well approximated by a Dirichlet tessellation, and so we use a deformable template model based on Voronoi polygons to represent the segmented image. We consider various prior distributions for the parameters and suggest an appropriate likelihood. Following the Bayesian paradigm, the mathematical form for the posterior distribution is obtained (up to an integrating constant). We introduce a Metropolis-Hastings algorithm and a reversible jump Markov chain Monte Carlo algorithm (RJMCMC) for simulation from the posterior when the number of polygons is fixed or unknown. The particular moves in the RJMCMC algorithm are birth, death and position/colour changes of the point process which determines the location of the polygons. Segmentation of the true image was carried out using the estimated posterior mode and posterior mean. A simulation study is presented which is helpful for tuning the hyperparameters and to assess the accuracy. The algorithms work well on a real image of a muscle fibre cross-section image, and an additional parameter, which models the boundaries of the muscle fibres, is included in the final model.     

Modeling of Acoustic Signal Energies with a Generalized Frank Copula. A Linguistic Conjecture is Reviewed

In this article a generalized Frank copula was selected to model the dependence between the energy on two frequency bands of the speech signal, coming from eight languages. An algorithm was developed that uses maximum likelihood to choose the best fitting copula’s parameters. Through bootstrap, the algorithm estimates the variability of the parameters for each language and also computes confidence regions by means of Voronoi tesselations. A linguistic conjecture which claims that the languages are organized in three rhythmic classes, was confirmed by the Voronoi regions. Modeling with a uniparametric Frank copula, the different degrees of dependence between the energies were quantified.     

Spatial bootstrapped microeconometrics: Forecasting for out-of-sample geo-locations in big data

Spatial econometric models estimated on the big geo-located point data have at least two problems: limited computational capabilities and inefficient forecasting for the new out-of-sample geo-points. This is because of spatial weights matrix W defined for in-sample observations only and the computational complexity. Machine learning models suffer the same when using kriging for predictions; thus this problem still remains unsolved. The paper presents a novel methodology for estimating spatial models on big data and predicting in new locations. The approach uses bootstrap and tessellation to calibrate both model and space. The best bootstrapped model is selected with the PAM (Partitioning Around Medoids) algorithm by classifying the regression coefficients jointly in a nonindependent manner. Voronoi polygons for the geo-points used in the best model allow for a representative space division. New out-of-sample points are assigned to tessellation tiles and linked to the spatial weights matrix as a replacement for an original point what makes feasible usage of calibrated spatial models as a forecasting tool for new locations. There is no trade-off between forecast quality and computational efficiency in this approach. An empirical example illustrates a model for business locations and firms' profitability.     

Non-stationary partition modeling of geostatistical data for malaria risk mapping

The most common assumption in geostatistical modeling of malaria is stationarity, that is spatial correlation is a function of the separation vector between locations. However, local factors (environmental or human-related activities) may influence geographical dependence in malaria transmission differently at different locations, introducing non-stationarity. Ignoring this characteristic in malaria spatial modeling may lead to inaccurate estimates of the standard errors for both the covariate effects and the predictions. In this paper, a model based on random Voronoi tessellation that takes into account non-stationarity was developed. In particular, the spatial domain was partitioned into sub-regions (tiles), a stationary spatial process was assumed within each tile and between-tile correlation was taken into account. The number and configuration of the sub-regions are treated as random parameters in the model and inference is made using reversible jump Markov chain Monte Carlo simulation. This methodology was applied to analyze malaria survey data from Mali and to produce a country-level smooth map of malaria risk.     

Markov chain Monte Carlo estimation of a mixture item response theory model

Markov chain Monte Carlo (MCMC) algorithms have been shown to be useful for estimation of complex item response theory (IRT) models. Although an MCMC algorithm can be very useful, it also requires care in use and interpretation of results. In particular, MCMC algorithms generally make extensive use of priors on model parameters. In this paper, MCMC estimation is illustrated using a simple mixture IRT model, a mixture Rasch model (MRM), to demonstrate how the algorithm operates and how results may be affected by some commonly used priors. Priors on the probabilities of mixtures, label switching, model selection, metric anchoring, and implementation of the MCMC algorithm using WinBUGS are described, and their effects illustrated on parameter recovery in practical testing situations. In addition, an example is presented in which an MRM is fitted to a set of educational test data using the MCMC algorithm and a comparison is illustrated with results from three existing maximum likelihood estimation methods.     

Value at risk estimation under stochastic volatility models using adaptive PMCMC methods

In this paper, we propose a value-at-risk (VaR) estimation technique based on a new stochastic volatility model with leverage effect, nonconstant conditional mean and jump. In order to estimate the model parameters and latent state variables, we integrate the particle filter and adaptive Markov Chain Monte Carlo (MCMC) algorithms to develop a novel adaptive particle MCMC (A-PMCMC) algorithm. Comprehensive simulation experiments based on three stock indices and two foreign exchange time series show effectiveness of the proposed A-PMCMC algorithm and the VaR estimation technique.     

Forward Simulation Markov Chain Monte Carlo with Applications to Stochastic Epidemic Models

For many stochastic models, it is difficult to make inference about the model parameters because it is impossible to write down a tractable likelihood given the observed data. A common solution is data augmentation in a Markov chain Monte Carlo (MCMC) framework. However, there are statistical problems where this approach has proved infeasible but where simulation from the model is straightforward leading to the popularity of the approximate Bayesian computation algorithm. We introduce a forward simulation MCMC (fsMCMC) algorithm, which is primarily based upon simulation from the model. The fsMCMC algorithm formulates the simulation of the process explicitly as a data augmentation problem. By exploiting non‐centred parameterizations, an efficient MCMC updating schema for the parameters and augmented data is introduced, whilst maintaining straightforward simulation from the model. The fsMCMC algorithm is successfully applied to two distinct epidemic models including a birth–death–mutation model that has only previously been analysed using approximate Bayesian computation methods.     

Simulation of the typical Poisson–Voronoi–Cox–Voronoi cell

We consider stationary Poisson–Voronoi tessellations (PVT) in the Euclidean plane and study the properties of Voronoi tessellations induced by linear Poisson processes on the edges of the PVT. We are especially interested in simulation algorithms for the typical cell. Two different simulation algorithms are introduced. The first algorithm directly simulates the typical cell, whereas the second algorithm simulates cells from which distributional properties of the typical cell can be obtained. This second algorithm can also be used for simulating the typical cell of other Cox–Voronoi tessellations. The implementation of both algorithms is tested for their correctness using random software tests. Then different cell characteristics are studied by simulation and compared with the typical cell of PVT and Cox–Voronoi tessellations based on linear Poisson processes on the lines of Poisson line processes. Our results can be applied, for example, in the analysis of telecommunication networks and vesicle paths on cytoskeletal networks.     

Augmentation schemes for particle MCMC

Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic process, and MCMC moves to propose new values for the parameters. We show how particle MCMC can be generalised beyond this. Our key idea is to introduce new latent variables. We then use the MCMC moves to update the latent variables, and the particle filter to propose new values for the parameters and stochastic process given the latent variables. A generic way of defining these latent variables is to model them as pseudo-observations of the parameters or of the stochastic process. By choosing the amount of information these latent variables have about the parameters and the stochastic process we can often improve the mixing of the particle MCMC algorithm by trading off the Monte Carlo error of the particle filter and the mixing of the MCMC moves. We show that using pseudo-observations within particle MCMC can improve its efficiency in certain scenarios: dealing with initialisation problems of the particle filter; speeding up the mixing of particle Gibbs when there is strong dependence between the parameters and the stochastic process; and enabling further MCMC steps to be used within the particle filter.     

Coupling random inputs for parameter estimation in complex models

Complex stochastic models, such as individual-based models, are becoming increasingly popular. However this complexity can often mean that the likelihood is intractable. Performing parameter estimation on the model can then be difficult. One way of doing this when the complex model is relatively quick to simulate from is approximate Bayesian computation (ABC). Rejection-ABC algorithm is not always efficient so numerous other algorithms have been proposed. One such method is ABC with Markov chain Monte Carlo (ABC–MCMC). Unfortunately for some models this method does not perform well and some alternatives have been proposed including the fsMCMC algorithm (Neal and Huang, in: Scand J Stat 42:378–396, 2015) that explores the random inputs space as well unknown model parameters. In this paper we extend the fsMCMC algorithm and take advantage of the joint parameter and random input space in order to get better mixing of the Markov Chain. We also introduce a Gibbs step that conditions on the current accepted model and allows the parameters to move as well as the random inputs conditional on this accepted model. We show empirically that this improves the efficiency of the ABC–MCMC algorithm on a queuing model and an individual-based model of the group-living bird, the woodhoopoe.     

A random effects model for diseases with heterogeneous rates of infection

One form of data collected in the study of infectious diseases is on the transmission of a disease within households. We consider a model which allows the rate of disease transmission to vary between households. A Bayesian hierarchical approach to fitting the model is proposed and is implemented by the Metropolis–Hastings algorithm, a standard Markov chain Monte Carlo (MCMC) method. Results are presented for both simulated epidemic chain data and the Providence measles data, illustrating the potential that MCMC methods have to dealing with heterogeneity in infectious disease transmission.     

Double Generalized Spatial Econometric Models

The authors offer a unified method extending traditional spatial dependence with normally distributed error terms to a new class of spatial models based on the biparametric exponential family of distributions. Joint modeling of the mean and variance (or precision) parameters is proposed in this family of distributions, including spatial correlation. The proposed models are applied for analyzing Colombian land concentration, assuming that the variable of interest follows normal, gamma, and beta distributions. In all cases, the models were fitted using Bayesian methodology with the Markov Chain Monte Carlo (MCMC) algorithm for sampling from joint posterior distribution of the model parameters.     

Bayesian analysis of generalized elliptical semi-parametric models

In this paper, we study the statistical inference based on the Bayesian approach for regression models with the assumption that independent additive errors follow normal, Student-t, slash, contaminated normal, Laplace or symmetric hyperbolic distribution, where both location and dispersion parameters of the response variable distribution include nonparametric additive components approximated by B-splines. This class of models provides a rich set of symmetric distributions for the model error. Some of these distributions have heavier or lighter tails than the normal as well as different levels of kurtosis. In order to draw samples of the posterior distribution of the interest parameters, we propose an efficient Markov Chain Monte Carlo (MCMC) algorithm, which combines Gibbs sampler and Metropolis–Hastings algorithms. The performance of the proposed MCMC algorithm is assessed through simulation experiments. We apply the proposed methodology to a real data set. The proposed methodology is implemented in the R package BayesGESM using the function gesm().     

Adaptive evolutionary Monte Carlo algorithm for optimization with applications to sensor placement problems

In this paper, we present an adaptive evolutionary Monte Carlo algorithm (AEMC), which combines a tree-based predictive model with an evolutionary Monte Carlo sampling procedure for the purpose of global optimization. Our development is motivated by sensor placement applications in engineering, which requires optimizing certain complicated “black-box” objective function. The proposed method is able to enhance the optimization efficiency and effectiveness as compared to a few alternative strategies. AEMC falls into the category of adaptive Markov chain Monte Carlo (MCMC) algorithms and is the first adaptive MCMC algorithm that simulates multiple Markov chains in parallel. A theorem about the ergodicity property of the AEMC algorithm is stated and proven. We demonstrate the advantages of the proposed method by applying it to a sensor placement problem in a manufacturing process, as well as to a standard Griewank test function.     

Bayesian Analysis of Two-Regime Threshold Autoregressive Moving Average Model with Exogenous Inputs

We consider Bayesian analysis of threshold autoregressive moving average model with exogenous inputs (TARMAX). In order to obtain the desired marginal posterior distributions of all parameters including the threshold value of the two-regime TARMAX model, we use two different Markov chain Monte Carlo (MCMC) methods to apply Gibbs sampler with Metropolis-Hastings algorithm. The first one is used to obtain iterative least squares estimates of the parameters. The second one includes two MCMC stages for estimate the desired marginal posterior distributions and the parameters. Simulation experiments and a real data example show support to our approaches.     

Inference on unknown parameters of a Burr distribution under hybrid censoring

Based on hybrid censored data, the problem of making statistical inference on parameters of a two parameter Burr Type XII distribution is taken up. The maximum likelihood estimates are developed for the unknown parameters using the EM algorithm. Fisher information matrix is obtained by applying missing value principle and is further utilized for constructing the approximate confidence intervals. Some Bayes estimates and the corresponding highest posterior density intervals of the unknown parameters are also obtained. Lindley’s approximation method and a Markov Chain Monte Carlo (MCMC) technique have been applied to evaluate these Bayes estimates. Further, MCMC samples are utilized to construct the highest posterior density intervals as well. A numerical comparison is made between proposed estimates in terms of their mean square error values and comments are given. Finally, two data sets are analyzed using proposed methods.     

Bayesian analysis of panel data using an MTAR model

Bayesian analysis of panel data using a class of momentum threshold autoregressive (MTAR) models is considered. Posterior estimation of parameters of the MTAR models is done by using a simple Markov Chain Monte Carlo (MCMC) algorithm. Selection of appropriate differenced variables, test for asymmetry and unit roots are recast as model selections and a simple way of computing posterior probabilities of the candidate models is proposed. The proposed method is applied to the yearly unemployment rates of 51 US states and the results show strong evidence of stationarity and asymmetry.