Wikipedia edits (ko)

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


Internal nameedit-kowiki
NameWikipedia 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 =1,614,822
Left size n1 =109,658
Right size n2 =1,505,164
Volume m =14,237,677
Unique edge count m̿ =6,459,993
Wedge count s =235,676,311,952
Claw count z =16,552,926,527,153,354
Cross count x =1.111 04 × 1021
Maximum degree dmax =606,874
Maximum left degree d1max =606,874
Maximum right degree d2max =8,639
Average degree d =17.633 7
Average left degree d1 =129.837
Average right degree d2 =9.459 22
Fill p =3.913 88 × 10−5
Average edge multiplicity m̃ =2.203 98
Size of LCC N =1,556,673
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.428 20
90-Percentile effective diameter δ0.9 =3.969 33
Median distance δM =4
Mean distance δm =3.783 13
Gini coefficient G =0.873 218
Balanced inequality ratio P =0.133 276
Left balanced inequality ratio P1 =0.048 470 2
Right balanced inequality ratio P2 =0.187 276
Relative edge distribution entropy Her =0.733 559
Power law exponent γ =2.277 95
Tail power law exponent γt =2.671 00
Tail power law exponent with p γ3 =2.671 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.621 00
Left p-value p1 =0.010 000 0
Right tail power law exponent with p γ3,2 =3.461 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.148 146
Degree assortativity p-value pρ =0.000 00
Spectral norm α =7,018.20
Spectral separation 1[A] / λ2[A]| =1.309 08
Controllability C =1,407,399
Relative controllability Cr =0.898 278


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

Hop distribution

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution

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.