logo Netzschleuder network catalog, repository, and centrifuge

wiki_rfa — Wikipedia RfA voting network (2013)

Description

Network of the votes in the elections for adminship of the English Wikipedia (Requests for Adminship, RfA), from 2003 to May 2013, collected by R. West, H. S. Paskov, J. Leskovec and C. Potts. To become an administrator, a Wikipedia user (or another user on their behalf) submits a request, and members of the community vote in favor, against or neutrally, usually with a short comment. Nodes are users, and a directed edge $i \to j$ is a vote cast by user $i$ in an election of candidate $j$. A user can vote in several elections of the same candidate, so that there can be parallel edges.

The network has the following properties:

  • name: the Wikipedia user name. In about 1,700 votes the voter's name is missing in the upstream data (as are the date and the comment); each of these votes is assigned to a separate node with an empty name.
  • vote: the vote: $1$ (support), $0$ (neutral) or $-1$ (oppose).
  • result: the outcome of the election: $1$ (the candidate was promoted) or $-1$ (not promoted).
  • year: the year of the election.
  • date: the date and time of the vote, as text (e.g. 23:13, 19 April 2013).
  • txt: the comment accompanying the vote, in Wikipedia markup.
Tags
Social Relationships Signed
Citation
  • R. West, H. S. Paskov, J. Leskovec, and C. Potts, "Exploiting Social Network Structure for Person-to-Person Sentiment Analysis." Trans. of the Assoc. for Comp. Ling. 2, 297-310 (2014). arxiv:1409.2450 10.1162/tacl_a_00184 Sci-Hub
Upstream URL OK
http://snap.stanford.edu/data/wiki-RfA.html
Networks
Tip: hover over a column header for a description.
Column legend
$\left<k\right>$
Mean degree
$\sigma_k$
Standard deviation of the degrees
$\lambda_h$
Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$
Random walk mixing time
$r$
Degree assortativity
$c$
Global clustering coefficient
$\oslash$
(Pseudo-) diameter
$S$
Relative size of the largest component
NPs
Node properties
EPs
Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
wiki_rfa 11,381 198,275 17.42 78.19 163.99 8.83 -0.04 0.16 7 1.00 Directed Unipartite name vote result year date txt 8.9 MiB 10.6 MiB 10.2 MiB 13.2 MiB
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.