ACL Anthology Network (All About NLP) (beta) The Association Of Computational Linguistics Anthology Network |

- A directed network
- Nodes represent papers
- Edges represent a reference in one paper to another
- Many papers include references to papers outside of the network. These edges have been dropped.
- Disconnected nodes have not been included.

- nodes: 18164
- edges: 110975
- diameter:
- average degree: 12.22
- largest connected component size: 17958
- Degree statistics:
- in degree stats:
- power law exponent: 2.46 r-squared: 0.98
- not a power law relationship (p = 2.00)
- Newman power law exponent: 1.92, error: 0.01
- out degree stats:
- power law exponent: 3.62 r-squared: 0.87
- not a power law relationship (p = 2.00)
- Newman power law exponent: 1.92, error: 0.01
- total degree stats:
- power law exponent: 2.69 r-squared: 0.97
- not a power law relationship (p = 2.00)
- Newman power law exponent: 1.69, error: 0.00
- Clustering:
- Watts Strogatz clustering coefficient: 0.1803
- Newman clustering coefficient: 0.0631
- clairlib avg. directed shortest path: 5.82
- Ferrer avg. directed shortest path: 5.52
- harmonic mean geodesic distance: 56.03

- A directed network
- Nodes represent authors
- Edges represent references from one author to another

- nodes: 11513
- edges: 325209
- diameter: 9
- average degree: 56.49
- largest connected component size: 11454
- Degree statistics:
- in degree stats:
- power law exponent: 2.16 r-squared: 0.9
- not a power law relationship (p = 2.00)
- Newman power law exponent: 1.52, error: 0
- out degree stats:
- power law exponent: 2.51 r-squared: 0.86
- not a power law relationship (p = 2.00)
- Newman power law exponent: 1.49, error: 0
- total degree stats:
- power law exponent: 2.24 r-squared: 0.89
- not a power law relationship (p = 2.00)
- Newman power law exponent: 1.42, error: 0
- Clustering:
- Watts Strogatz clustering coefficient: 0.4652
- Newman clustering coefficient: 0.1488
- clairlib avg. directed shortest path: 3.17
- Ferrer avg. directed shortest path: 3.19
- harmonic mean geodesic distance: 4.89

- An undirected network
- Nodes represent authors
- Edges represent instances where one author coauthored a paper with another author

- nodes: 16081
- edges: 49561
- diameter: 15
- average degree: 6.16
- largest connected component size: 13259
- Degree statistics:
- total degree stats:
- power law exponent: 3.08 r-squared: 0.91
- not a power law relationship (p = 2.00)
- Newman power law exponent: 2.12, error: 0.01
- Clustering:
- Watts Strogatz clustering coefficient: 0.6681
- Newman clustering coefficient: 0.2915
- clairlib avg. directed shortest path: 5.47
- Ferrer avg. directed shortest path: 4.66
- harmonic mean geodesic distance: 7.57