Wikibooks edits (sq)

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


Internal nameedit-sqwikibooks
NameWikibooks edits (sq)
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 =7,177
Left size n1 =303
Right size n2 =6,874
Volume m =21,709
Unique edge count m̿ =7,732
Wedge count s =5,089,352
Claw count z =3,203,812,097
Cross count x =1,654,265,745,277
Square count q =60,813
4-Tour count T4 =20,868,872
Maximum degree dmax =10,449
Maximum left degree d1max =10,449
Maximum right degree d2max =202
Average degree d =6.049 60
Average left degree d1 =71.646 9
Average right degree d2 =3.158 13
Fill p =0.003 712 27
Average edge multiplicity m̃ =2.807 68
Size of LCC N =6,532
Diameter δ =16
50-Percentile effective diameter δ0.5 =3.455 36
90-Percentile effective diameter δ0.9 =5.556 90
Median distance δM =4
Mean distance δm =3.976 42
Gini coefficient G =0.772 986
Balanced inequality ratio P =0.191 211
Left balanced inequality ratio P1 =0.051 453 3
Right balanced inequality ratio P2 =0.288 820
Relative edge distribution entropy Her =0.714 519
Power law exponent γ =8.323 73
Tail power law exponent γt =3.181 00
Tail power law exponent with p γ3 =3.181 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.811 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =4.931 00
Right p-value p2 =0.388 000
Degree assortativity ρ =−0.283 420
Degree assortativity p-value pρ =8.869 94 × 10−143
Spectral norm α =494.485
Algebraic connectivity a =0.019 117 8
Spectral separation 1[A] / λ2[A]| =1.690 07
Controllability C =6,309
Relative controllability Cr =0.914 480


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.