email_eu_core — Email recipients at a European research institution (2003-2005)
- Description
A bipartite network of the members of a large European research institution and the emails they exchanged, constructed by Benson et al. from the timestamped email records underlying the SNAP
email-Eu-corenetwork (Leskovec, Kleinberg and Faloutsos; Yin et al.). The records are anonymized (sender, recipient, time) entries, at 1-second resolution, of the emails sent between members of the institution from September 2003 to December 2005 (803 days); messages to or from people outside the institution are not included. Benson et al. reconstructed each email as a group made of a sender and all the recipients that the sender emailed at exactly the same time. In this network each email is a node connected to its sender and recipients (the source data do not distinguish the sender from the recipients). This is the version of the data without restriction on the number of participants (at most 40 per email). 25,755 emails have a single participant, i.e. a member who emailed themselves. Each member belongs to one of 42 departments of the institution, as given by the SNAP department labels.The network has the following properties:
is_email, whether the node is an email (otherwise a member of the institution).- Member nodes:
department, the department of the member (anonymized index, from 0 to 41);snap_id, the node identifier in the SNAPemail-Eu-corenetwork (0-based; equal to the source's 1-based identifier minus one). - Email nodes:
time, the time the email was sent, in Unix time (seconds since 1970-01-01 UTC).
- Tags
- Social Communication Unweighted Timestamps Metadata
- Citation
-
- A. R. Benson, R. Abebe, M. T. Schaub, A. Jadbabaie, J. Kleinberg, "Simplicial closure and higher-order link prediction." Proceedings of the National Academy of Sciences 115(48), E11221-E11230 (2018) 10.1073/pnas.1800683115 Sci-Hub
- H. Yin, A. R. Benson, J. Leskovec, D. F. Gleich, "Local Higher-Order Graph Clustering." Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 555-564 (2017) 10.1145/3097983.3098069 Sci-Hub
- J. Leskovec, J. Kleinberg, C. Faloutsos, "Graph evolution: Densification and shrinking diameters." ACM Transactions on Knowledge Discovery from Data 1(1), 2 (2007) 10.1145/1217299.1217301 Sci-Hub
- Upstream URL OK
-
https://www.cs.cornell.edu/~arb/data/email-Eu/
https://snap.stanford.edu/data/email-Eu-core.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