mag_history_coauthor — MAG History coauthor simplices (2017)

Description

Coauthorship networks of publications in the field of History, assembled by A. R. Benson and collaborators from the Microsoft Academic Graph (MAG), as distributed in the Open Academic Graph. Each publication whose fields of study include the tag "History" is a set of authors (a simplex, or hyperedge), timestamped by its year of publication (from 1800 to 2018).

There are four versions of the data:

max-25-bip, full-bip: bipartite networks where each publication is a node connected to its authors. The max-25 versions include only publications with at most 25 authors, while the full versions include all publications.
max-25-proj, full-proj: one-mode projections onto the authors, where every pair of coauthors of a publication is connected by an edge. Each publication contributes its own edges, so a pair of authors who wrote $k$ publications together is connected by $k$ parallel edges, each with the year of its publication.

The networks have the following properties:

(Node) label: the name of the author (empty for publication nodes).
(Node) is_simplex: whether the node is a publication (otherwise it is an author; bipartite versions only).
(Edge) time: the year of publication of the corresponding paper.

Tags

Social Collaboration Unweighted Timestamps Weighted Projection Multigraph

Added

2020-08-11

Citation

A. R. Benson et al., "Simplicial Closure and Higher-order Link Prediction." Preprint, arXiv:1802.06916 (2018) arXiv:1802.06916

Upstream URL OK

http://www.cs.cornell.edu/~arb/data/coauth-MAG-History/index.html

Networks

Tip: click on a column header to sort the list, or hover over it 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
max-25-bip	2,847,387	2,367,289	1.66	5.22	32.80	23855.08	-0.01	0.00	66	0.27	Undirected	Bipartite	label is_simplex	time	15.8 MiB	27.5 MiB	25.3 MiB	30.1 MiB
max-25-proj	1,034,875	1,365,815	2.64	10.41	66.30	13821.63	0.52	0.46	32	0.21	Undirected	Unipartite	label	time	10.5 MiB	16.5 MiB	15.7 MiB	16.7 MiB
full-bip	2,848,023	2,398,702	1.68	5.33	32.80	23855.16	-0.01	0.00	66	0.28	Undirected	Bipartite	label is_simplex	time	16.0 MiB	27.8 MiB	25.6 MiB	30.4 MiB
full-proj	1,034,875	2,984,794	5.77	37.66	923.00	52378.04	0.84	0.86	32	0.23	Undirected	Unipartite	label	time	11.0 MiB	20.8 MiB	19.5 MiB	21.0 MiB