Wikipedia edits (sd)

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


Internal nameedit-sdwiki
NameWikipedia edits (sd)
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 =25,887
Left size n1 =951
Right size n2 =24,936
Volume m =70,629
Unique edge count m̿ =36,887
Wedge count s =104,301,350
Claw count z =314,136,293,280
Cross count x =769,817,396,654,295
Square count q =4,898,563
4-Tour count T4 =456,475,690
Maximum degree dmax =17,819
Maximum left degree d1max =17,819
Maximum right degree d2max =596
Average degree d =5.456 72
Average left degree d1 =74.268 1
Average right degree d2 =2.832 41
Fill p =0.001 555 49
Average edge multiplicity m̃ =1.914 74
Size of LCC N =24,942
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.289 51
90-Percentile effective diameter δ0.9 =3.913 82
Median distance δM =4
Mean distance δm =3.456 30
Gini coefficient G =0.770 574
Balanced inequality ratio P =0.189 278
Left balanced inequality ratio P1 =0.066 205 1
Right balanced inequality ratio P2 =0.288 125
Relative edge distribution entropy Her =0.699 634
Power law exponent γ =4.896 30
Tail power law exponent γt =2.601 00
Degree assortativity ρ =−0.393 491
Degree assortativity p-value pρ =0.000 00
Spectral norm α =832.225
Algebraic connectivity a =0.040 800 9
Controllability C =23,852
Relative controllability Cr =0.930 410


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

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.