Robust analysis of preferential attachment models with fitness

Abstract

The preferential attachment network with fitness is a dynamic random graph model. New vertices are introduced consecutively and a new vertex is attached to an old vertex with probability proportional to the degree of the old one multiplied by a random fitness. We concentrate on the typical behaviour of the graph by calculating the fitness distribution of a vertex chosen proportional to its degree. For a particular variant of the model, this analysis was first carried out by Borgs, Chayes, Daskalakis and Roch. However, we present a new method, which is robust in the sense that it does not depend on the exact specification of the attachment law. In particular, we show that a peculiar phenomenon, referred to as Bose-Einstein condensation, can be observed in a wide variety of models. Finally, we also compute the joint degree and fitness distribution of a uniformly chosen vertex.

22 pages

References in corpus (1)

• A survey of random processes with reinforcement

Cited by in corpus (8)

• The dynamics of power laws: Fitness and aging in preferential attachment trees
• Asymptotic degree distribution of a duplication-deletion random graph model
• Studies on generalized Yule models
• Preferential attachment with location-based choice: Degree distribution in the noncondensation phase
• Condensation in preferential attachment models with location-based choice
• Diameter of P.A. random graphs with edge-step functions
• Distance evolutions in growing preferential attachment graphs
• Almost sure convergence of vertex degree densities in the vertex-splitting model