Network growth model with intrinsic vertex fitness

We study a class of network growth models with attachment rules governed by intrinsic node fitness. Both the individual node degree distribution and the degree correlation properties of the network are obtained as functions of the network growth rules. We also find analytical solutions to the inverse, design, problems of matching the growth rules to the required (e.g., power-law) node degree distribution and more generally to the required degree correlation function. We find that the design problems do not always have solutions. Among the specific conditions on the existence of solutions to the design problems is the requirement that the node degree distribution has to be broader than a certain threshold and the fact that factorizability of the correlation functions requires singular distributions of the node fitnesses. More generally, the restrictions on the input distributions and correlations that ensure solvability of the design problems are expressed in terms of the analytical properties of their generating functions.