First to market is not everything: an analysis of preferential attachment with fitness

The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the networks of interest, such as the Internet, the web graph, social networks or online communities. To this end, preferential attachment, in which the popularity (or relevance) of a node is determined by its degree, is a wellknown and appealing random graph model, whose predictions are in accordance with experiments on the web graph and several social networks. However, its central assumption, that the popularity of the nodes depends only on their degree, is not a realistic one, since every node has potentially some intrinsic quality which can differentiate its attractiveness from other nodes with similar degrees. In this paper, we provide a rigorous analysis of preferential attachment with fitness, suggested by Bianconi and Barab?asi and studied by Motwani and Xu, in which the degree of a vertex is scaled by its qual...

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sébastien Roch
• Keywords: Algorithms, Preferential Attachment, Preferential Attachment Model, STOC 2007, Web Graph