DBpedia
This is the complete DBpedia network. Nodes are entities included in DBpedia
and each edge represents one triple. The data is extracted from version 3.6 of
DBpedia.
Metadata
Statistics
Size  n =  3,966,924

Volume  m =  13,820,853

Unique edge count  m̿ =  12,860,157

Loop count  l =  0

Wedge count  s =  174,275,329,593

Claw count  z =  19,647,361,248,950,896

Cross count  x =  2.121 93 × 10^{21}

Triangle count  t =  8,329,548

Square count  q =  31,569,203,235

4Tour count  T_{4} =  949,680,166,216

Maximum degree  d_{max} =  472,799

Maximum outdegree  d^{+}_{max} =  1,006

Maximum indegree  d^{−}_{max} =  472,799

Average degree  d =  6.968 05

Fill  p =  8.172 31 × 10^{−7}

Average edge multiplicity  m̃ =  1.074 70

Size of LCC  N =  3,915,921

Size of LSCC  N_{s} =  178,593

Relative size of LSCC  N^{r}_{s} =  0.045 020 5

Diameter  δ =  67

50Percentile effective diameter  δ_{0.5} =  4.675 03

90Percentile effective diameter  δ_{0.9} =  6.270 44

Median distance  δ_{M} =  5

Mean distance  δ_{m} =  5.189 84

Gini coefficient  G =  0.661 842

Balanced inequality ratio  P =  0.253 558

Outdegree balanced inequality ratio  P_{+} =  0.339 768

Indegree balanced inequality ratio  P_{−} =  0.157 443

Relative edge distribution entropy  H_{er} =  0.874 373

Power law exponent  γ =  1.940 85

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

Degree assortativity  ρ =  −0.042 546 6

Degree assortativity pvalue  p_{ρ} =  0.000 00

In/outdegree correlation  ρ^{±} =  −0.127 840

Clustering coefficient  c =  0.000 143 386

Directed clustering coefficient  c^{±} =  0.150 192

Spectral norm  α =  731.842

Operator 2norm  ν =  729.740

Cyclic eigenvalue  π =  18.770 8

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.003 51

Reciprocity  y =  0.038 751 5

Nonbipartivity  b_{A} =  0.005 699 68

Normalized nonbipartivity  b_{N} =  0.000 326 204

Algebraic nonbipartivity  χ =  0.000 674 948

Spectral bipartite frustration  b_{K} =  2.626 81 × 10^{−5}

Controllability  C =  2,700,982

Relative controllability  C_{r} =  0.680 881

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]

Sören Auer, Christian Bizer, Georgi Kobilarov, Jens Lehmann, Richard Cyganiak,
and Zachary Ives.
DBpedia: A nucleus for a web of open data.
In Proc. Int. Semant. Web Conf., pages 722–735, 2008.
