logo Netzschleuder network catalog, repository, and centrifuge

dblp_coauthor_law — DBLP co-authorships (2010, 2011)

Description

Two snapshots of the scientific collaboration network of the DBLP computer science bibliography, extracted by the Laboratory for Web Algorithmics (LAW) from the standard DBLP download in June 2010 (2010) and July 2011 (2011). Nodes are authors, and an undirected edge connects two authors if they have co-authored at least one publication listed in DBLP (a one-mode projection of the author-publication network; edges are unweighted).

Sizes (authors, edges): 2010 326,186, 807,700; 2011 986,324, 3,353,618.

Vertex property: name, the name of the author as given in DBLP.

Tags
Social Collaboration Unweighted Projection
Added
2026-10-25
Citation
  • P. Boldi and S. Vigna, "The WebGraph framework I: compression techniques." Proceedings of the 13th International Conference on World Wide Web (WWW 2004), 595-602 (2004). 10.1145/988672.988752 Sci-Hub
  • P. Boldi, M. Rosa, M. Santini, and S. Vigna, "Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks." Proceedings of the 20th International Conference on World Wide Web (WWW 2011), 587-596 (2011). 10.1145/1963405.1963488 Sci-Hub
Upstream URL OK
https://law.di.unimi.it/datasets.php
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
2010 326,186 807,700 4.95 7.67 73.93 818.84 0.33 0.39 26 0.69 Undirected Unipartite name 7.8 MiB 10.8 MiB 10.7 MiB 10.1 MiB
2011 986,324 3,353,618 6.80 12.98 117.02 376.24 0.13 0.20 23 0.82 Undirected Unipartite name 25.0 MiB 35.7 MiB 35.0 MiB 33.1 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.