Actor collaborations
These are actor connected by an edge if they both appeared in the same movie.
Each edge is one collaboration, and thus multiple edges are possible.
Metadata
Statistics
Size  n =  382,219

Volume  m =  33,115,812

Unique edge count  m̿ =  30,076,166

Loop count  l =  0

Wedge count  s =  6,266,209,411

Claw count  z =  18,499,665,265,236

Cross count  x =  15,470,703,653,059,368

Triangle count  t =  346,813,199

Square count  q =  86,624,264,954

4Tour count  T_{4} =  718,089,033,442

Maximum degree  d_{max} =  16,764

Average degree  d =  173.282

Fill  p =  0.000 411 746

Average edge multiplicity  m̃ =  1.101 06

Size of LCC  N =  374,511

Diameter  δ =  13

50Percentile effective diameter  δ_{0.5} =  3.158 73

90Percentile effective diameter  δ_{0.9} =  4.309 99

Median distance  δ_{M} =  4

Mean distance  δ_{m} =  3.698 04

Gini coefficient  G =  0.668 859

Balanced inequality ratio  P =  0.242 902

Relative edge distribution entropy  H_{er} =  0.931 486

Power law exponent  γ =  1.281 64

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

Degree assortativity  ρ =  +0.226 725

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.166 040

Spectral norm  α =  3,278.61

Nonbipartivity  b_{A} =  0.867 127

Normalized nonbipartivity  b_{N} =  0.153 139

Algebraic nonbipartivity  χ =  0.235 956

Spectral bipartite frustration  b_{K} =  0.000 735 675

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]

AlbertLászló Barabási and Réka Albert.
Emergence of scaling in random networks.
Science, 286(5439):509–512, 1999.
