Wikibooks edits (hu)

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


Internal nameedit-huwikibooks
NameWikibooks edits (hu)
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 =63,280
Left size n1 =805
Right size n2 =62,475
Volume m =247,166
Unique edge count m̿ =72,801
Wedge count s =921,130,871
Claw count z =9,544,643,541,524
Cross count x =75,856,859,796,865,968
Square count q =3,589,559
4-Tour count T4 =3,713,639,470
Maximum degree dmax =130,670
Maximum left degree d1max =130,670
Maximum right degree d2max =1,386
Average degree d =7.811 82
Average left degree d1 =307.039
Average right degree d2 =3.956 24
Fill p =0.001 447 56
Average edge multiplicity m̃ =3.395 09
Size of LCC N =62,709
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.112 95
90-Percentile effective diameter δ0.9 =3.838 99
Median distance δM =4
Mean distance δm =3.163 24
Gini coefficient G =0.822 360
Balanced inequality ratio P =0.158 533
Left balanced inequality ratio P1 =0.031 068 2
Right balanced inequality ratio P2 =0.244 358
Relative edge distribution entropy Her =0.637 331
Power law exponent γ =10.246 6
Tail power law exponent γt =3.421 00
Tail power law exponent with p γ3 =3.421 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.741 00
Left p-value p1 =0.593 000
Right tail power law exponent with p γ3,2 =4.151 00
Right p-value p2 =0.533 000
Degree assortativity ρ =−0.252 068
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,375.78
Algebraic connectivity a =0.031 864 1


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

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.