This paper presents a Markov chain Monte Carlo (MCMC) algorithm to estimate parameters and latent stochastic processes in the asymmetric stochastic volatility (SV) model, in which the Box-Cox transformation of the squared volatility follows an autoregressive Gaussian distribution and the...

Hypothesis testing using Bayes factors (BFs) is known not to be well dened under the improper prior. In the context of latent variable models, an additional problem with BFs is that they are difficult to compute. In this paper, a new Bayesian method, based on decision theory and the EM...

Vector Autoregression (VAR) has been a standard empirical tool used in macroeconomics and finance. In this paper we discuss how to compare alternative VAR models after they are estimated by Bayesian MCMC methods. In particular we apply a robust version of deviance information criterion (RDIC)...

It is shown in this paper that the data augmentation technique undermines the theoretical underpinnings of the deviance information criterion (DIC), a widely used information criterion for Bayesian model comparison, although it facilitates parameter estimation for latent variable models via...

It is shown in this paper that the data augmentation technique undermines the theoretical underpinnings of the deviance information criterion (DIC), a widely used information criterion for Bayesian model comparison, although it facilitates parameter estimation for latent variable models via...

In this article, we propose the Bayesian estimation of the parsimonious but effective GARCH(1,1) model with Normal innovations. We sample the parameters joint posterior distribution using the approach suggested by Nakatsuma (1998). As a first step, we fit the model to foreign exchange...

This note presents the R package bayesGARCH (Ardia, 2007) which provides functions for the Bayesian estimation of the parsimonious and effective GARCH(1,1) model with Student-<I>t</I> innovations. The estimation procedure is fully automatic and thus avoids the tedious task of tuning a MCMC sampling...</i>

In 1996, Propp and Wilson introduced coupling from the past (CFTP), an algorithm for generating a sample from the exact stationary distribution of a Markov chain. In 1998, Fill proposed another so–called perfect sampling algorithm. These algorithms have enormous potential in Markov Chain Monte...

In this paper, I develop and estimate a dynamic model of strategic network formation with heterogeneous agents. The main theoretical result is the existence of a unique stationary equilibrium, which characterizes the probability of observing a specific network in the data. As a consequence, the...

Adaptive Polar Sampling (APS) is proposed as a Markov chain Monte Carlo method for Bayesian analysis of models with ill-behaved posterior distributions. In order to sample efficiently from such a distribution, a location-scale transformation and a transformation to polar coordinates are used....