In this paper we establish the theory of weak convergence (toward a normal distribution) for both single-chain and population stochastic approximation Markov chain Monte Carlo (MCMC) algorithms (SAMCMC algorithms). Based on the theory, we give an explicit ratio of convergence rates for the population SAMCMC algorithm and the single-chain SAMCMC algorithm. Our results provide a theoretic guarantee that the population SAMCMC algorithms are asymptotically more efficient than the single-chain SAMCMC algorithms when the gain factor sequence decreases slower than O(1 / t), where t indexes the number of iterations. This is of interest for practical applications.

The transition kernel of the well-known Metropolis-Hastings (MH) algorithm has a point mass at the chain’s current position, which prevent direct smoothness properties to be derived for the successive densities of marginals issued from this algorithm. We show here that under mild smoothness assumption on the MH algorithm “input” densities (the initial, proposal and target distributions), propagation of a Lipschitz condition for the iterative densities can be proved. This allows us to build a consistent nonparametric estimate of the entropy for these iterative densities. This theoretical study can be viewed as a building block for a more general MCMC evaluation tool grounded on such estimates.

In this paper, we present a Markov chain Monte Carlo (MCMC) simulation algorithm for estimating parameters in the kernel density estimation of bivariate insurance claim data via transformations. Our data set consists of two types of auto insurance claim costs and exhibits a high-level of skewness in the marginal empirical distributions. Therefore, the kernel density estimator based on original data does not perform well. However, the density of the original data can be estimated through estimating the density of the transformed data using kernels. It is well known that the performance of a kernel density estimator is mainly determined by the bandwidth, and only in a minor way by the kernel. In the current literature, there have been some developments in the area of estimating densities based on transformed data, where bandwidth selection usually depends on pre-determined transformation parameters. Moreover, in the bivariate situation, the transformation parameters were estimated for each dimension individually. We use a Bayesian sampling algorithm and present a Metropolis-Hastings sampling procedure to sample the bandwidth and transformation parameters from their posterior density. Our contribution is to estimate the bandwidths and transformation parameters simultaneously within a Metropolis-Hastings sampling procedure. Moreover, we demonstrate that the correlation between the two dimensions is better captured through the bivariate density estimator based on transformed data.

We introduce a class of Cox cluster processes called generalised shot noise Cox processes (GSNCPs), which extends the definition of shot noise Cox processes (SNCPs) in two directions: the point process that drives the shot noise is not necessarily Poisson, and the kernel of the shot noise can be random. Thereby, a very large class of models for aggregated or clustered point patterns is obtained. Due to the structure of GSNCPs, a number of useful results can be established. We focus first on deriving summary statistics for GSNCPs and, second, on how to simulate such processes. In particular, results on first- and second-order moment measures, reduced Palm distributions, the J-function, simulation with or without edge effects, and conditional simulation of the intensity function driving a GSNCP are given. Our results are exemplified in important special cases of GSNCPs, and we discuss their relation to the corresponding results for SNCPs.

Financial time series data are typically found to possess leptokurtic frequency distributions, time varying volatilities, outliers and correlation structures inconsistent with linear generating processes, nonlinear dependence, and dependencies between series that are not stable over time. Regime Switching Vector Autoregressions are of interest because they are capable of explaining the observed features of the data, can capture a variety of interactions between series, appear intuitively reasonable, are vector processes, and are now tractable.

This paper considers a vector autoregression subject to periodic structural changes. The parameters of a vector autoregression are modelled as the outcome of an unobserved discrete Markov process with unknown transition probabilities. The unobserved regimes, one for each time point, together with the regime transition probabilities, are determined in addition to the vector autoregression parameters within each regime.

A Bayesian Markov Chain Monte Carlo estimation procedure is developed which efficiently generates the posterior joint density of the parameters and the regimes. The complete likelihood surface is generated at the same time, enabling estimation of posterior model probabilities for use in non-nested model selection. The procedure can readily be extended to produce joint prediction densities for the variables, incorporating both parameter and model uncertainty.

Results using simulated and real data are provided. A clear separation of the variance between a stable and an unstable regime was observed. Ignoring regime shifts is very likely to produce misleading volatility estimates and is unlikely to be robust to outliers. A comparison with commonly used models suggests that Regime Switching Vector Autoregressions provide a particularly good description of the observed data.