logo Netzschleuder network catalogue, repository, and centrifuge

bank_wiring_room — Bank wiring room (1939)

Description

Observed interactions among 14 employees of the bank wiring room of the Western Electric Company (Hawthorne plant, Chicago), from the Hawthorne studies, first presented by F. J. Roethlisberger and W. J. Dickson (1939). The data became better known through the analysis of G. Homans (1950), and the blockmodel (CONCOR) analysis of R. Breiger, S. Boorman and P. Arabie (1975). The employees worked in a single room, and include two inspectors (I1 and I3), three solderers (S1, S2 and S3), and nine wiremen or assemblers (W1 to W9). 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.

Nodes are employees, and in each network an edge connects two employees who were observed engaging in the corresponding relation with each other. The six relations are given as separate networks:

  • RDGAM: participation in horseplay (games), undirected.
  • RDCON: participation in arguments about open windows (controversy), undirected.
  • RDPOS: friendship (positive relations), undirected.
  • RDNEG: antagonistic (negative) behavior, undirected.
  • RDHLP: helping others with work, directed; an edge (i, j) indicates that i helped j.
  • RDJOB: trading of job assignments, directed (the meaning of the edge direction is not documented).

The networks have the following properties:

  • Nodes: name, the label of the employee (I: inspector, S: solderer, W: wireman).
  • RDJOB: Edges: weight, the number of times the workers traded job assignments.
Tags
Social Offline Unweighted Metadata
Citation
  • F. J. Roethlisberger, W. J. Dickson, "Management and the Worker." Harvard University Press (1939) scholar.google.com
  • R. L. Breiger, S. A. Boorman, P. Arabie, "An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling." Journal of Mathematical Psychology 12(3), 328-383 (1975) 10.1016/0022-2496(75)90028-0 Sci-Hub
Upstream URL OK
https://web.archive.org/web/20210115130726/http://moreno.ss.uci.edu/data.html#wiring
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
RDGAM 14 28 4.00 1.89 4.23 16.50 0.33 0.80 4 0.86 Undirected Unipartite name 1 KiB 1 KiB 1 KiB 1 KiB
RDCON 14 19 2.71 2.49 3.91 0.80 -0.25 0.67 2 0.57 Undirected Unipartite name 1 KiB 1 KiB 1 KiB 1 KiB
RDPOS 14 13 1.86 1.55 2.10 9.21 -0.20 0.64 5 0.64 Undirected Unipartite name 1 KiB 1 KiB 1 KiB 1 KiB
RDNEG 14 19 2.71 2.34 2.94 1.65 -0.63 0.25 3 0.86 Undirected Unipartite name 1 KiB 1 KiB 1 KiB 1 KiB
RDHLP 14 24 1.71 2.09 3.08 2.43 -0.21 0.29 3 0.86 Directed Unipartite name 1 KiB 1 KiB 1 KiB 1 KiB
RDJOB 14 7 0.50 1.07 1.00 4.26 -0.47 0.00 4 0.50 Directed Bipartite name weight 1 KiB 1 KiB 1 KiB 1 KiB