WikiSigned

This undirected signed network contains interpreted interactions between the users of the English Wikipedia that have edited pages about politics. Each interaction, such as text editing, reverts, restores and votes are given a positive or negative value. The result can be interpreted as a web of trust. An edge represents an interaction and a node represents a user. Note that a user may revert his own edits, and thus this network contains negatively weighted loops. The dataset is based on a set of 563 articles from the politics domain of the English Wikipedia.

Metadata

CodeW2
Internal namewikisigned-k2
NameWikiSigned
Data sourcehttp://perso.telecom-paristech.fr/~maniu/wikisigned/datasets.html
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Online contact network
Node meaningUser
Edge meaningInteraction
Network formatUnipartite, directed
Edge typeSigned, possibly weighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =138,592
Volume m =740,397
Loop count l =291
Wedge count s =235,954,939
Claw count z =393,108,123,126
Cross count x =912,139,858,727,170
Triangle count t =2,978,026
Square count q =255,775,680
4-Tour count T4 =2,991,456,962
Maximum degree dmax =11,673
Maximum outdegree d+max =2,586
Maximum indegree dmax =9,316
Average degree d =10.684 6
Fill p =3.854 68 × 10−5
Size of LCC N =137,740
Size of LSCC Ns =26,699
Relative size of LSCC Nrs =0.192 645
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.338 39
90-Percentile effective diameter δ0.9 =4.186 70
Mean distance δm =3.812 22
Gini coefficient G =0.798 532
Balanced inequality ratio P =0.168 094
Outdegree balanced inequality ratio P+ =0.217 081
Indegree balanced inequality ratio P =0.203 229
Relative edge distribution entropy Her =0.850 404
Power law exponent γ =2.008 54
Tail power law exponent γt =1.681 00
Degree assortativity ρ =−0.051 056 3
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.384 602
Clustering coefficient c =0.037 863 5
Spectral norm α =67.812 9
Operator 2-norm ν =139.313
Cyclic eigenvalue π =68.863 1
Algebraic connectivity a =0.013 828 5
Spectral separation 1[A] / λ2[A]| =1.010 66
Reciprocity y =0.065 825 5
Non-bipartivity bA =0.481 211
Normalized non-bipartivity bN =0.011 578 8
Spectral bipartite frustration bK =0.000 522 891
Negativity ζ =0.121 211
Algebraic conflict ξ =0.022 193 3
Triadic conflict τ =0.076 526 5
Spectral signed frustration φ =0.000 536 837
Controllability C =109,429
Relative controllability Cr =3.270 00

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

Degree assortativity

Zipf plot

Hop distribution

In/outdegree scatter plot

Item rating evolution

Edge weight/multiplicity distribution

Clustering coefficient distribution

Average neighbor degree distribution

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] Silviu Maniu, Talel Abdessalem, and Bogdan Cautis. Casting a web of trust over Wikipedia: An interaction-based approach. In Proc. Int. Conf. on World Wide Web Posters, pages 87–88, 2011.