Wikibooks edits (oc)

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


Internal nameedit-ocwikibooks
NameWikibooks edits (oc)
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 =875
Left size n1 =165
Right size n2 =710
Volume m =1,684
Unique edge count m̿ =968
Wedge count s =48,572
Claw count z =3,018,458
Cross count x =149,690,516
Square count q =2,303
4-Tour count T4 =215,592
Maximum degree dmax =384
Maximum left degree d1max =384
Maximum right degree d2max =131
Average degree d =3.849 14
Average left degree d1 =10.206 1
Average right degree d2 =2.371 83
Fill p =0.008 262 91
Average edge multiplicity m̃ =1.739 67
Size of LCC N =666
Diameter δ =13
50-Percentile effective diameter δ0.5 =4.060 16
90-Percentile effective diameter δ0.9 =6.825 77
Median distance δM =5
Mean distance δm =4.666 84
Gini coefficient G =0.684 212
Balanced inequality ratio P =0.231 295
Left balanced inequality ratio P1 =0.167 458
Right balanced inequality ratio P2 =0.308 789
Relative edge distribution entropy Her =0.829 058
Power law exponent γ =4.192 28
Tail power law exponent γt =2.431 00
Tail power law exponent with p γ3 =2.431 00
p-value p =0.001 000 00
Left tail power law exponent with p γ3,1 =2.021 00
Left p-value p1 =0.338 000
Right tail power law exponent with p γ3,2 =3.881 00
Right p-value p2 =0.127 000
Degree assortativity ρ =−0.237 131
Degree assortativity p-value pρ =7.713 84 × 10−14
Spectral norm α =90.841 3
Algebraic connectivity a =0.010 586 5
Spectral separation 1[A] / λ2[A]| =1.884 77
Controllability C =555
Relative controllability Cr =0.646 100


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.