Wikibooks edits (se)

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


Internal nameedit-sewikibooks
NameWikibooks edits (se)
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 =110
Left size n1 =29
Right size n2 =81
Volume m =141
Unique edge count m̿ =115
Wedge count s =581
Claw count z =2,889
Cross count x =12,389
Square count q =192
4-Tour count T4 =4,130
Maximum degree dmax =42
Maximum left degree d1max =42
Maximum right degree d2max =10
Average degree d =2.563 64
Average left degree d1 =4.862 07
Average right degree d2 =1.740 74
Fill p =0.048 957 0
Average edge multiplicity m̃ =1.226 09
Size of LCC N =30
Diameter δ =6
50-Percentile effective diameter δ0.5 =2.931 27
90-Percentile effective diameter δ0.9 =4.497 62
Median distance δM =3
Mean distance δm =3.324 14
Gini coefficient G =0.473 514
Balanced inequality ratio P =0.333 333
Left balanced inequality ratio P1 =0.255 319
Right balanced inequality ratio P2 =0.368 794
Relative edge distribution entropy Her =0.905 700
Power law exponent γ =3.323 82
Tail power law exponent γt =2.891 00
Tail power law exponent with p γ3 =2.891 00
p-value p =0.029 000 0
Left tail power law exponent with p γ3,1 =2.411 00
Left p-value p1 =0.658 000
Right tail power law exponent with p γ3,2 =5.931 00
Right p-value p2 =0.060 000 0
Degree assortativity ρ =−0.029 167 6
Degree assortativity p-value pρ =0.756 989
Algebraic connectivity a =0.098 522 1
Controllability C =54
Relative controllability Cr =0.490 909


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.