Wikinews edits (fa)

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


Internal nameedit-fawikinews
NameWikinews edits (fa)
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 =17,279
Left size n1 =530
Right size n2 =16,749
Volume m =241,703
Unique edge count m̿ =29,634
Wedge count s =50,274,050
Claw count z =131,642,010,746
Cross count x =294,210,393,362,759
Square count q =2,531,009
4-Tour count T4 =221,434,240
Maximum degree dmax =81,234
Maximum left degree d1max =81,234
Maximum right degree d2max =54,709
Average degree d =27.976 5
Average left degree d1 =456.043
Average right degree d2 =14.430 9
Fill p =0.003 338 30
Average edge multiplicity m̃ =8.156 27
Size of LCC N =16,967
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.301 40
90-Percentile effective diameter δ0.9 =4.888 47
Median distance δM =4
Mean distance δm =3.569 68
Gini coefficient G =0.948 082
Balanced inequality ratio P =0.069 693 0
Left balanced inequality ratio P1 =0.035 063 7
Right balanced inequality ratio P2 =0.112 452
Relative edge distribution entropy Her =0.726 570
Power law exponent γ =3.515 79
Tail power law exponent γt =2.251 00
Tail power law exponent with p γ3 =2.251 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.511 00
Left p-value p1 =0.357 000
Right tail power law exponent with p γ3,2 =4.621 00
Right p-value p2 =0.001 000 00
Degree assortativity ρ =−0.300 998
Degree assortativity p-value pρ =0.000 00
Spectral norm α =44,160.0
Algebraic connectivity a =0.014 620 8


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.