Wikibooks edits (ps)

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

Metadata

Codebps
Internal nameedit-pswikibooks
NameWikibooks edits (ps)
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 =174
Left size n1 =35
Right size n2 =139
Volume m =257
Unique edge count m̿ =154
Wedge count s =1,070
Claw count z =8,122
Cross count x =52,824
Square count q =46
4-Tour count T4 =4,980
Maximum degree dmax =56
Maximum left degree d1max =56
Maximum right degree d2max =42
Average degree d =2.954 02
Average left degree d1 =7.342 86
Average right degree d2 =1.848 92
Fill p =0.031 654 7
Average edge multiplicity m̃ =1.668 83
Size of LCC N =42
Diameter δ =6
50-Percentile effective diameter δ0.5 =1.622 35
90-Percentile effective diameter δ0.9 =3.197 45
Median distance δM =2
Mean distance δm =2.281 43
Gini coefficient G =0.620 750
Balanced inequality ratio P =0.260 700
Left balanced inequality ratio P1 =0.214 008
Right balanced inequality ratio P2 =0.338 521
Relative edge distribution entropy Her =0.887 255
Power law exponent γ =4.719 03
Tail power law exponent γt =2.561 00
Degree assortativity ρ =−0.149 038
Degree assortativity p-value pρ =0.065 073 0
Algebraic connectivity a =0.149 010
Controllability C =97
Relative controllability Cr =0.580 838

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.