arXiv Analytics

Sign in

arXiv:1302.3385 [math.PR]AbstractReferencesReviewsResources

Robust analysis of preferential attachment models with fitness

Steffen Dereich, Marcel Ortgiese

Published 2013-02-14Version 1

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.

Related articles: Most relevant | Search more
arXiv:2312.14085 [math.PR] (Published 2023-12-21)
Percolation on preferential attachment models
arXiv:1806.10959 [math.PR] (Published 2018-06-28)
Condensation in preferential attachment models with location-based choice
arXiv:0705.4153 [math.PR] (Published 2007-05-29, updated 2010-04-13)
Diameters in preferential attachment models