pith. machine review for the scientific record. sign in

arxiv: cond-mat/0202174 · v1 · submitted 2002-02-11 · ❄️ cond-mat.dis-nn · cond-mat.stat-mech

Recognition: unknown

Marvel Universe looks almost like a real social network

R. Alberich , J. Miro-Julia , F. Rossello
Authors on Pith no claims yet
classification ❄️ cond-mat.dis-nn cond-mat.stat-mech
keywords marvelnetworkcollaborationnetworksuniversecharacteristicslikereal
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Message passing and cyclicity transition

    physics.soc-ph 2026-04 unverdicted novelty 7.0

    Message passing solutions in percolation identify reachability from cycles, not giant component membership, on any directed or undirected networks.

  2. Capability centrality: the next step from scale-free property

    cs.SI 2026-05 unverdicted novelty 6.0

    KSI-centrality is a new measure whose distribution independently distinguishes real networks from random and model networks beyond scale-freeness, with its normalized average bijectively setting the m parameter in Bar...

  3. Capability centrality: the next step from scale-free property

    cs.SI 2026-05 unverdicted novelty 5.0

    KSI-centrality distinguishes real networks from random ones via skewed distributions and its normalized form relates to algebraic connectivity while bijectively corresponding to the attachment parameter m in Barabasi-...