moreno_sociograms — Moreno's sociograms (1934)

Description: Relationships between pupils in a classroom, from the sociograms of the "class structure" of eight school classes, from the 1st to the 8th grade, published by J. L. Moreno and H. H. Jennings in 1934, as transcribed by M. Grandjean. There is one network for each class, named grade_1 to grade_8. Nodes are pupils, identified by their initials in the original sociograms (vertex property name; pupils with the same initials are distinguished by a "1" and a "2"), and a directed edge exists if the source wants to sit next to the target. Each child could only choose two others (in the transcription, a few pupils have one or three choices).

Tags

Social Offline Unweighted

Citation

Jacob Levy Moreno, “Who Shall Survive? A New Approach to the Problem of Human Interrelations”, Washington D.C.: Nervous and Mental Disease Publishing Co. 10.1037/10648-000 Sci-Hub
Martin Grandjean, “Moreno's Sociograms” (2018) 10.5281/zenodo.1998343 Sci-Hub

Upstream URL OK

https://github.com/grandjeanmartin/sociograms

Upstream license

CC BY-SA 4.0, https://creativecommons.org/licenses/by-sa/4.0/

Networks

Tip: click on a column header to sort the list, or hover over it 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	gt	GraphML	GML	csv
grade_1	35	67	1.91	2.86	3.50	4.35	-0.24	0.13	5	1.00	Directed	Unipartite	name	1 KiB	2 KiB	1 KiB	1 KiB
grade_2	29	59	2.03	3.02	3.00	10.28	-0.26	0.14	5	1.00	Directed	Unipartite	name	1 KiB	1 KiB	1 KiB	1 KiB
grade_3	33	64	1.94	1.61	2.50	22.69	0.06	0.27	8	1.00	Directed	Unipartite	name	1 KiB	2 KiB	1 KiB	1 KiB
grade_4	33	63	1.91	1.62	2.16	65.23	-0.20	0.31	11	0.94	Directed	Unipartite	name	1 KiB	2 KiB	1 KiB	1 KiB
grade_5	45	69	1.53	1.51	2.23	76.36	0.14	0.27	12	0.76	Directed	Unipartite	name	1 KiB	2 KiB	1 KiB	1 KiB
grade_6	43	80	1.86	1.65	2.37	48.03	-0.02	0.27	11	0.51	Directed	Unipartite	name	1 KiB	2 KiB	1 KiB	1 KiB
grade_7	32	64	2.00	1.82	2.50	42.39	-0.18	0.15	8	1.00	Directed	Unipartite	name	1 KiB	2 KiB	1 KiB	1 KiB
grade_8	55	88	1.60	1.84	2.61	27.93	-0.04	0.16	11	1.00	Directed	Unipartite	name	1 KiB	2 KiB	2 KiB	2 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.