Analysis of Kinship Relations with Pajek
In the paper two general approaches to analysis of large sparse networks are presented: fragment searching and matrix multiplication. These two approaches are applied to analysis of large genealogies. Genealogies can be represented as graphs in different ways: as Ore graphs, as p-graphs, or as bipartite p-graphs. We show that p-graphs are more suitable for searching for relinking patterns, while Ore graphs for computing kinship relations using matrix multiplication. Algorithms described in this paper are implemented in program Pajek.