krebs_it_department — Krebs IT department collaborations
- Description
Work relationships among 56 employees of the IT department of a Fortune 500 company, collected by V. Krebs (unpublished, date unknown). The first 7 employees were administrative staff, the next 12 were together in a department, the next 17 in a second department, the following 17 in a third department, and the last 3 were executives. Each individual reported, for five kinds of links, the frequency of contact with each of the others. 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.
The network has five directed layers (relations), in which an edge (i, j) indicates that employee i reported the relation with employee j:
BUSINESS_1: "With whom do you work with in Business Process 1?"BUSINESS_2: "With whom do you work with in Business Process 2?"ADVICE: "Who do you seek for advice before making a key decision?"TECHNICAL: "Who do you seek for technical expertise in IT?"CUSTOMER: "With whom do you discuss customer needs and issues?"
The source data file is truncated: the last 100 values of the
CUSTOMERrelation (all the answers of the last employee, and 44 of the 56 answers of the second-to-last one, both executives) are missing, and are treated here as absent edges.The network has the following properties:
- Nodes:
name, the label of the employee;group, the group of the employee (as described above:admin,department1,department2,department3, orexecutive). - Edges:
layer, the relation;weight, the frequency of contact (1: yearly or less, 2: quarterly, 3: monthly, 4: weekly, 5: daily or more).
- Tags
- Social Offline Multilayer Weighted Metadata
- Citation
-
- V. Krebs, "Fortune 500 IT department", unpublished www.orgnet.com
- Upstream URL OK
- https://web.archive.org/web/20210115130726/http://moreno.ss.uci.edu/data.html#krebs
- 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