Wikipedia talk (el)

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


Internal namewiki_talk_el
NameWikipedia talk (el)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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


Size n =40,254
Volume m =190,279
Unique edge count m̿ =77,390
Wedge count s =181,858,756
Triangle count t =53,432
Maximum degree dmax =23,615
Maximum outdegree d+max =23,614
Maximum indegree dmax =6,251
Average degree d =9.453 92
Size of LCC N =39,667
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.729 31
90-Percentile effective diameter δ0.9 =3.726 31
Median distance δM =3
Mean distance δm =3.232 07
Degree assortativity ρ =−0.385 175
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.673 621
Clustering coefficient c =0.000 881 431
Operator 2-norm ν =2,030.64
Cyclic eigenvalue π =1,889.59
Reciprocity y =0.173 601


Degree distribution

Cumulative degree distribution

Temporal distribution

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] 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.