Characterization of weighted complex networks

Kwangho Park, Ying-Cheng Lai, Nong Ye

Research output: Contribution to journalArticlepeer-review

65 Citations (Scopus)


To account for possible distinct functional roles played by different nodes and links in complex networks, we introduce and analyze a class of weighted scale-free networks. The weight of a node is assigned as a random number, based on which the weights of links are defined. We utilize the concept of betweenness to characterize the weighted networks and obtain the scaling laws governing the betweenness as functions both of the weight and of the degree. The scaling results may be useful for identifying influential nodes in terms of physical functions in complex networks.

Original languageEnglish
Article number026109
Number of pages4
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Issue number2 Part 2
Publication statusPublished - 23 Aug 2004


Dive into the research topics of 'Characterization of weighted complex networks'. Together they form a unique fingerprint.

Cite this