Co-stardom network

Last updated

In social network analysis, the co-stardom network represents the collaboration graph of film actors i.e. movie stars. The co-stardom network can be represented by an undirected graph. Nodes correspond to the movie star actors and two nodes are linked if they co-starred (performed) in the same movie. The links are un-directed, and can be weighted or not depending on the goals of study. If the number of times two actors appeared in a movie is needed, links are assigned weights [1] . Initially, the network was found to have a small-world property [2] . Afterwards, it was discovered that more precisely it exhibits a scale-free (power-law) behavior. [3]

Contents

The co-stardom network can also be represented by a bipartite graph where nodes are of two types: actors and movies. Links connect different types of nodes (i.e. actors to movies) if they have a relationship (actors in a movie) [4] .

The parlor game of Six Degrees of Kevin Bacon involves finding paths in this network from specified actors to Kevin Bacon.

Network representation

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) [2] and Barabási and Albert in 1999 [3] and 2000[ citation needed ]. The general characteristics are described below. [5] [6] [7] [8] [9]

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.

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 [3] .

Data collection

The Internet Movie Database IMDB represents one of the largest internet sources for movies/actors data, and it is where most of the datasets are collected to study the collaboration network of co-star actors. IMDB facilitates the ability to collect data for very specific and variable types of network. For example, a network can be constructed using data from all the horror movies made within the 2020–2021 timeframe and only picking the top three co-stars in each movie.

Related Research Articles

<span class="mw-page-title-main">Scale-free network</span> Network whose degree distribution follows a power law

A scale-free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P(k) of nodes in the network having k connections to other nodes goes for large values of k as

<span class="mw-page-title-main">Small-world network</span> Graph where most nodes are reachable in a small number of steps

A small-world network is a graph characterized by a high clustering coefficient and low distances. On an example of social network, high clustering implies the high probability that two friends of one person are friends themselves. The low distances, on the other hand, mean that there is a short chain of social connections between any two people. Specifically, a small-world network is defined to be a network where the typical distance L between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes N in the network, that is:

<span class="mw-page-title-main">Albert-László Barabási</span> Hungarian-American physicist (born 1967)

Albert-László Barabási is a Romanian-born Hungarian-American physicist, best known for his discoveries in network science and network medicine.

<span class="mw-page-title-main">Complex network</span> Network with non-trivial topological features

In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often occur in networks representing real systems. The study of complex networks is a young and active area of scientific research inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks.

<span class="mw-page-title-main">Degree distribution</span>

In the study of graphs and networks, the degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network.

<span class="mw-page-title-main">Barabási–Albert model</span> Scale-free network generation algorithm

The Barabási–Albert (BA) model is an algorithm for generating random scale-free networks using a preferential attachment mechanism. Several natural and human-made systems, including the Internet, the World Wide Web, citation networks, and some social networks are thought to be approximately scale-free and certainly contain few nodes with unusually high degree as compared to the other nodes of the network. The BA model tries to explain the existence of such nodes in real networks. The algorithm is named for its inventors Albert-László Barabási and Réka Albert.

<span class="mw-page-title-main">Watts–Strogatz model</span> Method of generating random small-world graphs

The Watts–Strogatz model is a random graph generation model that produces graphs with small-world properties, including short average path lengths and high clustering. It was proposed by Duncan J. Watts and Steven Strogatz in their article published in 1998 in the Nature scientific journal. The model also became known as the (Watts) beta model after Watts used to formulate it in his popular science book Six Degrees.

In applied probability theory, the Simon model is a class of stochastic models that results in a power-law distribution function. It was proposed by Herbert A. Simon to account for the wide range of empirical distributions following a power-law. It models the dynamics of a system of elements with associated counters. In this model the dynamics of the system is based on constant growth via addition of new elements as well as incrementing the counters at a rate proportional to their current values.

<span class="mw-page-title-main">Reciprocity (network science)</span>

