Wikipedia edits (hsb)

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


Internal nameedit-hsbwiki
NameWikipedia edits (hsb)
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 =32,373
Left size n1 =1,952
Right size n2 =30,421
Volume m =331,012
Unique edge count m̿ =150,636
Wedge count s =332,241,994
Claw count z =964,814,445,723
Cross count x =2,682,913,718,329,344
Square count q =445,805,291
4-Tour count T4 =4,895,827,200
Maximum degree dmax =36,414
Maximum left degree d1max =36,414
Maximum right degree d2max =784
Average degree d =20.449 9
Average left degree d1 =169.576
Average right degree d2 =10.881 0
Fill p =0.002 536 74
Average edge multiplicity m̃ =2.197 43
Size of LCC N =31,649
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.056 47
90-Percentile effective diameter δ0.9 =3.863 58
Median distance δM =4
Mean distance δm =3.170 57
Gini coefficient G =0.848 247
Balanced inequality ratio P =0.158 372
Left balanced inequality ratio P1 =0.040 007 6
Right balanced inequality ratio P2 =0.215 300
Relative edge distribution entropy Her =0.738 136
Power law exponent γ =2.092 40
Tail power law exponent γt =1.721 00
Degree assortativity ρ =−0.360 782
Degree assortativity p-value pρ =0.000 00
Spectral norm α =915.430
Algebraic connectivity a =0.050 932 4


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

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.