arXiv hep-th (KDD Cup)
Network info
| Code | th |
| Category | Reference |
| Data source | http://www.cs.cornell.edu/projects/kddcup/datasets.html |
| Description | Publication–publication citation |
| Format |  Directed |
| Edge weights |  Unweighted |
| Size | 27,770 vertices |
| Volume | 352,807 edges |
| Average degree | 25.41 edges / vertex |
| Maximum degree | 2,468 edges |
| Fill | 6.073793 × 10−4 edges / vertex2 |
| Largest connected component | 27,400 vertices |
| Largest strongly connected component | 7,464 vertices |
| Clustering coefficient | 11.99% |
| Algebraic connectivity | 7.278625 × 10−2 |
| Spectral norm | 111.32 |
| Diameter | 15 edges |
| 90-percentile effective diameter | 5.40 edges |
| Median shortest path length | 4 edges |
| Mean shortest path length | 4.28 edges |
| Gini coefficient | 57.02% |
Degree distribution
Outdegree distribution
Indegree distribution
Degree distribution
Outdegree distribution
Indegree distribution
Degree distribution
Outdegree distribution
Indegree distribution
Clustering coefficient distribution
Hop plot
Top-k eigenvalues
Top-k eigenvalues of A
Top-k eigenvalues of N
Top-k eigenvalues of L
Eigenvalues of A
Eigenvalues of N
Eigenvalues of A
Eigenvalues of N
Spectral diagonality test
Spectral diagonality test
Downloads
| TSV File: |
 hep-th-citations.tar.bz2
(1.14 MiB) |
