frozen — Frozen character interactions (2013)
- Description
Weighted network of the dialogue between the characters of the Disney animated film "Frozen" (2013), compiled by P. Holme for an article with M. A. Porter and H. Sayama on network centrality for young readers. Nodes are characters (including groups such as "Crowd" or "Trolls"), and an undirected edge connects two characters if one speaks to the other, weighted by the number of lines they say to each other. The network was built from a transcript of the film listing who speaks each line, by watching the film and noting to whom each line is said (and correcting the transcript where necessary). The figure in the article shows a subnetwork without the edges of weight one.
The edges have the property
weight, the number of lines said between the two characters.1
- Tags
- Social Fictional Weighted
- Citation
-
- P. Holme, M. A. Porter, H. Sayama, "Who is the most important character in Frozen? What networks can tell us about the world." Frontiers for Young Minds 7, 99 (2019) 10.3389/frym.2019.00099 Sci-Hub
- Upstream URL OK
- https://petterhol.me/2019/07/19/frozen-weighted-network/
- Networks
-
Tip: hover over a column header for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties