Wikibooks edits (gu)

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

Metadata

Codebgu
Internal nameedit-guwikibooks
NameWikibooks edits (gu)
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 =115
Left size n1 =29
Right size n2 =86
Volume m =182
Unique edge count m̿ =137
Wedge count s =1,323
Claw count z =13,872
Cross count x =112,520
Square count q =475
4-Tour count T4 =9,586
Maximum degree dmax =65
Maximum left degree d1max =65
Maximum right degree d2max =10
Average degree d =3.165 22
Average left degree d1 =6.275 86
Average right degree d2 =2.116 28
Fill p =0.054 931 8
Average edge multiplicity m̃ =1.328 47
Size of LCC N =64
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.004 79
90-Percentile effective diameter δ0.9 =7.718 59
Median distance δM =4
Mean distance δm =4.166 93
Gini coefficient G =0.519 934
Balanced inequality ratio P =0.315 934
Left balanced inequality ratio P1 =0.247 253
Right balanced inequality ratio P2 =0.368 132
Relative edge distribution entropy Her =0.873 226
Power law exponent γ =2.974 28
Tail power law exponent γt =3.201 00
Degree assortativity ρ =+0.168 393
Degree assortativity p-value pρ =0.049 183 0
Algebraic connectivity a =0.029 406 8
Controllability C =59
Relative controllability Cr =0.513 043

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.