Simulation of ancestral selection graphs for Monte Carlo integration

Abstract

An ancestral selection graph is a realization of an genealogy-process model which incorporates natural selection. The space of ancestral graphs is a countable union of spaces of unequal dimensions. We give a Markov Chain Monte Carlo algorithm simulating ancestral selection graphs. Output can be used to estimate expectations for functions defined on the space of ancestral graphs.