Wikipedia growth (en)
This is the hyperlink network of the English Wikipedia with edge arrival times.
Metadata
Statistics
Size  n =  1,870,709

Volume  m =  39,953,145

Loop count  l =  0

Wedge count  s =  122,966,873,340

Claw count  z =  3,206,375,666,919,400

Cross count  x =  1.291 74 × 10^{20}

Triangle count  t =  126,619,350

Maximum degree  d_{max} =  226,577

Maximum outdegree  d^{+}_{max} =  6,975

Maximum indegree  d^{−}_{max} =  225,883

Average degree  d =  42.714 4

Fill  p =  1.141 67 × 10^{−5}

Size of LCC  N =  1,870,521

Size of LSCC  N_{s} =  1,629,321

Relative size of LSCC  N^{r}_{s} =  0.870 964

Diameter  δ =  10

50Percentile effective diameter  δ_{0.5} =  2.832 44

90Percentile effective diameter  δ_{0.9} =  3.880 25

Median distance  δ_{M} =  3

Mean distance  δ_{m} =  3.422 95

Gini coefficient  G =  0.683 700

Balanced inequality ratio  P =  0.244 004

Outdegree balanced inequality ratio  P_{+} =  0.281 987

Indegree balanced inequality ratio  P_{−} =  0.171 897

Relative edge distribution entropy  H_{er} =  0.901 960

Power law exponent  γ =  1.370 51

Degree assortativity  ρ =  −0.041 837 0

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.003 089 11

Directed clustering coefficient  c^{±} =  0.026 540 2

Spectral norm  α =  848.572

Operator 2norm  ν =  690.274

Cyclic eigenvalue  π =  216.703

Reciprocity  y =  0.171 231

Nonbipartivity  b_{A} =  0.240 561

Normalized nonbipartivity  b_{N} =  0.021 029 4

Algebraic nonbipartivity  χ =  0.040 018 0

Spectral bipartite frustration  b_{K} =  0.000 256 124

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]

Alan Mislove.
Online Social Networks: Measurement, Analysis, and Applications
to Distributed Information Systems.
PhD thesis, Rice Univ., 2009.
