Wiktionary edits (he)

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


Internal nameedit-hewiktionary
NameWiktionary edits (he)
Data sourcehttp://dumps.wikimedia.org/
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 =38,019
Left size n1 =2,291
Right size n2 =35,728
Volume m =223,551
Unique edge count m̿ =123,538
Wedge count s =230,267,499
Claw count z =529,675,630,787
Cross count x =1,180,475,736,630,840
Square count q =121,065,733
4-Tour count T4 =1,889,853,992
Maximum degree dmax =22,116
Maximum left degree d1max =22,116
Maximum right degree d2max =4,115
Average degree d =11.760 0
Average left degree d1 =97.577 9
Average right degree d2 =6.257 03
Fill p =0.001 509 27
Average edge multiplicity m̃ =1.809 57
Size of LCC N =37,196
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.388 80
90-Percentile effective diameter δ0.9 =4.370 12
Median distance δM =4
Mean distance δm =3.701 97
Gini coefficient G =0.793 415
Balanced inequality ratio P =0.187 121
Left balanced inequality ratio P1 =0.060 107 1
Right balanced inequality ratio P2 =0.268 440
Relative edge distribution entropy Her =0.747 593
Power law exponent γ =2.174 49
Tail power law exponent γt =2.691 00
Degree assortativity ρ =−0.202 302
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,195.49
Algebraic connectivity a =0.057 892 4


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. http://dumps.wikimedia.org/, January 2010.