Wikiquote edits (no)

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


Internal nameedit-nowikiquote
NameWikiquote edits (no)
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 =3,369
Left size n1 =567
Right size n2 =2,802
Volume m =13,926
Unique edge count m̿ =7,115
Wedge count s =1,033,876
Claw count z =254,751,285
Cross count x =63,812,471,268
Square count q =395,598
4-Tour count T4 =7,315,826
Maximum degree dmax =1,947
Maximum left degree d1max =1,947
Maximum right degree d2max =312
Average degree d =8.267 14
Average left degree d1 =24.560 8
Average right degree d2 =4.970 02
Fill p =0.004 478 41
Average edge multiplicity m̃ =1.957 27
Size of LCC N =2,948
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.657 35
90-Percentile effective diameter δ0.9 =5.978 63
Median distance δM =4
Mean distance δm =4.391 94
Gini coefficient G =0.779 354
Balanced inequality ratio P =0.189 214
Left balanced inequality ratio P1 =0.113 241
Right balanced inequality ratio P2 =0.250 826
Relative edge distribution entropy Her =0.811 360
Power law exponent γ =2.520 43
Tail power law exponent γt =2.121 00
Tail power law exponent with p γ3 =2.121 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.751 00
Left p-value p1 =0.003 000 00
Right tail power law exponent with p γ3,2 =6.121 00
Right p-value p2 =0.392 000
Degree assortativity ρ =−0.194 969
Degree assortativity p-value pρ =6.694 17 × 10−62
Spectral norm α =189.961
Algebraic connectivity a =0.011 577 5
Spectral separation 1[A] / λ2[A]| =1.086 46
Controllability C =2,241
Relative controllability Cr =0.697 479


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.