Given an admixture graph, selects a child edge and two parent edges, disconnects the child edge
from its original parent node and connects it to the two parent edges with an admixture event,
if possible. Thus, contrary to
add_an_admixture, the resulting graph need not be an
extension of the input graph in the sense that erasing one of the admixture edges we get
the original admixture graph. In practice, we know that when fitting data to admixture graphs,
the best graph with k admixture events is not always an extension like that from the best
graph with k - 1 admixture events. Most likely it doesn't need to be an extension like
this (the two new admixture edges can both go where ever) either.
add_an_admixture2(graph, admixture_variable_name, outgroup = "")
An admixture graph.
A name for the new admixture proportion.
An optional parameter for the preferred outgroup.
A list of graphs made by adding a new admixture event to the input graph. The list contains duplicate elements, and may even contain graphs with eyes (two inner nodes with the property that all the paths between any two leaves visits both or neither of them).
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.