Wikipedia edits (map-bms)

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


Internal nameedit-map_bmswiki
NameWikipedia edits (map-bms)
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,464
Left size n1 =1,081
Right size n2 =27,383
Volume m =185,840
Unique edge count m̿ =108,243
Wedge count s =241,004,281
Claw count z =586,873,856,700
Cross count x =1,220,593,516,089,462
Square count q =261,067,627
4-Tour count T4 =3,052,868,314
Maximum degree dmax =15,989
Maximum left degree d1max =15,989
Maximum right degree d2max =247
Average degree d =13.057 9
Average left degree d1 =171.915
Average right degree d2 =6.786 69
Fill p =0.003 656 73
Average edge multiplicity m̃ =1.716 88
Size of LCC N =27,425
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.227 25
90-Percentile effective diameter δ0.9 =3.938 72
Median distance δM =4
Mean distance δm =3.386 19
Gini coefficient G =0.820 872
Balanced inequality ratio P =0.153 199
Left balanced inequality ratio P1 =0.051 092 3
Right balanced inequality ratio P2 =0.243 909
Relative edge distribution entropy Her =0.728 366
Power law exponent γ =2.040 84
Tail power law exponent γt =1.541 00
Tail power law exponent with p γ3 =1.541 00
p-value p =0.001 000 00
Left tail power law exponent with p γ3,1 =1.661 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =8.911 00
Right p-value p2 =0.223 000
Degree assortativity ρ =−0.531 778
Degree assortativity p-value pρ =0.000 00
Spectral norm α =633.144
Algebraic connectivity a =0.024 240 2
Spectral separation 1[A] / λ2[A]| =2.799 92
Controllability C =26,025
Relative controllability Cr =0.926 915


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.