Wikiquote edits (pt)

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

Metadata

Codeqpt
Internal nameedit-ptwikisource
NameWikiquote edits (pt)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
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

Statistics

Size n =98,234
Left size n1 =2,295
Right size n2 =95,939
Volume m =229,396
Unique edge count m̿ =151,542
Wedge count s =887,256,300
Claw count z =5,561,377,621,245
Cross count x =28,353,954,632,258,324
Square count q =57,466,590
4-Tour count T4 =4,009,134,068
Maximum degree dmax =34,474
Maximum left degree d1max =34,474
Maximum right degree d2max =744
Average degree d =4.670 40
Average left degree d1 =99.954 7
Average right degree d2 =2.391 06
Fill p =0.000 688 264
Average edge multiplicity m̃ =1.513 75
Size of LCC N =96,781
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.468 55
90-Percentile effective diameter δ0.9 =5.177 56
Median distance δM =4
Mean distance δm =3.903 22
Gini coefficient G =0.722 282
Balanced inequality ratio P =0.219 387
Left balanced inequality ratio P1 =0.047 799 4
Right balanced inequality ratio P2 =0.327 490
Relative edge distribution entropy Her =0.702 256
Power law exponent γ =4.043 37
Tail power law exponent γt =3.201 00
Degree assortativity ρ =−0.136 708
Degree assortativity p-value pρ =0.000 00
Spectral norm α =655.175
Algebraic connectivity a =0.034 389 4

Plots

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

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

Matrix decompositions plots

Downloads

References

[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. http://dumps.wikimedia.org/, January 2010.