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

Code		`CL`
Internal name		`actor-collaboration`
Name		Actor collaborations
Data source		http://www3.nd.edu/~networks/resources.htm
Availability		Dataset is available for download
Consistency check		Dataset passed all tests
Category		Miscellaneous network
Dataset timestamp		1999
Node meaning		Actor
Edge meaning		Collaboration
Network format		Unipartite, undirected
Edge type		Unweighted, multiple edges
Loops		Does not contain loops

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
4-Tour count	T₄ =	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
50-Percentile effective diameter	δ_0.5 =	3.158 73
90-Percentile 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 p-value	p_ρ =	0.000 00
Clustering coefficient	c =	0.166 040
Spectral norm	α =	3,278.61
Spectral separation	\|λ₁[A] / λ₂[A]\| =	1.489 02
Non-bipartivity	b_A =	0.867 127
Normalized non-bipartivity	b_N =	0.153 139
Algebraic non-bipartivity	χ =	0.235 956
Spectral bipartite frustration	b_K =	0.000 735 675
Controllability	C =	473
Relative controllability	C_r =	0.001 237 51

[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]	Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286(5439):509–512, 1999.