Wikipedia edits (lt)

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


Internal nameedit-ltwiki
NameWikipedia edits (lt)
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 =447,325
Left size n1 =20,646
Right size n2 =426,679
Volume m =4,564,553
Unique edge count m̿ =2,371,366
Wedge count s =44,777,688,100
Claw count z =1,068,702,738,319,359
Cross count x =2.387 17 × 1019
Square count q =71,723,685,960
4-Tour count T4 =752,908,015,068
Maximum degree dmax =411,072
Maximum left degree d1max =411,072
Maximum right degree d2max =7,283
Average degree d =20.408 2
Average left degree d1 =221.087
Average right degree d2 =10.697 9
Fill p =0.000 269 192
Average edge multiplicity m̃ =1.924 86
Size of LCC N =443,656
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.315 75
90-Percentile effective diameter δ0.9 =3.951 40
Median distance δM =4
Mean distance δm =3.561 06
Gini coefficient G =0.848 376
Balanced inequality ratio P =0.157 875
Left balanced inequality ratio P1 =0.034 456 4
Right balanced inequality ratio P2 =0.215 816
Relative edge distribution entropy Her =0.716 908
Tail power law exponent γt =3.131 00
Degree assortativity ρ =−0.211 646
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,309.09
Spectral separation 1[A] / λ2[A]| =1.358 32
Controllability C =408,531
Relative controllability Cr =0.916 591


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

Hop distribution

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution

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.