Wiktionary edits (ps)

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


Internal nameedit-pswiktionary
NameWiktionary edits (ps)
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 =28,802
Left size n1 =228
Right size n2 =28,574
Volume m =66,112
Unique edge count m̿ =53,167
Wedge count s =128,751,308
Claw count z =272,433,738,656
Cross count x =485,909,197,708,920
Square count q =19,307,663
4-Tour count T4 =669,573,254
Maximum degree dmax =11,285
Maximum left degree d1max =11,285
Maximum right degree d2max =93
Average degree d =4.590 79
Average left degree d1 =289.965
Average right degree d2 =2.313 71
Fill p =0.008 160 87
Average edge multiplicity m̃ =1.243 48
Size of LCC N =26,528
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.300 01
90-Percentile effective diameter δ0.9 =3.946 28
Median distance δM =4
Mean distance δm =3.511 95
Gini coefficient G =0.706 373
Balanced inequality ratio P =0.228 620
Left balanced inequality ratio P1 =0.057 614 4
Right balanced inequality ratio P2 =0.340 861
Relative edge distribution entropy Her =0.691 608
Power law exponent γ =2.923 66
Tail power law exponent γt =3.881 00
Tail power law exponent with p γ3 =3.881 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.521 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =8.721 00
Right p-value p2 =0.001 000 00
Degree assortativity ρ =−0.331 464
Degree assortativity p-value pρ =0.000 00
Spectral norm α =219.661
Algebraic connectivity a =0.012 632 0
Spectral separation 1[A] / λ2[A]| =1.490 75
Controllability C =26,342
Relative controllability Cr =0.983 424


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