Wikipedia talk (sr)

This is the communication network of the Serbian 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

CodeTsr
Internal namewiki_talk_sr
NameWikipedia talk (sr)
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 =103,068
Volume m =312,837
Unique edge count m̿ =153,042
Wedge count s =1,421,288,750
Triangle count t =103,105
Maximum degree dmax =47,687
Maximum outdegree d+max =47,685
Maximum indegree dmax =9,057
Average degree d =6.070 50
Size of LCC N =102,816
Diameter δ =7
50-Percentile effective diameter δ0.5 =2.843 54
90-Percentile effective diameter δ0.9 =3.791 96
Median distance δM =3
Mean distance δm =3.219 08
Degree assortativity ρ =−0.330 145
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.683 829
Clustering coefficient c =0.000 217 630
Operator 2-norm ν =2,609.00
Cyclic eigenvalue π =2,550.56
Reciprocity y =0.121 365

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.