Enumeration and Simulation of Marriage Node Graphs on Zero Loop Pedigrees
Alun Thomas, (University of Utah), firstname.lastname@example.org, and
Chris Cannings, (University of Sheffield), email@example.com
We present a method that for the marriage node graph of any zero loop pedigree will enumerate all possible pedigrees that share the same underlying tree structure. The enumeration method leads naturally to a scheme for simulating from a uniform distribution on such pedigrees. This is extended to simulating pedigrees for which the underlying marriage node graph is a tree of any particular size, and to the case when the number of individuals and the number of marriages can be independently specified.