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
|
| 4-Tour count | T4 = | 4,751,646,308
|
| Maximum degree | dmax = | 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 | Ns = | 3,709
|
| Relative size of LSCC | Nrs = | 0.002 709 17
|
| Diameter | δ = | 29
|
| 50-Percentile effective diameter | δ0.5 = | 5.010 36
|
| 90-Percentile 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 | Her = | 0.946 382
|
| Power law exponent | γ = | 1.546 10
|
| Tail power law exponent | γt = | 2.791 00
|
| Tail power law exponent with p | γ3 = | 2.791 00
|
| p-value | p = | 0.003 000 00
|
| Outdegree tail power law exponent with p | γ3,o = | 4.571 00
|
| Outdegree p-value | po = | 0.000 00
|
| Indegree tail power law exponent with p | γ3,i = | 2.441 00
|
| Indegree p-value | pi = | 0.000 00
|
| Degree assortativity | ρ = | −0.034 210 7
|
| Degree assortativity p-value | pρ = | 0.000 00
|
| Clustering coefficient | c = | 0.026 713 5
|
| Directed clustering coefficient | c± = | 0.103 148
|
| Spectral norm | α = | 95.724 2
|
| Operator 2-norm | ν = | 94.040 3
|
| Cyclic eigenvalue | π = | 8.743 18
|
| Reciprocity | y = | 0.002 238 94
|
| Non-bipartivity | bA = | 0.029 684 4
|
| Normalized non-bipartivity | bN = | 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.
|
KONECT ‣ Networks ‣
Buy Me a Coffee
