logo Netzschleuder network catalog, repository, and centrifuge

7th_graders — Vickers 7th Graders (1981)

Description

A small multiplex network of social relations among the 29 students of a seventh-grade class in a school in Victoria, Australia, collected by M. Vickers. Students were asked to nominate their classmates on several relations, of which three form the layers of this network: who they get on with in the class (get_on_with), who their best friends in the class are (best_friends), and who they would prefer to work with (work_with). A directed edge $i \to j$ in a given layer means that student $i$ nominated student $j$ for that relation. The data were made available as a multiplex network by M. De Domenico.

Nodes are numbered from 0 to 28 (corresponding to students 1 to 29 in the original data); students 1 to 12 are boys, and 13 to 29 are girls.

The network has the following properties:

  • Edges: layer, the relation (1: get on with, 2: best friends, 3: work with; the names are stored in the graph property layer_key); weight, which is always 1 (the upstream data are unweighted).
Tags
Social Offline Multilayer Unweighted Metadata
Citation
  • M. Vickers and S. Chan, "Representing Classroom Social Structure." Melbourne: Victoria Institute of Secondary Education, (1981). scholar.google.com
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
7th_graders 29 740 25.52 20.34 17.73 1.71 -0.01 0.76 2 1.00 Directed Unipartite name weight layer 1 KiB 3 KiB 3 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.