Wikiquote edits (br)

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


Internal nameedit-brwikisource
NameWikiquote edits (br)
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 =44,718
Left size n1 =202
Right size n2 =44,516
Volume m =101,928
Unique edge count m̿ =67,408
Wedge count s =323,455,863
Claw count z =1,375,436,401,909
Cross count x =4,968,380,555,173,873
Square count q =21,528,892
4-Tour count T4 =1,466,216,408
Maximum degree dmax =21,290
Maximum left degree d1max =21,290
Maximum right degree d2max =478
Average degree d =4.558 70
Average left degree d1 =504.594
Average right degree d2 =2.289 69
Fill p =0.007 496 25
Average edge multiplicity m̃ =1.512 11
Size of LCC N =44,470
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.308 21
90-Percentile effective diameter δ0.9 =3.868 85
Median distance δM =4
Mean distance δm =3.453 20
Gini coefficient G =0.688 411
Balanced inequality ratio P =0.241 013
Left balanced inequality ratio P1 =0.035 299 4
Right balanced inequality ratio P2 =0.359 352
Relative edge distribution entropy Her =0.665 985
Power law exponent γ =4.135 07
Tail power law exponent γt =4.051 00
Tail power law exponent with p γ3 =4.051 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.351 00
Left p-value p1 =0.256 000
Right tail power law exponent with p γ3,2 =7.641 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.315 776
Degree assortativity p-value pρ =0.000 00
Spectral norm α =434.214
Algebraic connectivity a =0.022 184 6
Spectral separation 1[A] / λ2[A]| =1.234 82
Controllability C =44,291
Relative controllability Cr =0.991 493


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.