The origin of preferential attachment and the generalized preferential attachment for weighted networks

✍ Scribed by Chen Chen

• Publisher: Elsevier Science
• Year: 2007
• Tongue: English
• Weight: 373 KB
• Volume: 377
• Category: Article
• ISSN: 0378-4371
• DOI: 10.1016/j.physa.2006.11.082

✦ Synopsis

In this paper, we first discuss the origin of preferential attachment. Then we establish the generalized preferential attachment (GPA) which has two new properties; first, it encapsulates both the topological and weight aspects of a network, which makes it is neither entirely degree preferential nor entirely weight preferential. Second, it can tell us not only the chance that each already-existing vertex being connected but also how much weight each new edge has. The GPA can generate four power-law distributions, besides the three for vertex degrees, vertex strengths, and edge weights, it yields a new power-law distribution for the subgraph degrees.