cs_department — Aarhus Computer Science department relationships

Description

A multiplex network of five kinds of relationships among 61 employees of the Department of Computer Science at Aarhus University, Denmark, collected by M. Magnani, B. Micenková and L. Rossi. The relationships, one per layer, are: having lunch together regularly (lunch), being friends on Facebook (facebook), having co-authored a publication (coauthor), doing leisure activities together (leisure), and working together (work). Nodes are employees, and an undirected edge in a layer connects two employees that have the corresponding relationship (a pair of employees can thus be connected by one edge per layer). The data were made available as a multiplex network by M. De Domenico.

The network has the following properties:

Nodes: name and nodeLabel, the anonymized identifier of the employee (e.g. U102).
Edges: layer, the relationship (1: lunch, 2: Facebook, 3: co-authorship, 4: leisure, 5: work; the names are stored in the graph property layer_key); weight, which is always 1.

Tags

Social Relationships Multilayer Unweighted

Citation

Matteo Magnani, Barbora Micenkova, and Luca Rossi, "Combinatorial Analysis of Multiple Networks." arXiv:1303.4986 (2013) arXiv:1303.4986

Upstream URL OK

https://manliodedomenico.com/data.php

Upstream license

Open Data Commons Open Database License (ODbL), https://opendatacommons.org/licenses/odbl/

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
cs_department	61	620	20.33	11.22	13.78	4.46	0.03	0.52	4	1.00	Undirected	Unipartite	name nodeLabel	weight layer	2 KiB	4 KiB	4 KiB	3 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.