konect logo
KONECT
KONECT > Networks > David Copperfield

David Copperfield

About this network

This is the undirected network of common noun and adjective adjacencies for the novel "David Copperfield" by English 19th century writer Charles Dickens. A node represents either a noun or an adjective. An edge connects two words that occur in adjacent positions. The network is not bipartite, i.e., there are edges connecting adjectives with adjectives, nouns with nouns and adjectives with nouns.

Network info

Degree distribution of the David Copperfield network
Degree distribution
Degree distribution of the David Copperfield network
Degree distribution
Degree distribution of the David Copperfield network
Degree distribution
Clustering coefficient distribution of the David Copperfield network
Clustering coefficient distribution
Distance distribution of the David Copperfield network
Distance distribution
Distance distribution on a logistic scale of the David Copperfield network
Distance distribution on a logistic scale
Top-k eigenvalues of A of the David Copperfield network
Top-k eigenvalues of A
Top-k eigenvalues of N of the David Copperfield network
Top-k eigenvalues of N
Top-k eigenvalues of L of the David Copperfield network
Top-k eigenvalues of L
Spectral distribution of the eigenvalues of A of the David Copperfield network
Spectral distribution of the eigenvalues of A
Spectral distribution of the eigenvalues of N of the David Copperfield network
Spectral distribution of the eigenvalues of N
Spectral distribution of the eigenvalues of L of the David Copperfield network
Spectral distribution of the eigenvalues of L
Cumulative spectral distribution of A of the David Copperfield network
Cumulative spectral distribution of A
Cumulative spectral distribution of N of the David Copperfield network
Cumulative spectral distribution of N
Cumulative spectral distribution of L of the David Copperfield network
Cumulative spectral distribution of L
Eigenvectors of A of the David Copperfield network
Eigenvectors of A
Eigenvectors of L of the David Copperfield network
Eigenvectors of L

Layout

Layout of the David Copperfield network
Layout

Downloads

TSV file:downloadadjnoun_adjacency.tar.bz2 (2.92 KiB)
Extraction code:downloadadjnoun.tar.bz2 (15.26 KiB)

References

[1] David copperfield network dataset -- KONECT, April 2017. [ http ]
[2] Mark E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3), 2006.

BibTeX