dblp_simplices — DBLP coauthor simplices (2017)
- Description
A temporal bipartite network of co-authorship among computer scientists, constructed by A. R. Benson and collaborators from the DBLP computer science bibliography, as of 3 September 2017. Each publication is a simplex formed by the set of its authors, and is timestamped with the year of publication. The networks are named
<dataset>-<representation>, where the dataset is eitherfull, with all publications, ormax-25, restricted to publications with at most 25 authors, and the representation is one of:bip: a bipartite network of publications and authors, in which each publication is connected to each of its authors. Publication nodes come first, followed by the author nodes.proj: the one-mode projection onto the authors, where each publication adds an edge between every pair of its authors, so that pairs of authors who wrote several papers together are connected by multiple parallel edges, one for each paper. Publications with a single author do not contribute edges.
The networks have the following properties:
- Nodes:
label, the name of the author (empty for publication nodes);is_simplex(biponly), whether the node is a publication (otherwise an author). - Edges:
time, the year of the publication.
- Tags
- Social Collaboration Unweighted Timestamps Weighted Projection
- 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-DBLP/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 5,630,445 10,304,422 3.66 9.98 26.20 1700.20 -0.12 0.00 45 0.91 Undirected Bipartite label is_simplex time 123.5 MiB 185.5 MiB 182.0 MiB 172.0 MiB max-25-proj 1,930,378 14,103,414 14.61 46.32 119.13 592.37 0.14 0.20 22 0.86 Undirected Unipartite label time 71.2 MiB 119.4 MiB 116.3 MiB 102.5 MiB full-bip 5,631,059 10,326,841 3.67 9.99 26.20 1700.20 -0.12 0.00 45 0.91 Undirected Bipartite label is_simplex time 121.5 MiB 182.0 MiB 178.2 MiB 174.3 MiB full-proj 1,930,378 14,639,786 15.17 47.88 282.83 592.37 0.15 0.23 22 0.86 Undirected Unipartite label time 71.6 MiB 121.3 MiB 118.0 MiB 70.9 MiB