DBLP coauthorship
This is the coauthorship network of the DBLP computer science bibliography.
Nodes are authors and an undirected edge between two nodes exists if the
corresponding authors have published at least one paper together.
Metadata
Statistics
Size  n =  317,080

Volume  m =  1,049,866

Loop count  l =  0

Wedge count  s =  21,780,889

Claw count  z =  431,568,151

Cross count  x =  11,548,309,777

Triangle count  t =  2,224,385

Square count  q =  55,107,655

4Tour count  T_{4} =  530,084,528

Maximum degree  d_{max} =  343

Average degree  d =  6.622 09

Fill  p =  2.088 47 × 10^{−5}

Size of LCC  N =  317,080

Diameter  δ =  23

50Percentile effective diameter  δ_{0.5} =  6.087 33

90Percentile effective diameter  δ_{0.9} =  8.164 68

Median distance  δ_{M} =  7

Mean distance  δ_{m} =  6.752 76

Gini coefficient  G =  0.535 780

Balanced inequality ratio  P =  0.298 185

Relative edge distribution entropy  H_{er} =  0.955 003

Power law exponent  γ =  1.720 01

Tail power law exponent  γ_{t} =  3.261 00

Tail power law exponent with p  γ_{3} =  3.261 00

pvalue  p =  0.000 00

Degree assortativity  ρ =  +0.266 521

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.306 377

Spectral norm  α =  115.847

Algebraic connectivity  a =  0.012 818 8

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.138 12

Nonbipartivity  b_{A} =  0.856 921

Normalized nonbipartivity  b_{N} =  0.032 705 7

Spectral bipartite frustration  b_{K} =  0.002 175 53

Plots
Matrix decompositions plots
Downloads
References
[1]

Jérôme Kunegis.
KONECT – The Koblenz Network Collection.
In Proc. Int. Conf. on World Wide Web Companion, pages
1343–1350, 2013.
[ http ]

[2]

Jaewon Yang and Jure Leskovec.
Defining and evaluating network communities based on groundtruth.
In Proc. ACM SIGKDD Workshop on Min. Data Semant., page 3,
2012.
