Wikiversity edits (ko)

This is the bipartite edit network of the Korean Wikiversity. It contains users and pages from the Korean Wikiversity, connected by edit events. Each edge represents an edit. The dataset includes the timestamp of each edit.


Internal nameedit-kowikiversity
NameWikiversity edits (ko)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Authorship network
Dataset timestamp 2017-10-20
Node meaningUser, article
Edge meaningEdit
Network formatBipartite, undirected
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps


Size n =2,481
Left size n1 =335
Right size n2 =2,146
Volume m =11,953
Unique edge count m̿ =4,528
Wedge count s =499,590
Claw count z =65,278,897
Cross count x =7,576,811,711
Square count q =307,644
4-Tour count T4 =4,475,452
Maximum degree dmax =2,747
Maximum left degree d1max =2,747
Maximum right degree d2max =352
Average degree d =9.635 63
Average left degree d1 =35.680 6
Average right degree d2 =5.569 90
Fill p =0.006 298 42
Average edge multiplicity m̃ =2.639 80
Size of LCC N =2,253
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.632 92
90-Percentile effective diameter δ0.9 =5.685 66
Median distance δM =4
Mean distance δm =4.322 83
Gini coefficient G =0.804 272
Balanced inequality ratio P =0.174 559
Left balanced inequality ratio P1 =0.125 993
Right balanced inequality ratio P2 =0.239 689
Relative edge distribution entropy Her =0.803 382
Power law exponent γ =2.923 71
Tail power law exponent γt =2.061 00
Tail power law exponent with p γ3 =2.061 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.691 00
Left p-value p1 =0.795 000
Right tail power law exponent with p γ3,2 =2.161 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.128 664
Degree assortativity p-value pρ =3.572 69 × 10−18
Spectral norm α =239.047
Algebraic connectivity a =0.013 689 4
Spectral separation 1[A] / λ2[A]| =1.657 98
Controllability C =1,929
Relative controllability Cr =0.786 384


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

Double Laplacian graph drawing

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

Matrix decompositions plots



[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] Wikimedia Foundation. Wikimedia downloads., January 2010.