PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Analysis of kinship relations with Pajek
Vladimir Batagelj and Andrej Mrvar
Soc. sci. comput. rev. Volume 26, Number 2, pp. 224-246, 2008. ISSN 0894-4393

Abstract

In the article, 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, p-graphs, or bipartite p-graphs. We show that p-graphs are more suitable for searching for relinking patterns, whereas Ore graphs are better for computing kinship relations using matrix multiplication. Algorithms described in this article are implemented in the program Pajek.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8179
Deposited By:Boris Horvat
Deposited On:21 February 2012