Abstract
The article presents a series of new methods for analyzing the morphology of kinship networks via the study of matrimonial circuits (closed chains of kinship and marriage ties). The article gives a simple definition of matrimonial circuits in mixed graphs and introduces the technique of representing matrimonial circuit types by characteristic vectors. This technique is used to develop (1) an arithmetic approach to the algebra of circuit composition, (2) a method for the complete enumeration of matrimonial circuit types, and (3) an algorithm for finding and counting matrimonial circuits in empirical kinship networks. All methods have been implemented in the software Puck (Program for the Use and Computation of Kinship Data).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
