PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Analysis of Kinship Relations with Pajek
Vladimir Batagelj and Andrej Mrvar
Social Science Computer Review Volume 26, Number 2, pp. 224-246, 2008.

Abstract

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.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:5389
Deposited By:Vladimir Batagelj
Deposited On:27 March 2009

[Edit]