Wikibooks edits (pl)

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


Internal nameedit-plwikibooks
NameWikibooks edits (pl)
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 =22,011
Left size n1 =2,611
Right size n2 =19,400
Volume m =163,911
Unique edge count m̿ =47,186
Wedge count s =23,243,725
Claw count z =15,774,898,718
Cross count x =9,551,571,433,517
Square count q =5,966,157
4-Tour count T4 =140,839,928
Maximum degree dmax =37,337
Maximum left degree d1max =37,337
Maximum right degree d2max =2,841
Average degree d =14.893 6
Average left degree d1 =62.777 1
Average right degree d2 =8.449 02
Fill p =0.000 931 547
Average edge multiplicity m̃ =3.473 72
Size of LCC N =20,687
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.534 87
90-Percentile effective diameter δ0.9 =4.725 25
Median distance δM =4
Mean distance δm =4.026 68
Gini coefficient G =0.844 462
Balanced inequality ratio P =0.152 580
Left balanced inequality ratio P1 =0.076 608 6
Right balanced inequality ratio P2 =0.213 134
Relative edge distribution entropy Her =0.798 584
Power law exponent γ =2.540 87
Tail power law exponent γt =2.321 00
Tail power law exponent with p γ3 =2.321 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.761 00
Left p-value p1 =0.704 000
Right tail power law exponent with p γ3,2 =3.571 00
Right p-value p2 =0.528 000
Degree assortativity ρ =−0.138 598
Degree assortativity p-value pρ =4.891 28 × 10−201
Spectral norm α =4,080.59
Algebraic connectivity a =0.065 902 4
Spectral separation 1[A] / λ2[A]| =4.605 93
Controllability C =16,998
Relative controllability Cr =0.799 944


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



[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.