Wikipedia edits (ext)

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


Internal nameedit-extwiki
NameWikipedia edits (ext)
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 =8,010
Left size n1 =1,215
Right size n2 =6,795
Volume m =98,264
Unique edge count m̿ =44,128
Wedge count s =21,035,860
Claw count z =11,168,979,897
Cross count x =5,476,217,759,541
Square count q =55,379,994
4-Tour count T4 =527,288,708
Maximum degree dmax =8,057
Maximum left degree d1max =8,057
Maximum right degree d2max =433
Average degree d =24.535 3
Average left degree d1 =80.875 7
Average right degree d2 =14.461 2
Fill p =0.005 345 01
Average edge multiplicity m̃ =2.226 79
Size of LCC N =7,247
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.304 51
90-Percentile effective diameter δ0.9 =4.579 06
Median distance δM =4
Mean distance δm =3.650 79
Gini coefficient G =0.828 860
Balanced inequality ratio P =0.170 291
Left balanced inequality ratio P1 =0.063 156 4
Right balanced inequality ratio P2 =0.219 460
Relative edge distribution entropy Her =0.782 917
Power law exponent γ =1.901 12
Tail power law exponent γt =1.631 00
Tail power law exponent with p γ3 =1.631 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.681 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =7.271 00
Right p-value p2 =0.338 000
Degree assortativity ρ =−0.205 288
Degree assortativity p-value pρ =0.000 00
Spectral norm α =491.184
Algebraic connectivity a =0.064 244 3
Spectral separation 1[A] / λ2[A]| =1.198 73
Controllability C =5,599
Relative controllability Cr =0.718 465


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.