w3c_email — W3C mailing list emails (1995-2004)

Description

A directed network of emails sent to the public mailing lists of the World Wide Web Consortium (W3C), from the W3C corpus crawled in 2004 for the Enterprise track of TREC 2005, as processed by Benson and Kleinberg (the pvc-email-W3C dataset) to study networks whose edges were "found" from the activity of a set of core nodes. Each node is an email address, and a directed edge from address A to address B with a timestamp is an email sent by A to B; an email with several recipients gives several edges. The core nodes are the addresses of the domain w3.org (e.g. W3C staff and the mailing lists themselves); every email is sent from or to a core address.

The emails date mostly from 1995 to 2004; a few dates outside this range (from 1988 to 2009) are likely erroneous. There are 328 emails from an address to itself.

The network has the following properties:

address: the email address.
is_core: whether the address is in the domain w3.org.
Edge time: the time the email was sent, in Unix time. The source data give the times in seconds since the start of year 1 (as in the Julia language); they were converted by subtracting 62,135,683,200 seconds.

Tags

Social Communication Online Unweighted Multigraph Timestamps Metadata

Citation

A. R. Benson, J. Kleinberg, "Found Graph Data and Planted Vertex Covers." Advances in Neural Information Processing Systems 31 (2018) 10.48550/arXiv.1805.01209 Sci-Hub
N. Craswell, A. P. de Vries, I. Soboroff, "Overview of the TREC 2005 Enterprise Track." Proceedings of the Fourteenth Text REtrieval Conference (TREC 2005) (2005) trec.nist.gov

Upstream URL OK

https://www.cs.cornell.edu/~arb/data/pvc-email-W3C/
https://tides.umiacs.umd.edu/webtrec/trecent/parsed_w3c_corpus.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
w3c_email	20,082	124,303	6.19	142.82	41.51	283.15	-0.33	0.13	17	0.95	Directed	Unipartite	address is_core	time	965 KiB	1.3 MiB	1.2 MiB	1.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.