Cora
This is the cora citation network. The network is directed. Nodes represent
scientific papers. An edge between two nodes indicates that the left node cites
the right node.
Metadata
Statistics
Size  n =  23,166

Volume  m =  91,500

Loop count  l =  0

Wedge count  s =  2,022,447

Claw count  z =  56,729,506

Cross count  x =  2,513,670,491

Triangle count  t =  78,791

Square count  q =  779,838

4Tour count  T_{4} =  14,506,806

Maximum degree  d_{max} =  379

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

Maximum indegree  d^{−}_{max} =  376

Average degree  d =  7.899 51

Fill  p =  0.000 170 505

Size of LCC  N =  23,166

Size of LSCC  N_{s} =  3,991

Relative size of LSCC  N^{r}_{s} =  0.172 278

Diameter  δ =  20

50Percentile effective diameter  δ_{0.5} =  5.221 24

90Percentile effective diameter  δ_{0.9} =  6.952 31

Median distance  δ_{M} =  6

Mean distance  δ_{m} =  5.738 25

Gini coefficient  G =  0.521 190

Relative edge distribution entropy  H_{er} =  0.948 154

Power law exponent  γ =  1.645 49

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

Tail power law exponent with p  γ_{3} =  3.301 00

pvalue  p =  0.719 000

Outdegree tail power law exponent with p  γ_{3,o} =  3.881 00

Outdegree pvalue  p_{o} =  0.003 000 00

Indegree tail power law exponent with p  γ_{3,i} =  2.931 00

Indegree pvalue  p_{i} =  0.360 000

Degree assortativity  ρ =  −0.055 308 3

Degree assortativity pvalue  p_{ρ} =  8.062 16 × 10^{−121}

In/outdegree correlation  ρ^{±} =  +0.007 871 51

Clustering coefficient  c =  0.116 875

Spectral norm  α =  32.224 5

Operator 2norm  ν =  24.673 3

Cyclic eigenvalue  π =  8.990 69

Algebraic connectivity  a =  0.031 284 1

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.025 23

Reciprocity  y =  0.051 213 1

Nonbipartivity  b_{A} =  0.416 988

Normalized nonbipartivity  b_{N} =  0.017 591 2

Spectral bipartite frustration  b_{K} =  0.001 221 48

Controllability  C =  10,296

Relative controllability  C_{r} =  0.444 444

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]

Lovro Šubelj and Marko Bajec.
Model of complex networks based on citation dynamics.
In Proc. of the WWW Workshop on Large Scale Network Analysis,
pages 527–530, 2013.
