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.
@article{896, title = {Simulation of ancestral selection graphs for Monte Carlo integration}, journal = {ANZIAM Journal}, volume = {45}, year = {2004}, doi = {10.21914/anziamj.v45i0.896}, language = {EN}, url = {http://dml.mathdoc.fr/item/896} }
Cloete, Nicoleen; Nicholls, Geoff K.; Scott, David J. Simulation of ancestral selection graphs for Monte Carlo integration. ANZIAM Journal, Tome 45 (2004) . doi : 10.21914/anziamj.v45i0.896. http://gdmltest.u-ga.fr/item/896/