Wikipedia edits (lez)

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


Internal nameedit-lezwiki
NameWikipedia edits (lez)
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 =10,197
Left size n1 =639
Right size n2 =9,558
Volume m =67,119
Unique edge count m̿ =25,794
Wedge count s =25,263,456
Claw count z =31,300,891,777
Cross count x =33,368,154,979,521
Square count q =10,565,749
4-Tour count T4 =185,666,364
Maximum degree dmax =18,313
Maximum left degree d1max =18,313
Maximum right degree d2max =1,353
Average degree d =13.164 5
Average left degree d1 =105.038
Average right degree d2 =7.022 28
Fill p =0.004 223 29
Average edge multiplicity m̃ =2.602 12
Size of LCC N =9,922
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.181 35
90-Percentile effective diameter δ0.9 =4.334 33
Median distance δM =4
Mean distance δm =3.414 72
Gini coefficient G =0.838 915
Balanced inequality ratio P =0.155 865
Left balanced inequality ratio P1 =0.061 621 9
Right balanced inequality ratio P2 =0.227 015
Relative edge distribution entropy Her =0.733 820
Power law exponent γ =2.697 40
Tail power law exponent γt =1.981 00
Tail power law exponent with p γ3 =1.981 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.661 00
Left p-value p1 =0.003 000 00
Right tail power law exponent with p γ3,2 =2.011 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.420 309
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,350.00
Algebraic connectivity a =0.036 840 3
Spectral separation 1[A] / λ2[A]| =1.221 63
Controllability C =9,026
Relative controllability Cr =0.888 386


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.