Wikipedia dynamic (pl)
This network shows the evolution of hyperlinks between articles of the Polish
Wikipedia. The nodes represent articles. An edge indicates that a hyperlink was
added or removed depending on the edge weight (−1 for removal or +1 for
addition).
Metadata
Statistics
Size | n = | 1,033,050
|
Volume | m = | 25,026,208
|
Unique edge count | m̿ = | 12,587,086
|
Loop count | l = | 627
|
Wedge count | s = | 42,876,854,599
|
Claw count | z = | 379,770,237,481,986
|
Cross count | x = | 6,623,220,433,217,829,888
|
Triangle count | t = | 72,570,341
|
Maximum degree | dmax = | 262,227
|
Maximum outdegree | d+max = | 110,702
|
Maximum indegree | d−max = | 151,525
|
Average degree | d = | 48.451 1
|
Fill | p = | 1.194 23 × 10−5
|
Average edge multiplicity | m̃ = | 1.988 24
|
Size of LCC | N = | 1,031,602
|
Size of LSCC | Ns = | 723,953
|
Relative size of LSCC | Nrs = | 0.700 792
|
Diameter | δ = | 14
|
50-Percentile effective diameter | δ0.5 = | 2.951 90
|
90-Percentile effective diameter | δ0.9 = | 4.000 47
|
Median distance | δM = | 3
|
Mean distance | δm = | 3.545 10
|
Gini coefficient | G = | 0.723 052
|
Balanced inequality ratio | P = | 0.224 161
|
Outdegree balanced inequality ratio | P+ = | 0.257 070
|
Indegree balanced inequality ratio | P− = | 0.167 646
|
Relative edge distribution entropy | Her = | 0.881 103
|
Power law exponent | γ = | 1.497 43
|
Tail power law exponent | γt = | 2.421 00
|
Degree assortativity | ρ = | −0.064 357 3
|
Degree assortativity p-value | pρ = | 0.000 00
|
In/outdegree correlation | ρ± = | +0.609 445
|
Clustering coefficient | c = | 0.005 077 59
|
Directed clustering coefficient | c± = | 0.026 918 6
|
Spectral norm | α = | 680.257
|
Operator 2-norm | ν = | 498.940
|
Cyclic eigenvalue | π = | 214.864
|
Spectral separation | |λ1[A] / λ2[A]| = | 1.554 97
|
Reciprocity | y = | 0.174 561
|
Non-bipartivity | bA = | 0.356 903
|
Normalized non-bipartivity | bN = | 0.017 545 8
|
Controllability | C = | 440,917
|
Relative controllability | Cr = | 0.429 475
|
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]
|
Julia Preusse, Jérôme Kunegis, Matthias Thimm, Thomas Gottron, and Steffen
Staab.
Structural dynamics of knowledge networks.
In Proc. Int. Conf. on Weblogs and Soc. Media, 2013.
|