Modeling scale-free networks with heterogeneous nodes

Min Song, Sachin Shetty

Research output: Contribution to journalConference articlepeer-review

Abstract

The study of scale-free networks typically assumes that either nodes are homogenously distributed or one strong node monopolizes the entire network. While this makes the analysis trackable, it is not appropriate for scenarios, such as terrorist networks, in which nodes play significant different roles in the network. In this paper, we classify nodes into four types by the roles they play. Nodes from different types are assigned various fitness values. The presence of varied fitness values influences the probability of a node to receive preferentially links from other nodes. Thus our model involves simultaneous interaction between nodes of varied strengths. Although the model allocates the same fitness strength to all nodes of the same type, analytical results suggest that it is sufficient to demonstrate the two key features of scale-free networks: power-law distribution of degree and preferential attachment of new nodes. Simulations are performed to verify the proposed model.

Original languageEnglish
Pages (from-to)667-672
Number of pages6
JournalProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
StatePublished - 2006
Event18th IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2006 - Dallas, TX, United States
Duration: 13 Nov 200615 Nov 2006

Keywords

  • Evolutionary
  • Modeling
  • Power-law distribution
  • Scale-free networks

Fingerprint

Dive into the research topics of 'Modeling scale-free networks with heterogeneous nodes'. Together they form a unique fingerprint.

Cite this