Finding Matrimonial Circuits in some AmerindianKinship Networks: an Experimental Study
Finding Matrimonial Circuits in some AmerindianKinship Networks: an Experimental Study We consider the problem of deciding the existenceof matrimonial circuits, and finding implexa in kinship networks.These networks can be modeled by acyclic digraphs. A mat-rimonial circuit can be seen as vertex-disjoint directed pathsfrom special starting to special ending vertices of these acyclicdigraphs. An implex is the set of all matrimonial circuits ofa given pair of special vertices. We present methods based onEppstein’s reduction [3] and algorithms for finding junctions [5]to decide the existence of matrimonial circuits. The efficiencyof these methods is shown in our empirical results on sevenAmerindian kinship networks. To enumerate all implexa, wepresent an algorithm, given that the kinship network is limited.We present some descriptive statistics which help us to justifythe good performance of the methods. We incorporate to oursoftware tool, the Kinship Machine [2], a feature to enume...
