Wikipedia edits (mk)

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


Internal nameedit-mkwiki
NameWikipedia edits (mk)
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 =423,143
Left size n1 =10,840
Right size n2 =412,303
Volume m =2,583,957
Unique edge count m̿ =1,339,883
Wedge count s =28,595,090,121
Claw count z =871,586,286,392,096
Cross count x =2.518 22 × 1019
Square count q =20,345,739,710
4-Tour count T4 =277,149,821,850
Maximum degree dmax =244,406
Maximum left degree d1max =244,406
Maximum right degree d2max =3,144
Average degree d =12.213 2
Average left degree d1 =238.372
Average right degree d2 =6.267 13
Fill p =0.000 299 793
Average edge multiplicity m̃ =1.928 49
Size of LCC N =420,976
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.318 39
90-Percentile effective diameter δ0.9 =3.887 46
Median distance δM =4
Mean distance δm =3.512 49
Gini coefficient G =0.853 198
Balanced inequality ratio P =0.142 589
Left balanced inequality ratio P1 =0.032 348 4
Right balanced inequality ratio P2 =0.207 741
Relative edge distribution entropy Her =0.695 697
Tail power law exponent γt =3.011 00
Tail power law exponent with p γ3 =3.011 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.761 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =5.861 00
Right p-value p2 =0.542 000
Degree assortativity ρ =−0.303 724
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,614.91
Algebraic connectivity a =0.037 005 9
Spectral separation 1[A] / λ2[A]| =1.680 52
Controllability C =402,769
Relative controllability Cr =0.953 507


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

Edge weight/multiplicity distribution

Temporal 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.