Wikipedia messages (en)

This is the communication network of the English Wikipedia. Nodes represent users of the English Wikipedia, and an edge from user A to user B denotes that user A has written a message on the talk page of user B.

Metadata

CodeWK
Internal namewiki-Talk
NameWikipedia messages (en)
Data sourcehttp://snap.stanford.edu/data/wiki-Talk.html
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Communication network
Node meaningUser
Edge meaningMessage
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops
Snapshot Is a snapshot and likely to not contain all data
Multiplicity Does not have multiple edges, but the underlying data has

Statistics

Size n =2,394,385
Volume m =5,021,410
Loop count l =0
Wedge count s =12,593,522,422
Claw count z =194,800,937,548,878
Cross count x =4,295,377,891,639,605,248
Triangle count t =9,203,519
Square count q =2,152,013,141
4-Tour count T4 =67,599,513,946
Maximum degree dmax =100,032
Maximum outdegree d+max =100,022
Maximum indegree dmax =3,311
Average degree d =4.194 32
Fill p =8.758 66 × 10−7
Size of LCC N =2,388,953
Size of LSCC Ns =111,881
Relative size of LSCC Nrs =0.046 726 4
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.426 22
90-Percentile effective diameter δ0.9 =3.942 46
Mean distance δm =3.881 73
Gini coefficient G =0.735 980
Balanced inequality ratio P =0.204 663
Outdegree balanced inequality ratio P+ =0.076 922 2
Indegree balanced inequality ratio P =0.318 476
Relative edge distribution entropy Her =0.786 680
Power law exponent γ =4.293 32
Tail power law exponent γt =2.461 00
Degree assortativity ρ =−0.060 392 0
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.002 192 44
Spectral norm α =493.096
Operator 2-norm ν =319.068
Cyclic eigenvalue π =228.940
Algebraic connectivity a =0.031 811 8
Reciprocity y =0.144 121
Non-bipartivity bA =0.354 761
Normalized non-bipartivity bN =0.016 804 0
Spectral bipartite frustration bK =0.002 039 97

Plots

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

Zipf plot

Hop distribution

In/outdegree scatter plot

SynGraphy

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] Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. Governance in social media: A case study of the Wikipedia promotion process. In Proc. Int. Conf. on Weblogs and Soc. Media, 2010.