Wikipedia threads (de)

This is a dataset of discussion threads on the German Wikipedia. Node of the network are users of the German Wikipedia. A directed from user A to user B denotes that user A wrote a comment in a discussion as a reply to a comment of user B.


Internal namewikipedia-discussions-de
NameWikipedia threads (de)
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Communication network
Node meaningUser
Edge meaningReply
Network formatUnipartite, directed
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops
Snapshot Is a snapshot and likely to not contain all data


Size n =91,340
Volume m =2,435,731
Unique edge count m̿ =987,092
Loop count l =384,547
Wedge count s =235,942,901
Claw count z =189,512,901,727
Cross count x =90,906,845,815,278
Triangle count t =5,727,265
Square count q =1,088,430,251
4-Tour count T4 =9,652,669,352
Maximum degree dmax =24,285
Maximum outdegree d+max =12,787
Maximum indegree dmax =11,498
Average degree d =53.333 3
Average edge multiplicity m̃ =2.467 58
Size of LCC N =89,146
Size of LSCC Ns =52,570
Relative size of LSCC Nrs =0.575 542
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.172 52
90-Percentile effective diameter δ0.9 =3.951 42
Mean distance δm =3.645 30
Gini coefficient G =0.905 346
Balanced inequality ratio P =0.107 334
Outdegree balanced inequality ratio P+ =0.113 323
Indegree balanced inequality ratio P =0.120 742
Relative edge distribution entropy Her =0.827 106
Power law exponent γ =1.816 00
Tail power law exponent γt =1.701 00
Degree assortativity ρ =−0.064 893 0
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.911 943
Clustering coefficient c =0.072 821 8
Spectral norm α =4,590.30
Operator 2-norm ν =2,316.66
Cyclic eigenvalue π =2,272.18
Algebraic connectivity a =0.077 071 3
Reciprocity y =0.493 334
Non-bipartivity bA =0.785 514
Normalized non-bipartivity bN =0.043 517 8
Spectral bipartite frustration bK =0.001 077 10


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

In/outdegree scatter plot

Edge weight/multiplicity distribution

Clustering coefficient distribution

Average neighbor degree distribution

Temporal distribution

Diameter/density evolution


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 ]