Combinatorial and stochastic properties of ranked tree‐child networks
Combinatorial and stochastic properties of ranked tree‐child networks
Abstract Tree‐child networks are a class of directed acyclic graphs that have recently risen to prominence in phylogenetics. Although these networks have numerous, attractive mathematical properties, many combinatorial questions concerning them remain intractable. We show that endowing tree‐child networks with a biologically relevant ranking structure yields mathematically tractable objects, which …