Wikiquote edits (sq)

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

Metadata

Codeqsq
Internal nameedit-sqwikiquote
NameWikiquote edits (sq)
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 =1,200
Left size n1 =223
Right size n2 =977
Volume m =3,128
Unique edge count m̿ =1,829
Wedge count s =62,240
Claw count z =2,707,293
Cross count x =110,395,485
Square count q =14,123
4-Tour count T4 =366,854
Maximum degree dmax =398
Maximum left degree d1max =398
Maximum right degree d2max =126
Average degree d =5.213 33
Average left degree d1 =14.026 9
Average right degree d2 =3.201 64
Fill p =0.008 394 88
Average edge multiplicity m̃ =1.710 22
Size of LCC N =971
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.769 99
90-Percentile effective diameter δ0.9 =5.891 95
Median distance δM =4
Mean distance δm =4.481 28
Gini coefficient G =0.734 396
Relative edge distribution entropy Her =0.849 736
Power law exponent γ =3.052 36
Tail power law exponent γt =2.101 00
Degree assortativity ρ =−0.248 740
Degree assortativity p-value pρ =3.414 49 × 10−27
Algebraic connectivity a =0.014 070 5

Plots

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

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.
http://konect.cc/networks/edit-sqwikiquote/
konect.cc
crawl=CC-MAIN-2018-09
17162
application/http; msgtype=response
sha1:SMMUK3STBD47CPMAS32LHSQ5TGDWARUZ
<urn:uuid:a183fd24-4a19-429d-9aa9-2b9542765394>
2018-02-21T19:24:40Z
138.48.20.248
text/html
sha1:OIMVYESPWAXWWUFU5MPXJJNA2BXOMNIC
<urn:uuid:d557e914-3a57-4ce2-816d-05f7df5285f5>
http://konect.cc/networks/edit-sqwikiquote/
response
<urn:uuid:9e2f6139-8267-424b-b50c-53c129dc4edc>
robots: classic
hostname: ip-10-236-255-44.ec2.internal
software: Nutch 1.6 (CC)
isPartOf: CC-MAIN-2018-09
operator: Common Crawl Admin
description: Wide crawl of the web for February 2018
publisher: Common Crawl
format: WARC File Format 1.0
conformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf