Wikipedia edits (lg)

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


Internal nameedit-lgwiki
NameWikipedia edits (lg)
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 =4,662
Left size n1 =683
Right size n2 =3,979
Volume m =15,425
Unique edge count m̿ =7,356
Wedge count s =450,054
Claw count z =32,851,554
Cross count x =2,545,699,567
Square count q =511,235
4-Tour count T4 =5,906,420
Maximum degree dmax =989
Maximum left degree d1max =989
Maximum right degree d2max =285
Average degree d =6.617 33
Average left degree d1 =22.584 2
Average right degree d2 =3.876 60
Fill p =0.002 706 74
Average edge multiplicity m̃ =2.096 93
Size of LCC N =3,165
Diameter δ =13
50-Percentile effective diameter δ0.5 =4.402 86
90-Percentile effective diameter δ0.9 =6.242 45
Median distance δM =5
Mean distance δm =4.981 27
Gini coefficient G =0.818 806
Balanced inequality ratio P =0.148 006
Left balanced inequality ratio P1 =0.136 143
Right balanced inequality ratio P2 =0.199 157
Relative edge distribution entropy Her =0.827 440
Power law exponent γ =3.176 04
Tail power law exponent γt =2.411 00
Tail power law exponent with p γ3 =2.411 00
p-value p =0.966 000
Left tail power law exponent with p γ3,1 =1.681 00
Left p-value p1 =0.017 000 0
Right tail power law exponent with p γ3,2 =2.371 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.221 381
Degree assortativity p-value pρ =2.379 26 × 10−82
Spectral norm α =190.222
Algebraic connectivity a =0.018 328 5
Spectral separation 1[A] / λ2[A]| =1.378 69
Controllability C =2,527
Relative controllability Cr =0.666 227


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.