2006/08/31 by Chen Chen
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Graph Labeling and Dimension Problems #Graph theory and applications #cond-mat.dis-nn #physics.data-an #physics.soc-ph
paper · pdf · doi:10.1016/j.physa.2006.11.082
published as Physica A, 377, 709-716, 2007 · 17 pages, 4 figures, final version, Physica A, 377, 709, 2007
openalex publication_date 2006/12/22 · arxiv created 2007/02/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we first discuss the origin of preferential attachment. Then we establish the generalized preferential attachment 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 generalized preferential attachment can generate four power-law distributions, besides the three for vertex degrees, vertex strengths, and edge weights, it yield a new power-law distribution for the subgraph degrees.