chess — Kaggle chess players (2010)

Description

A network among chess players (nodes) giving the chess match outcomes (edges), for game-by-game results among the world’s top chess players. The direction of edge (i,j) denotes white player (i) and black player (j). Each edge is timestamped (approximate). Edge sign is +1 for a win by white, 0 for draw, and -1 for a win by black.¹

Description obtained from the ICON project. ↩

Tags

Social Offline Signed Timestamps

Citation

Kaggle, "Chess ratings - Elo versus the Rest of the World." www.kaggle.com

Upstream URL OK

http://konect.cc/networks/chess

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
chess	7,301	65,053	8.91	28.88	66.57	43.97	0.45	0.18	13	0.97	Directed	Unipartite		weight time	280 KiB	537 KiB	509 KiB	423 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.