Wikipedia edits (frr)

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


Internal nameedit-frrwiki
NameWikipedia edits (frr)
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 =20,137
Left size n1 =2,507
Right size n2 =17,630
Volume m =123,282
Unique edge count m̿ =52,048
Wedge count s =137,026,293
Claw count z =620,797,857,310
Cross count x =2,347,204,926,201,584
Square count q =39,200,980
4-Tour count T4 =861,933,864
Maximum degree dmax =48,796
Maximum left degree d1max =48,796
Maximum right degree d2max =1,860
Average degree d =12.244 3
Average left degree d1 =49.175 1
Average right degree d2 =6.992 74
Fill p =0.001 177 60
Average edge multiplicity m̃ =2.368 62
Size of LCC N =19,815
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.827 11
90-Percentile effective diameter δ0.9 =3.671 20
Median distance δM =2
Mean distance δm =2.653 71
Gini coefficient G =0.838 316
Balanced inequality ratio P =0.154 487
Left balanced inequality ratio P1 =0.057 218 4
Right balanced inequality ratio P2 =0.215 271
Relative edge distribution entropy Her =0.725 145
Power law exponent γ =2.861 38
Tail power law exponent γt =2.041 00
Tail power law exponent with p γ3 =2.041 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.951 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =2.051 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.203 558
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,196.16
Algebraic connectivity a =0.108 067
Spectral separation 1[A] / λ2[A]| =1.073 72
Controllability C =18,296
Relative controllability Cr =0.911 700


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.