Wikipedia talk (sv)

This is the communication network of the Swedish Wikipedia. Nodes represent users, and an edge from user A to user B denotes that user A wrote a message on the talk page of user B at a certain timestamp.

Metadata

CodeTsv
Internal namewiki_talk_sv
NameWikipedia talk (sv)
Data sourcehttps://zenodo.org/record/49561
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Communication network
Dataset timestamp 2017-10-27
Node meaningUser
Edge meaningMessage
Network formatUnipartite, directed
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =120,833
Volume m =598,066
Unique edge count m̿ =261,494
Wedge count s =1,716,076,564
Triangle count t =401,802
Maximum degree dmax =77,916
Maximum outdegree d+max =77,915
Maximum indegree dmax =6,261
Average degree d =9.899 05
Size of LCC N =119,327
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.603 98
90-Percentile effective diameter δ0.9 =3.629 07
Mean distance δm =3.123 74
Degree assortativity ρ =−0.268 996
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.673 375
Clustering coefficient c =0.000 702 420
Operator 2-norm ν =3,086.47
Cyclic eigenvalue π =2,747.71
Reciprocity y =0.136 095

Plots

Degree distribution

Cumulative degree distribution

Temporal distribution

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] Jun Sun, Jérôme Kunegis, and Steffen Staab. Predicting user roles in social networks using transfer learning with feature transformation. In Proc. ICDM Workshop on Data Min. in Netw., 2016.