An evolutionary model that satisfies detailed balance

  title={An evolutionary model that satisfies detailed balance},
  author={J{\"u}ri Lember and Chris Watkins},
We propose a class of evolutionary models that involves an arbitrary exchangeable process as the breeding process and different selection schemes. In those models, a new genome is born according to the breeding process, and then a genome is removed according to the selection scheme that involves fitness. Thus the population size remains constant. The process evolves according to a Markov chain, and, unlike in many other existing models, the stationary distribution -- so called mutation… Expand


Sex as Gibbs Sampling: a probability model of evolution
It is shown that evolutionary computation can be implemented as standard Markov-chain Monte-Carlo (MCMC) sampling, and that evolutionary processes in which selection acts by differences in fecundity are not reversible. Expand
Ancestral processes with selection: Branching and Moran models
Analytical results of Fearnhead (2002) are used to determine the explicit properties, and parameter dependence, of the ancestral distribution of types, and its relationship with the stationary distribution inforward time. Expand
A Markov Chain Monte Carlo version of the genetic algorithm Differential Evolution: easy Bayesian computing for real parameter spaces
  • C. Braak
  • Mathematics, Computer Science
  • Stat. Comput.
  • 2006
The essential ideas of DE and MCMC are integrated, resulting in Differential Evolution Markov Chain (DE-MC), a population MCMC algorithm, in which multiple chains are run in parallel, showing simplicity, speed of calculation and convergence, even for nearly collinear parameters and multimodal densities. Expand
Evolutionary MCMC Sampling and Optimization in Discrete Spaces
  • M. Strens
  • Mathematics, Computer Science
  • ICML
  • 2003
The links between genetic algorithms and population-based Markov Chain Monte Carlo methods are explored and a new "exclusive-or" operator is introduced as an alternative way to recombine population members to improve sampling performance in a medical diagnostic problem domain. Expand
Removing the Genetics from the Standard Genetic Algorithm
We present an abstraction of the genetic algorithm (GA), termed population-based incremental learning (PBIL), that explicitly maintains the statistics contained in a GA''s population, but whichExpand
Modeling Multiallelic Selection Using a Moran Model
We present a Moran-model approach to modeling general multiallelic selection in a finite population and show how it may be used to develop theoretical models of biological systems of balancingExpand
Scalable imputation of genetic data with a discrete fragmentation-coagulation process
A Bayesian nonparametric model for genetic sequence data in which a set of genetic sequences is modelled using a Markov model of partitions is presented, showing improved computational efficiency while maintaining accuracies comparable to other state-of-the-art genotype imputation methods. Expand
Probability models for DNA sequence evolution
This small book has five chapters, the first four of which cover theoretical population genetics, and the author did an admirable job in providing a concise and up-to-date summary of modern molecular population genetics. Expand
Genetic Algorithms and Explicit Search Statistics
  • S. Baluja
  • Mathematics, Computer Science
  • NIPS
  • 1996
In a large-scale empirical comparison of problems that have been reported in GA literature, it is shown that on many problems, simpler algorithms can perform significantly better than GAs. Expand
Mathematics of genetic diversity
The Neutral Alternative: Evolution in the Absence of Selection, A General Model for Mutation in Finite Populations, The Random Walk Case, The Frequency Spectrum, The Ewens Sampling Formula, The Poisson-Dirichlet Distribution, Partition Structures, Testing Neutrality Selection in Finites Populations. Expand