Arnetminer ACM
The directed citation network of ACM papers as extracted by the ArnetMiner
project. Directed edges of the from A→B denote a paper A citing a paper B.
Metadata
Statistics
Size  n =  1,369,055

Volume  m =  8,650,089

Loop count  l =  3,047

Wedge count  s =  816,355,014

Claw count  z =  425,535,074,479

Cross count  x =  493,029,216,779,945

Triangle count  t =  7,269,242

Square count  q =  183,618,561

4Tour count  T_{4} =  4,751,646,308

Maximum degree  d_{max} =  8,619

Maximum outdegree  d^{+}_{max} =  808

Maximum indegree  d^{−}_{max} =  8,619

Average degree  d =  12.636 6

Fill  p =  4.615 08 × 10^{−6}

Size of LCC  N =  1,348,824

Size of LSCC  N_{s} =  3,709

Relative size of LSCC  N^{r}_{s} =  0.002 709 17

Diameter  δ =  29

50Percentile effective diameter  δ_{0.5} =  5.010 36

90Percentile effective diameter  δ_{0.9} =  6.550 19

Median distance  δ_{M} =  6

Mean distance  δ_{m} =  5.575 01

Gini coefficient  G =  0.594 085

Balanced inequality ratio  P =  0.279 812

Outdegree balanced inequality ratio  P_{+} =  0.335 097

Indegree balanced inequality ratio  P_{−} =  0.226 456

Relative edge distribution entropy  H_{er} =  0.946 382

Power law exponent  γ =  1.546 10

Tail power law exponent  γ_{t} =  2.781 00

Degree assortativity  ρ =  −0.034 210 7

Degree assortativity pvalue  p_{ρ} =  0.000 00

In/outdegree correlation  ρ^{±} =  −0.056 042 3

Clustering coefficient  c =  0.026 713 5

Directed clustering coefficient  c^{±} =  0.103 148

Spectral norm  α =  95.724 2

Operator 2norm  ν =  94.040 3

Cyclic eigenvalue  π =  8.743 18

Reciprocity  y =  0.002 238 94

Nonbipartivity  b_{A} =  0.029 684 4

Normalized nonbipartivity  b_{N} =  0.005 042 82

Plots
Matrix decompositions plots
Downloads
References
[1]

Jérôme Kunegis.
KONECT – The Koblenz Network Collection.
In Proc. Int. Conf. on World Wide Web Companion, pages
1343–1350, 2013.
[ http ]

[2]

Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su.
ArnetMiner: Extraction and mining of academic social networks.
In Proc. Int. Conf. on Knowl. Discov. and Data Min., pages
990–998, 2008.
