Reversible jump methods are the most commonly used Markov chain Monte Carlo tool for exploring variable dimension statistical models. Recently, however, an alternative approach based on birth-and-death processes has been proposed by Stephens for mixtures of distributions. We show that the...

Importance sampling methods can be iterated like MCMC algorithms, while being more robust against dependence and starting values. The population Monte Carlo principle consists of iterated generations of importance samples, with importance functions depending on the previously generated...

Importance sampling methods can be iterated like MCMC algorithms, while being more robust against dependence and starting values. The population Monte Carlo principle consists of iterated generations of importance samples, with importance functions depending on the previously generated...

Reversible jump methods are the most commonly used Markov chain Monte Carlo tool for exploring variable dimension statistical models. Recently, however, an alternative approach based on birth-and-death processes has been proposed by Stephens for mixtures of distributions. We show that the...

We propose a generic on-line (also sometimes called adaptive or recursive) version of the expectation-maximization (EM) algorithm applicable to latent variable models of independent observations. Compared with the algorithm of Titterington, this approach is more directly connected to the usual...

The Cox-Ingersoll-Ross model is a diffusion process suitable for modeling the term structure of interest rates. In this paper, we consider estimation of the parameters of this process from observations at equidistant time points. We study two estimators based on conditional least squares as well...

Heterogeneity in patient populations is an important issue in health economic evaluations, as the cost-effectiveness of an intervention can vary between patient subgroups, and an intervention which is not cost-effective in the overall population may be cost-effective in particular subgroups....

We study simulated annealing algorithms to maximise a function [psi] on a subset of . In classical simulated annealing, given a current state [theta]n in stage n of the algorithm, the probability to accept a proposed state z at which [psi] is smaller, is exp(-[beta]n+1([psi](z)-[psi]([theta]n))...

In two recent papers, Granger and Ding (1995a,b) considered long return series that are first differences of logarithmed price series or price indices. They established a set of temporal and distributional properties for such series and suggested that the returns are well characterized by the...

In two recent papers, Granger and Ding (1995a, b) considered long return series that are first differences of logarithmed price series or price indices. They established a set of temporal and distributional properties for such series and suggested that the returns are well characterized by the...