Wikipedia edits (km)

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


Internal nameedit-kmwiki
NameWikipedia edits (km)
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 =28,481
Left size n1 =3,985
Right size n2 =24,496
Volume m =164,036
Unique edge count m̿ =64,156
Wedge count s =70,457,647
Claw count z =150,996,938,773
Cross count x =304,199,864,512,524
Square count q =21,938,108
4-Tour count T4 =457,472,896
Maximum degree dmax =25,799
Maximum left degree d1max =25,799
Maximum right degree d2max =856
Average degree d =11.519 0
Average left degree d1 =41.163 4
Average right degree d2 =6.696 44
Fill p =0.000 657 225
Average edge multiplicity m̃ =2.556 83
Size of LCC N =25,853
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.463 65
90-Percentile effective diameter δ0.9 =4.777 40
Median distance δM =4
Mean distance δm =3.875 36
Gini coefficient G =0.822 831
Balanced inequality ratio P =0.159 032
Left balanced inequality ratio P1 =0.094 826 7
Right balanced inequality ratio P2 =0.215 727
Relative edge distribution entropy Her =0.778 559
Power law exponent γ =2.673 05
Tail power law exponent γt =2.141 00
Tail power law exponent with p γ3 =2.141 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.841 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =2.281 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.282 379
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,654.58
Algebraic connectivity a =0.042 741 3
Spectral separation 1[A] / λ2[A]| =4.021 29
Controllability C =20,911
Relative controllability Cr =0.760 455


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.