Designations used by companies to distinguish their products are often claimed as trademarks. All brand names and product names used in this book are trade names, service marks, trademarks or registered trademarks of their respective owners. The publisher is not associated with any product or vendor mentioned in this book.
This publication is designed to provide accurate and authoritative information in regard to the subject matter covered. It is sold on the understanding that the publisher is not engaged in rendering professional services. If professional advice or other expert assistance is required, the services of a competent professional should be sought.
An actively pursued research direction for alleviating the local‐trap problem suffered by the Metropolis‐Hastings (MH) algorithm is the population‐based MCMC, where a population of Markov chains are run in parallel, each equipped with possibly different but related invariant distributions.
This chapter describes the different ways of specifying the trial distributions and updating the population of Markov chains lead to different algorithms, such as adaptive direction sampling, conjugate gradient Monte Carlo, parallel tempering, evolutionary Monte Carlo, sequential parallel tempering, and equi‐energy sampler. The chapter then considers three applications of the evolutionary Monte Carlo (EMC) algorithm, including Bayesian curve fitting, protein folding simulations, and nonlinear time series forecasting.
Red Eagle crossed the dark river and stood before Jackson, waiting for death. But Jack-son, admiring his courage, allowed Red Eagle to leave in peace. Before long the Creeks and other tribes left Alabama, and settlers took the land.
