Wikipedia edits (frp)

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


Internal nameedit-frpwiki
NameWikipedia edits (frp)
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 =7,702
Left size n1 =1,085
Right size n2 =6,617
Volume m =169,876
Unique edge count m̿ =63,637
Wedge count s =38,915,915
Claw count z =21,951,309,684
Cross count x =10,891,820,482,747
Square count q =242,521,434
4-Tour count T4 =2,095,974,486
Maximum degree dmax =17,069
Maximum left degree d1max =17,069
Maximum right degree d2max =334
Average degree d =44.112 2
Average left degree d1 =156.568
Average right degree d2 =25.672 7
Fill p =0.008 863 78
Average edge multiplicity m̃ =2.669 45
Size of LCC N =6,941
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.113 52
90-Percentile effective diameter δ0.9 =4.272 39
Median distance δM =4
Mean distance δm =3.405 57
Gini coefficient G =0.835 371
Balanced inequality ratio P =0.176 867
Left balanced inequality ratio P1 =0.058 213 0
Right balanced inequality ratio P2 =0.211 913
Relative edge distribution entropy Her =0.774 887
Power law exponent γ =1.808 76
Tail power law exponent γt =1.581 00
Tail power law exponent with p γ3 =1.581 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.641 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =7.271 00
Right p-value p2 =0.007 000 00
Degree assortativity ρ =−0.155 288
Degree assortativity p-value pρ =0.000 00
Spectral norm α =847.211
Algebraic connectivity a =0.034 999 5
Spectral separation 1[A] / λ2[A]| =2.617 64
Controllability C =5,551
Relative controllability Cr =0.735 914


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

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.