Wikibooks edits (pt)

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


Internal nameedit-ptwikibooks
NameWikibooks edits (pt)
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 =79,341
Left size n1 =4,212
Right size n2 =75,129
Volume m =355,008
Unique edge count m̿ =150,079
Wedge count s =1,515,376,951
Claw count z =23,132,629,849,618
Cross count x =292,585,739,739,775,360
Square count q =86,016,879
4-Tour count T4 =6,750,019,202
Maximum degree dmax =137,110
Maximum left degree d1max =137,110
Maximum right degree d2max =2,619
Average degree d =8.948 92
Average left degree d1 =84.284 9
Average right degree d2 =4.725 31
Fill p =0.000 474 268
Average edge multiplicity m̃ =2.365 47
Size of LCC N =77,631
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.128 55
90-Percentile effective diameter δ0.9 =3.962 74
Median distance δM =4
Mean distance δm =3.263 50
Gini coefficient G =0.789 658
Balanced inequality ratio P =0.186 989
Left balanced inequality ratio P1 =0.058 764 9
Right balanced inequality ratio P2 =0.274 985
Relative edge distribution entropy Her =0.704 628
Power law exponent γ =2.993 94
Tail power law exponent γt =2.921 00
Tail power law exponent with p γ3 =2.921 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.871 00
Left p-value p1 =0.001 000 00
Right tail power law exponent with p γ3,2 =3.311 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.209 769
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,484.09
Algebraic connectivity a =0.025 356 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.