In network science, reciprocity is a measure of the likelihood of vertices in a directed network to be mutually linked. Like the clustering coefficient, scale-free degree distribution, or community structure, reciprocity is a quantitative measure used to study complex networks.

<span class="mw-page-title-main">Network science</span> Academic field

Network science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive and semantic networks, and social networks, considering distinct elements or actors represented by nodes and the connections between the elements or actors as links. The field draws on theories and methods including graph theory from mathematics, statistical mechanics from physics, data mining and information visualization from computer science, inferential modeling from statistics, and social structure from sociology. The United States National Research Council defines network science as "the study of network representations of physical, biological, and social phenomena leading to predictive models of these phenomena."

Mark Newman is a British physicist and Anatol Rapoport Distinguished University Professor of Physics at the University of Michigan, as well as an external faculty member of the Santa Fe Institute. He is known for his fundamental contributions to the fields of complex systems and complex networks, for which he was awarded the Lagrange Prize in 2014 and the APS Kadanoff Prize in 2024.

<span class="mw-page-title-main">Evolving network</span>

Evolving networks are networks that change as a function of time. They are a natural extension of network science since almost all real world networks evolve over time, either by adding or removing nodes or links over time. Often all of these processes occur simultaneously, such as in social networks where people make and lose friends over time, thereby creating and destroying edges, and some people become part of new social networks or leave their networks, changing the nodes in the network. Evolving network concepts build on established network theory and are now being introduced into studying networks in many diverse fields.

The webgraph describes the directed links between pages of the World Wide Web. A graph, in general, consists of several vertices, some pairs connected by edges. In a directed graph, edges are directed lines or arcs. The webgraph is a directed graph, whose vertices correspond to the pages of the WWW, and a directed edge connects page X to page Y if there exists a hyperlink on page X, referring to page Y.

<span class="mw-page-title-main">Hierarchical network model</span>

Hierarchical network models are iterative algorithms for creating networks which are able to reproduce the unique properties of the scale-free topology and the high clustering of the nodes at the same time. These characteristics are widely observed in nature, from biology to language to some social networks.

Réka Albert is a Romanian-Hungarian scientist. She is a distinguished professor of physics and adjunct professor of biology at Pennsylvania State University and is noted for the Barabási–Albert model and research into scale-free networks and Boolean modeling of biological systems.

<span class="mw-page-title-main">Scientific collaboration network</span>

Scientific collaboration network is a social network where nodes are scientists and links are co-authorships as the latter is one of the most well documented forms of scientific collaboration. It is an undirected, scale-free network where the degree distribution follows a power law with an exponential cutoff – most authors are sparsely connected while a few authors are intensively connected. The network has an assortative nature – hubs tend to link to other hubs and low-degree nodes tend to link to low-degree nodes. Assortativity is not structural, meaning that it is not a consequence of the degree distribution, but it is generated by some process that governs the network’s evolution.

<span class="mw-page-title-main">Bianconi–Barabási model</span>

The Bianconi–Barabási model is a model in network science that explains the growth of complex evolving networks. This model can explain that nodes with different characteristics acquire links at different rates. It predicts that a node's growth depends on its fitness and can calculate the degree distribution. The Bianconi–Barabási model is named after its inventors Ginestra Bianconi and Albert-László Barabási. This model is a variant of the Barabási–Albert model. The model can be mapped to a Bose gas and this mapping can predict a topological phase transition between a "rich-get-richer" phase and a "winner-takes-all" phase.

In a scale-free network the degree distribution follows a power law function. In some empirical examples this power-law fits the degree distribution well only in the high degree region; in some small degree nodes the empirical degree-distribution deviates from it. See for example the network of scientific citations. This deviation of the observed degree-distribution from the theoretical prediction at the low-degree region is often referred as low-degree saturation. The empirical degree-distribution typically deviates downward from the power-law function fitted on higher order nodes, which means low-degree nodes are less frequent in real data than what is predicted by the Barabási–Albert model.

