logo Netzschleuder network catalog, repository, and centrifuge

sawmill_strike — Informal communication in a sawmill on strike (1997)

Description

Informal communication among 24 employees of a wood-processing facility during a strike, studied by J. H. Michael. A new management team proposed changes to the workers' compensation package, which the workers did not accept; they started a strike, which led to a negotiation stalemate. Management then asked an outside consultant to analyze the communication structure among the employees. The consultant asked all employees to indicate the frequency with which they discussed the strike with each of their colleagues, on a five-point scale from "almost never" (less than once per week) to "very often" (several times per day), and two employees are connected if at least one of them indicated a frequency of three or more.

The network has the following properties:

  • (Node) name: the (pseudonymous) first name of the employee.
  • (Node) group: the age and language group of the employee (1: Spanish-speaking, 2: English-speaking and 30 years old or younger, 3: English-speaking and older than 30).
Tags
Social Offline Unweighted Metadata
Added
2026-10-25
Citation
  • J. H. Michael, "Labor dispute reconciliation in a forest products manufacturing facility." Forest Products Journal 47(11/12), 41-45 (1997) web.archive.org
  • W. de Nooy, A. Mrvar, V. Batagelj, "Exploratory Social Network Analysis with Pajek." Cambridge University Press (2005) 10.1017/CBO9780511806452 Sci-Hub
Upstream URL [Errno 111] Connection refused
https://web.archive.org/web/20040706125410/http://vlado.fmf.uni-lj.si/pub/networks/data/esna/strike.htm
Networks
Tip: hover over a column header 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
sawmill_strike 24 38 3.17 1.34 2.62 20.04 -0.03 0.35 6 1.00 Undirected Unipartite name group 1 KiB 2 KiB 1 KiB 1 KiB
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.