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

CodeCC
Internal namesubelj_cora
NameCora
Data sourcehttp://lovro.lpt.fri.uni-lj.si/support.jsp
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Citation network
Node meaningPaper
Edge meaningCitation
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops

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
4-Tour count T4 =14,506,806
Maximum degree dmax =379
Maximum outdegree d+max =104
Maximum indegree dmax =376
Average degree d =7.899 51
Fill p =0.000 170 505
Size of LCC N =23,166
Size of LSCC Ns =3,991
Relative size of LSCC Nrs =0.172 278
Diameter δ =20
50-Percentile effective diameter δ0.5 =5.221 24
90-Percentile effective diameter δ0.9 =6.952 31
Median distance δM =6
Mean distance δm =5.738 25
Gini coefficient G =0.521 190
Balanced inequality ratio P =0.309 115
Outdegree balanced inequality ratio P+ =0.334 142
Indegree balanced inequality ratio P =0.270 044
Relative edge distribution entropy Her =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
p-value p =0.719 000
Outdegree tail power law exponent with p γ3,o =3.881 00
Outdegree p-value po =0.003 000 00
Indegree tail power law exponent with p γ3,i =2.931 00
Indegree p-value pi =0.360 000
Degree assortativity ρ =−0.055 308 3
Degree assortativity p-value pρ =8.062 16 × 10−121
In/outdegree correlation ρ± =+0.007 871 51
Clustering coefficient c =0.116 875
Directed clustering coefficient c± =0.221 242
Spectral norm α =32.224 5
Operator 2-norm ν =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
Non-bipartivity bA =0.416 988
Normalized non-bipartivity bN =0.017 591 2
Spectral bipartite frustration bK =0.001 221 48
Controllability C =10,296
Relative controllability Cr =0.444 444

Plots

Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

Delaunay graph drawing

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree distribution

SynGraphy

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.