logo Netzschleuder network catalog, repository, and centrifuge

elec — Wikipedia adminship vote (2008)

Description

Votes in the elections of administrators of the English Wikipedia, collected by J. Leskovec, D. Huttenlocher and J. Kleinberg. In order for a Wikipedia user to become an administrator, a Request for Adminship (RfA) is issued, and the community decides on the promotion by a public discussion or a vote. The data were extracted from the complete dump of the Wikipedia page edit history of 3 January 2008, and comprise 2,794 elections held between 2004 and 2008, of which 1,248 resulted in a promotion. Users may be candidates in more than one election.

Nodes are Wikipedia users that cast a vote, were candidates, or nominated a candidate, and a directed edge $(i,j)$ indicates that user $i$ voted in an election of candidate $j$. Each vote is an edge, so the network can contain parallel edges when a user voted in several elections of the same candidate. Some users voted in their own elections (72 self-loops). The 25 users that only appear as nominators have no edges. Some vote times are invalid (in the years 2061 to 2105), and are kept as they are in the source data. The time zone of the times is not documented; they are interpreted as UTC.

The network has the following properties:

  • user_id: the user ID in the source data.
  • name: the user name (lowercased in the source data; in a few names a non-ASCII character is truncated in the source and replaced by U+FFFD).
  • vote: the vote, $+1$ (support), $0$ (neutral) or $-1$ (oppose).
  • time: the time of the vote, in Unix time.
  • election: the number of the election (in the order of the source file, from 0).
  • promoted: whether the election resulted in the promotion of the candidate.
  • closed: the time the election was closed, in Unix time.
  • nominator: the node index of the user that nominated the candidate, or $-1$ if unknown (2,117 elections).
Tags
Social Online Signed Timestamps Multigraph Metadata
Citation
  • J. Leskovec, D. Huttenlocher, J. Kleinberg, "Signed networks in social media." Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI '10), 1361-1370 (2010) 10.1145/1753326.1753532 Sci-Hub
  • J. Leskovec, D. Huttenlocher, J. Kleinberg, "Predicting positive and negative links in online social networks." Proceedings of the 19th International Conference on World Wide Web (WWW '10), 641-650 (2010) 10.1145/1772690.1772756 Sci-Hub
  • J. Leskovec, D. Huttenlocher, J. Kleinberg, "Governance in social media: A case study of the Wikipedia promotion process." Proceedings of the International AAAI Conference on Web and Social Media (ICWSM) 4(1), 98-105 (2010) 10.1609/icwsm.v4i1.14013 Sci-Hub
Upstream URL OK
https://snap.stanford.edu/data/wiki-Elec.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
elec 7,118 103,675 14.57 60.34 136.20 9.44 -0.07 0.14 7 0.99 Directed Unipartite weight time 580 KiB 891 KiB 866 KiB 783 KiB
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.