adjnoun — Word adjacencies of David Copperfield

Description

A network of adjacencies between common adjectives and nouns in the novel "David Copperfield" by Charles Dickens, compiled by M. E. J. Newman. Nodes are the 112 most commonly occurring adjectives and nouns in the book, and an undirected edge connects two words if they occur in adjacent positions anywhere in the text. Since in English adjectives typically precede nouns, the network is approximately bipartite, and it has been used as a test case for community detection and for detecting disassortative structure.

The network has the following properties:

(Node) label: the word.
(Node) value: the word class (0 for adjectives, 1 for nouns).

Tags

Informational Language Unweighted

Added

2020-08-11

Citation

M.E.J. Newman, "Finding community structure in networks using the eigenvectors of matrices." Phys. Rev. E 74, 036104 (2006). 10.1103/PhysRevE.74.036104 Sci-Hub

Upstream URL OK

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

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
adjnoun	112	425	7.59	6.85	11.54	2.27	-0.13	0.16	5	1.00	Undirected	Unipartite	label value		3 KiB	5 KiB	5 KiB	4 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.