This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm in order to maximize the efficiency of the algorithm. The main result is a… Expand

SUMMARY We propose a method for rejection sampling from any univariate log-concave probability density function. The method is adaptive: as sampling proceeds, the rejection envelope and the squeezing… Expand

Markov chain Monte Carlo (MCMC) is a technique for estimating by simulation the expectation of a statistic in a complex model. Successive random selections form a Markov chain, the stationary… Expand

The purpose of this study is to develop permutation test statistics that can be used to analyse cospeciation in three phylogenies. The null hypothesis, H0, is that the three phylogenies are not… Expand