Casella and Robert (1996) presented a general Rao--Blackwellisation principle for accept-reject and Metropolis-Hastings schemes that leads to significant decreases in the variance of the resulting estimators, but at a high cost in computing and storage. Adopting a completely different...

Maximum likelihood estimation of the persistence parameter in the discrete time unit root model is known for suffering from a downward bias. The bias is more pronounced in the continuous time unit root model. Recently Chambers and Kyriacou (2010) introduced a new jackknife method to remove the...

Maximum likelihood estimation of the persistence parameter in the discrete time unit root model is known for suffering from a downward bias. The bias is more pronounced in the continuous time unit root model. Recently Chambers and Kyriacou (2010) introduced a new jackknife method to remove the...

A new jackknife method is introduced to remove the first order bias in unit root models. It is optimal in the sense that it minimizes the variance among all the jackknife estimators of the form considered in Phillips and Yu (2005) and Chambers and Kyriacou (2013) after the number of subsamples...

Monte Carlo methods are now an essential part of the statistician's toolbox, to the point of being more familiar to graduate students than the measure theoretic notions upon which they are based! We recall in this note some of the advances made in the design of Monte Carlo techniques towards...

This paper deals with some computational aspects in the Bayesian analysis of statistical models with intractable normalizing constants. In the presence of intractable normalizing constants in the likelihood function, traditional MCMC methods cannot be applied. We propose an approach to sample...

While Robert and Rousseau (2010) addressed the foundational aspects of Bayesian analysis, the current chapter details its practical aspects through a review of the computational methods available for approximating Bayesian procedures. Recent innovations like Monte Carlo Markov chain, sequential...

Gibbs sampling has had great success in the analysis of mixture models. In particular, the “latent variable” formulation of the mixture model greatly reduces computational complexity. However, one failing of this approach is the possible existence of almost-absorbing states, called trapping...

Gibbs sampling has had great success in the analysis of mixture models. In particular, the “latent variable” formulation of the mixture model greatly reduces computational complexity. However, one failing of this approach is the possible existence of almost-absorbing states, called trapping...