kapferer_mine — Kapferer mine workers (1969)
- Description
Interactions among 15 men working on the surface of a mining operation in Zambia (then Northern Rhodesia), observed by B. Kapferer, who studied the development and resolution of a conflict among the workers. The conflict centered on two men, Abraham and Donald, and most workers ended up supporting Abraham. Kapferer recorded several types of interactions among the workers (conversation, joking, job assistance, cash assistance and personal assistance), but did not publish them; the available matrices only distinguish ties based on a single type of interaction from those based on several. These data were analyzed by P. Doreian (1974). The data were distributed by L. C. Freeman on his network data page at the University of California, Irvine (no longer online), from which this version was obtained via the Internet Archive.
uniplex: undirected edges between workers joined by a tie based on only one type of interaction.multiplex: undirected edges between workers joined by ties based on several types of interaction.
The networks have the following properties:
- Nodes:
name, the name of the worker.
- Tags
- Social Offline Unweighted Metadata
- Citation
-
- B. Kapferer, "Norms and the manipulation of relationships in a work context." In J. C. Mitchell (ed.), Social Networks in Urban Situations, Manchester University Press (1969) scholar.google.com
- P. Doreian, "On the connectivity of social networks." Journal of Mathematical Sociology 3(2), 245-258 (1974) 10.1080/0022250X.1974.9989837 Sci-Hub
- Upstream URL OK
- https://web.archive.org/web/20210115130726/http://moreno.ss.uci.edu/data.html#kapmine
- Networks
-
Tip: click on a column header to sort the list, or hover over it for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv uniplex 15 25 3.33 1.70 2.97 2.98 -0.36 0.15 5 1.00 Undirected Unipartite name 1 KiB 1 KiB 1 KiB 1 KiB multiplex 15 19 2.53 1.71 2.49 3.56 -0.14 0.18 4 0.87 Undirected Unipartite name 1 KiB 1 KiB 1 KiB 1 KiB