Source-linked AI summary

Marvel Universe looks almost like a real social network

R. Alberich, J. Miro-Julia, F. Rossello

arXiv:cond-mat/0202174v1cond-mat.dis-nncond-mat.stat-mech

TL;DR

The paper asks whether characteristic collaboration-network structure reflects social principles or can arise in an artificial network. It models the Marvel Universe from character co-appearances and finds a network unlike its random counterpart that shares most real-network characteristics but has substantially lower clustering. The study therefore separates common structural effects from the artificial way characters are distributed among books.

  • Problem

    The paper examines whether the common small-world and scale-free features of collaboration networks reflect profound social relationships or can occur in artificial networks.

    Source: §1 · p. 2, §4 · p. 12
  • Method

    The authors analyze a Marvel collaboration network whose nodes are characters and whose links represent joint appearances in comic books, using MCP data and a null model preserving bipartite degree distributions.

    Source: §1 · p. 2, §2 · p. 4, §3.2 · p. 7
  • Results

    The Marvel network is unlike a random network and resembles real collaboration networks in short node distances and a power-law-tailed collaborator distribution, but its clustering coefficient is much smaller.

    Source: §4 · pp. 12–13
  • Takeaways & Limitations

    The findings suggest that real collaboration networks may reflect both constrained bipartite degree distributions and a common mechanism separating actual networks from their null models.

    Source: §4 · p. 13

    The analysis depends on the incomplete MCP database, including a gap for comics published between early 1993 and mid-1994.

    Source: §2 · p. 4, §4 · p. 13

Abstract

from arXiv · show

We investigate the structure of the Marvel Universe collaboration network, where two Marvel characters are considered linked if they jointly appear in the same Marvel comic book. We show that this network is clearly not a random network, and that it has most, but not all, characteristics of "real-life" collaboration networks, such as movie actors or scientific collaboration networks. The study of this artificial universe that tries to look like a real one, helps to understand that there are underlying principles that make real-life networks have definite characteristics.

1 Introduction

The paper asks whether collaboration-network properties reflect social principles or can arise in artificial networks. It analyzes the Marvel Universe as an artificial collaboration network and finds mostly real-network-like structure, with an important clustering exception.

1 Introduction

  • Collaboration networks are attractive because their links have objective meanings, large databases support analysis, and dated records permit studies of network growth.Examples include movie, baseball, and scientific collaboration databases.Source: §1 · p. 1
  • Real collaboration networks commonly exhibit short paths, neighbor clustering, and approximately power-law degree distributions, corresponding to small-world and scale-free structure.Scientific collaboration networks are described as more genuinely social than Hollywood networks because coauthorship usually reflects acquaintance.Source: §1 · p. 2
  • The study tests whether common collaboration-network features reflect profound social principles or also appear in artificial networks, using Marvel as the case study.Prior work found that real collaboration networks differ substantially from random models.Source: §1 · p. 2
  • The Marvel Universe network links characters who jointly appear in comic books, capturing relationships created through shared appearances, conflicts, family ties, and other interactions.Its construction resembles collaboration networks while its growth echoes Hollywood casting processes.Source: §1 · pp. 2–3
  • The Marvel network differs from a random model in most statistical properties, resembling real collaboration networks, but its clustering coefficient is much lower than expected for real-life collaboration networks.The paper attributes this discrepancy to how writers distribute characters among books rather than how scientists collaborate on papers.Source: §1 · p. 3

2 The Marvel Universe network

The Marvel Universe network is built from significant characters and their significant co-appearances in comics published from the Marvel Age onward. Its scope is determined by the MCP database and its treatment of identities.

2 The Marvel Universe network

  • The MU network represents significant Marvel characters as nodes and links two characters when they jointly appear significantly in the same comic book.The analysis includes comics published after Fantastic Four Issue 1 in November 1961.Source: §2 · p. 4
  • The MCP database defines the study’s effective scope, covering over 96,000 appearances by more than 6,500 characters in about 13,000 comic books.The database has a gap covering early 1993 through mid-1994, which the authors believe does not significantly affect results.Source: §2 · p. 4
  • Nodes represent underlying persons or entities independently of aliases and personalities, producing 6,486 nodes appearing in 12,942 comic books.This resolves cases where one person uses multiple identities or different characters share a personality.Source: §2 · p. 4

