Analysis of Kinship Relations With Pajek | Zendy

Vladimir Batagelj | Zendy; Andrej Mrvar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Analysis of Kinship Relations With Pajek

Author(s) -

Vladimir Batagelj,

Andrej Mrvar

Publication year - 2007

Publication title -

social science computer review

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.3

H-Index - 73

eISSN - 1552-8286

pISSN - 0894-4393

DOI - 10.1177/0894439307299587

Subject(s) - kinship , bipartite graph , multiplication (music) , computer science , theoretical computer science , matrix multiplication , combinatorics , mathematics , graph , sociology , physics , quantum mechanics , anthropology , quantum

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 network multiplication. Algorithms described in this article are implemented in the program Pajek.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research