In order to represent any network, it is necessary to characterize the properties of the corresponding graph of nodes and links. Studies on the collaboration network of movie actors have been described in literature such as the work done by Watts and Strogatz (1998) and Barabási and Albert in 1999 and 2000. The general characteristics are described below. • According to Watts and Strogatz, the movie-actor network indicated the following characteristics showing a small-world property of the underlying network: :Size: 225 226 :Average degree: 61 :Average path length: 3.65 :Average
clustering coefficient: 0.79 Compared to a random graph of the same size and average degree, the average path length is close in value. However, the clustering coefficient is much higher for the movie actor network. • The network characteristics and scaling exponents given by Barabási and Albert, indicates the scale-free behavior: :Size: 212 250 :Average
degree(connectivity): 28.78 :Clustering coefficient: 0.79 The network fits a scale-free degree distribution
p(
k) ~
k−γactor, with an exponent γactor = 2.3 ± 0.1. • According to Newman, Strogatz and Watts, the movie actor network can be described by a bipartite graph. Contrary to the studies described previously, they study a
bipartite graph with nodes of two types: movies and actors, with links, with edges linking an actor to a movie they appear in. Co-stars are both linked to the same movie they appear in. Therefore, the collaboration graph of film actors can be constructed using a
transformation matrix of the bipartite graph interaction matrix. == Data collection==