3 Analysis of the network

The Marvel Universe network is built by projecting a character–comic bipartite graph and is compared with a null model preserving its appearance distributions. It forms a highly connected, short-path network, but its degree and clustering patterns reveal both realistic collaboration features and artificial structure.

3.1 The bipartite graph

  • The bipartite graph contains 6 486 characters, 12 942 comic books, and 96 662 character–book edges.Characters appear in an average of 14.9 books, while books contain an average of 7.47 characters.Source: §3.1 · p. 5
  • Character appearances per book follow a distribution resembling real-life networks, whereas books per character fit an unusual power law with exponent 0.66 and an exponential cutoff.The books-per-character fit covers the full histogram with correlation 0.992, unlike the distributions usually reported for comparable collaboration bipartite graphs.Source: §3.1 · pp. 5–6, Figure 1 · p. 6, Figure 2 · p. 6

3.2 The null random model

  • The null model preserves the empirical distributions of character appearances per book and books per character before projecting onto characters.MU-R is generated from a random bipartite graph with 6 486 character nodes and 12 942 book nodes, using the same Pc(k) and Pb(k) distributions as the data.Source: §3.2 · p. 7

3.3 Basic data

  • MU has 168 267 links among 6 486 characters, but its null model would produce 569 770 distinct links and an average degree of 175.69 instead of MU’s average of 52.The much smaller observed link count indicates repeated collaboration among the same characters, more strongly than in Hollywood or scientific collaboration networks.Source: §3.3 · pp. 7–8, Table 2 · p. 8

3.4 The giant component

  • A giant component contains 6 449 characters, or 99.42% of MU, and the largest external component has only 9 members.Thus nearly all characters belong to one connected structure.Source: §3.4 · pp. 8–9

3.5 Separation

  • MU has diameter 5 and mean separation 2.63, while MU-R has mean separation 1.45; both MU distances are smaller than those reported for real-life networks.Captain America is the center of the giant component, with average distance 1.70 to other characters.Source: §3.5 · p. 9

3.6 Clustering

  • MU’s clustering coefficient is 0.012 versus 0.008 for an ordinary random network, but about twice the MU-R value of 0.0066.Relative to MU-R, MU displays the clustering enhancement typical of collaboration networks; relative to an ordinary random graph, its clustering is much smaller than in real-life collaboration networks.Source: §3.6 · pp. 10–11

3.7 Distribution of the number of partners

  • The MU degree distribution has a power-law tail with exponential cutoff, with exponent 0.7158 and cutoff scale 2167.Because the exponent is below 2, a few major characters dominate average network properties more strongly than in scientific or movie-actor collaboration networks.Source: §3.7 · p. 12, Figure 3 · p. 12

4 Conclusions

The artificial Marvel Universe network shares important structural features with real-life collaboration networks but also reveals its artificial origins. Comparison with a matched null model suggests that both bipartite degree distributions and a broader common mechanism shape collaboration-network structure.

4 Conclusions

  • The Marvel Universe is scale-free and small-world, yet its clustering coefficient is substantially smaller than in real-life collaboration networks.Its collaborator distribution has a power-law tail with cutoff, and nodes are on average at short distance from one another.Source: §4 · p. 12
  • The network was compared with a null model preserving the numbers of characters and comic books and their edge-degree distributions.The null model was generated by projecting a bipartite random graph matched to the actual graph’s incoming and outgoing edge distributions.Source: §4 · pp. 12–13
  • The comparison indicates that Marvel’s artificiality lies mainly in the bipartite graph’s edge distributions, while its final network structure differs from the null model similarly to real-life collaboration networks.Once those distributions are fixed, the Marvel Universe behaves realistically relative to its null model and remains significantly different from a random network.Source: §4 · pp. 12–13
  • The authors propose two underlying principles: non-arbitrary bipartite degree distributions and a common mechanism separating actual collaboration networks from their null models.They state that further study is needed to identify these principles more precisely.Source: §4 · p. 13
  • Future analysis of the Marvel Universe’s evolution and comparison with real-life collaboration networks may help locate this common mechanism and the network’s artificiality.The MCP database contains chronological appearance information intended to support such study.Source: §4 · p. 13
Loading cond-mat/0202174v1…