The initial attractiveness is a possible extension of the Barabási–Albert model. The Barabási–Albert model generates scale-free networks where the degree distribution can be described by a pure power law. However, the degree distribution of most real life networks cannot be described by a power law solely. The most common discrepancies regarding the degree distribution found in real networks are the high degree cut-off and the low degree saturation. The inclusion of initial attractiveness in the Barabási–Albert model addresses the low-degree saturation phenomenon.

<span class="mw-page-title-main">Mediation-driven attachment model</span> Mathematics concept

In the scale-free network theory, a mediation-driven attachment (MDA) model appears to embody a preferential attachment rule tacitly rather than explicitly. According to MDA rule, a new node first picks a node from the existing network at random and connect itself not with that but with one of the neighbors also picked at random.

References

  1. ↑ Albert, Réka; Barabási, Albert-László (2002-01-30). "Statistical mechanics of complex networks" (PDF). Reviews of Modern Physics. 74 (1): 47–97. arXiv: cond-mat/0106096 . Bibcode:2002RvMP...74...47A. doi:10.1103/revmodphys.74.47. ISSN   0034-6861. Archived from the original (PDF) on 2011-07-07.
  2. 1 2 3 Watts, Duncan J.; Strogatz, Steven H. (1998). "Collective dynamics of 'small-world' networks". Nature. 393 (6684). Springer Nature: 440–442. Bibcode:1998Natur.393..440W. doi: 10.1038/30918 . ISSN   0028-0836. PMID   9623998.
  3. 1 2 3 4 Barabási, Albert-László; Albert, Réka (1999-10-15). "Emergence of Scaling in Random Networks". Science. 286 (5439): 509–512. arXiv: cond-mat/9910332 . Bibcode:1999Sci...286..509B. doi:10.1126/science.286.5439.509. ISSN   0036-8075. PMID   10521342.
  4. 1 2 Newman, M. E. J.; Strogatz, S. H.; Watts, D. J. (2001-07-24). "Random graphs with arbitrary degree distributions and their applications". Physical Review E. 64 (2): 026118. arXiv: cond-mat/0007235 . Bibcode:2001PhRvE..64b6118N. doi: 10.1103/physreve.64.026118 . ISSN   1063-651X. PMID   11497662.
  5. ↑ Albert, Réka; Jeong, Hawoong; Barabási, Albert-László (1999). "Diameter of the World-Wide Web". Nature. 401 (6749). Springer Nature: 130–131. arXiv: cond-mat/9907038 . doi:10.1038/43601. ISSN   0028-0836.
  6. ↑ Albert, Réka; Jeong, Hawoong; Barabási, Albert-László (2000). "Error and attack tolerance of complex networks". Nature. 406 (6794): 378–382. arXiv: cond-mat/0008064 . Bibcode:2000Natur.406..378A. doi:10.1038/35019019. ISSN   0028-0836. PMID   10935628.
  7. ↑ Albert, Réka; Jeong, Hawoong; Barabasi, Albert-László (2001). "Erratum: correction: Error and attack tolerance of complex networks". Nature. 409 (6819). Springer Nature: 542. doi: 10.1038/35054111 . ISSN   0028-0836.
  8. ↑ Newman, M. E. J. (2000). "Models of the Small World". Journal of Statistical Physics. 101 (3/4). Springer Science and Business Media LLC: 819–841. doi:10.1023/a:1026485807148. ISSN   0022-4715.
  9. ↑ Albert, Réka; Barabási, Albert-László (2000-12-11). "Topology of Evolving Networks: Local Events and Universality". Physical Review Letters. 85 (24): 5234–5237. arXiv: cond-mat/0005085 . Bibcode:2000PhRvL..85.5234A. doi:10.1103/physrevlett.85.5234. ISSN   0031-9007. PMID   11102229.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.