Wikibooks edits (ur)

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

Metadata

Codebur
Internal nameedit-urwikibooks
NameWikibooks edits (ur)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
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

Statistics

Size n =1,584
Left size n1 =243
Right size n2 =1,341
Volume m =3,164
Unique edge count m̿ =1,748
Wedge count s =69,754
Claw count z =3,441,284
Cross count x =155,116,341
Square count q =9,480
4-Tour count T4 =358,464
Maximum degree dmax =395
Maximum left degree d1max =395
Maximum right degree d2max =82
Average degree d =3.994 95
Average left degree d1 =13.020 6
Average right degree d2 =2.359 43
Fill p =0.005 364 22
Average edge multiplicity m̃ =1.810 07
Size of LCC N =1,205
Diameter δ =13
50-Percentile effective diameter δ0.5 =5.049 62
90-Percentile effective diameter δ0.9 =7.535 41
Median distance δM =6
Mean distance δm =5.339 31
Gini coefficient G =0.687 233
Relative edge distribution entropy Her =0.841 210
Power law exponent γ =4.443 44
Tail power law exponent γt =2.491 00
Tail power law exponent with p γ3 =2.491 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.841 00
Left p-value p1 =0.264 000
Right tail power law exponent with p γ3,2 =4.291 00
Right p-value p2 =0.069 000 0
Degree assortativity ρ =−0.161 293
Degree assortativity p-value pρ =1.175 78 × 10−11
Spectral norm α =53.094 5
Algebraic connectivity a =0.011 646 9

Plots

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

Downloads

References

[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. http://dumps.wikimedia.org/, January 2010.