**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

Code | AN |

Category | ⬤ Lexical |

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

Vertex type | Word |

Edge type | Adjacency |

Format | Undirected |

Edge weights | Unweighted |

Metadata | Entity Missing orientation |

Size | 112 vertices (words) |

Volume | 425 edges (adjacencies) |

Average degree | 7.5893 edges / vertex |

Fill | 0.068372 edges / vertex^{2} |

Maximum degree | 49 edges |

Size of LCC | 112 vertices (network is connected) |

Wedge count | 5,429 |

Claw count | 39,977 |

Triangle count | 284 |

Square count | 2,579 |

4-tour count | 43,198 |

Power law exponent (estimated) with d_{min} | 3.6210 (d_{min} = 10) |

Gini coefficient | 41.7% |

Relative edge distribution entropy | 93.5% |

Assortativity | –0.12935 |

Clustering coefficient | 15.7% |

Diameter | 5 edges |

90-percentile effective diameter | 2.98 edges |

Mean shortest path length | 2.47 edges |

Spectral norm | 13.150 |

Algebraic connectivity | 0.69502 |

## Downloads

TSV file: | adjnoun_adjacency.tar.bz2 (2.92 KiB) |

Extraction code: | adjnoun.tar.bz2 (15.26 KiB) |