Exploratory Social Network Analysis with Pajek
Exploratory Social Network Analysis with Pajek
Hi-index | 0.00 |
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.