Condensed matter (2005)
These are coauthorships between authors of papers uploaded to the "condensed
matter" section of arXiv. As noted from the dataset source: "[...] the
original graph contains two edges with weight inf[ormation], these were removed
before making the graph unweighted."
Metadata
Statistics
Size  n =  39,577

Volume  m =  175,691

Loop count  l =  0

Wedge count  s =  4,629,240

Claw count  z =  106,646,864

Cross count  x =  3,241,514,847

Triangle count  t =  378,059

Square count  q =  4,325,174

4Tour count  T_{4} =  53,469,734

Maximum degree  d_{max} =  278

Average degree  d =  8.878 44

Fill  p =  0.000 224 339

Size of LCC  N =  36,458

Diameter  δ =  18

50Percentile effective diameter  δ_{0.5} =  5.145 42

90Percentile effective diameter  δ_{0.9} =  6.777 24

Median distance  δ_{M} =  6

Mean distance  δ_{m} =  5.658 82

Gini coefficient  G =  0.540 149

Relative edge distribution entropy  H_{er} =  0.947 144

Power law exponent  γ =  1.602 16

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

Degree assortativity  ρ =  +0.186 327

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.245 003

Spectral norm  α =  51.285 7

Algebraic connectivity  a =  0.019 318 5

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.327 44

Nonbipartivity  b_{A} =  0.641 674

Normalized nonbipartivity  b_{N} =  0.050 332 4

Algebraic nonbipartivity  χ =  0.088 251 8

Spectral bipartite frustration  b_{K} =  0.002 341 91

Controllability  C =  2,467

Relative controllability  C_{r} =  0.062 334 2

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]

Mark E. J. Newman.
The structure of scientific collaboration networks.
Proc. Natl. Acad. Sci. U.S.A., 98(2):404–409, 2001.
