Skip to main content
zenodoopen

email-EU

<h3><strong>Overview</strong></h3><p>This hypergraph dataset was generated using email data from a large European research institution for a period from October 2003 to May 2005 (18 months). Information about all incoming and outgoing emails between members of the research institution has been anonymized. The e-mails only represent communication between institution members (the core), and the dataset does not contain incoming messages from or outgoing messages to the rest of the world.</p><p>This is a temporal hypergraph dataset, which here means a sequence of timestamped hyperedges where each hyperedge is a set of nodes. Timestamps are in ISO8601 format. In email communication, messages can be sent to multiple recipients. In this dataset, nodes are email addresses at a European research institution. The original data source only contains directed temporal edge tuples (sender, receiver, timestamp), where timestamps are recorded at 1-second resolution. The hyperedges are undirected and consist of a sender and all receivers grouped such that the email between the sender and each receiver has the same timestamp.</p><h4><strong>Statistics</strong></h4><p>Some basic statistics of this dataset are:</p><ul><li>number of nodes: 1,005</li><li>number of timestamped hyperedges: 235,263</li><li>distribution of the connected components:</li></ul><p>Component Size, Number&nbsp;</p><ul><li>986, 1</li><li>1, 19</li></ul><h4><strong>Source of original data</strong></h4><p>Source: <a href="https://www.cs.cornell.edu/~arb/data/email-Eu/">email-Eu dataset</a></p><h4><strong>References</strong></h4><p>If you use this dataset, please cite these references:</p><ul><li><a href="https://doi.org/10.1073/pnas.1800683115">Simplicial closure and higher-order link prediction</a>, Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg. Proceedings of the National Academy of Sciences (PNAS), 2018.</li><li><a href="https://doi.org/10.1145/3097983.3098069">Local Higher-order Graph Clustering</a>, Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich. Proceedings of KDD, 2017.</li><li><a href="https://doi.org/10.1145/1217299.1217301">Graph Evolution: Densification and Shrinking Diameters</a>, Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. ACM Transactions on Knowledge Discovery from Data, 2007.</li></ul>

ShareScore

40/100

Overall dataset sharing score

Score breakdown

These five areas show where the dataset supports — or may limit — practical reuse.

Stewardship
4
Harmonization
4
Access
20
Reuse readiness
8
Engagement
4