logo Netzschleuder network catalogue, repository, and centrifuge

australian_bank — Australian bank branch relations (2000)

Description

Relations among the 11 employees of a branch of a large Australian bank, from a study by G. Robins of the structure of several branches, analyzed by P. Pattison, S. Wasserman, G. Robins and A. M. Kanfer (2000). 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 four directed layers (relations), in which an edge (i, j) indicates that employee i named employee j in response to the questions:

  • advice-seeking: "With whom might you check out a course of action if an issue arises in your work?"
  • satisfying: "With whom do you feel that your work interactions are particularly satisfying?"
  • confiding: "In whom do you feel you would be able to confide if a problem arose that you did not want everyone to know about?"
  • close friend: "Whom do you consider to be a particularly close friend?"

The network has the following properties:

  • Nodes: position, the job of the employee (the first is the branch manager, the second the deputy manager, the third, fourth and fifth are service advisers, a middle-ranking position, and the others are tellers).
  • Edges: layer, the relation.
Tags
Social Offline Multilayer Unweighted Metadata
Citation
  • P. Pattison, S. Wasserman, G. Robins, A. M. Kanfer, "Statistical evaluation of algebraic constraints for social networks." Journal of Mathematical Psychology 44(4), 536-568 (2000) 10.1006/jmps.1999.1261 Sci-Hub
Upstream URL OK
https://web.archive.org/web/20210115130726/http://moreno.ss.uci.edu/data.html#bank
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
australian_bank 11 128 11.64 7.45 7.56 0.85 -0.19 0.79 2 1.00 Directed Unipartite position layer 1 KiB 1 KiB 1 KiB 1 KiB