Abstract
We consider a fitness model assumed to generate simple graphs with a power-law heavy-tailed degree sequence, with , in which the corresponding distributions do not possess a mean. We discuss the situations in which the model is used to produce a multigraph and examine what happens if the multiple edges are merged to a single one and thus a simple graph is built. We give the relation between the (normalized) fitness parameter and the expected degree of a node and show analytically that it possesses nontrivial intermediate and final asymptotic behaviors. We show that the model produces for large values of independent of . Our analytical findings are confirmed by numerical simulations.
- Received 19 November 2012
DOI:https://doi.org/10.1103/PhysRevE.87.022806
©2013 American Physical Society