lesmis — Les Misérables coappearances

Description

The network of co-appearances of characters in Victor Hugo's novel "Les Misérables". Nodes are characters, and an undirected edge connects two characters that appear in the same chapter of the book. The co-appearance data were compiled by D. E. Knuth for the Stanford GraphBase, and the network was assembled by M. E. J. Newman.

The network has the following properties:

label: the name of the character.
value (edges): the number of chapters in which the two characters appear together.

Tags

Social Fictional Weighted

Citation

D. E. Knuth, "The Stanford GraphBase: A Platform for Combinatorial Computing." Addison-Wesley, Reading, MA (1993). www-cs-faculty.stanford.edu

Upstream URL OK

http://www-personal.umich.edu/~mejn/netdata

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
lesmis	77	254	6.60	6.00	10.75	10.84	-0.17	0.50	5	1.00	Undirected	Unipartite	label	value	2 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.