Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights

2004/03/31 by Naoki Masuda, Hiroyoshi Miwa, Norio Konno
Physics and Astronomy · #cond-mat.other

paper · pdf · doi:10.1103/physreve.70.036124

published as Physical Review E, 70, 036124 (2004) · 5 figures

arxiv created 2004/10/14 · arxiv updated 2009/12/01

Abstract

Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks proposed by Caldarelli et al. (2002). Power-law degree distributions, particularly with the dynamically stable scaling exponent 2, realistic clustering, and short path lengths are produced for many types of weight distributions. Thresholding mechanisms can underlie a family of real complex networks that is characterized by cooperativeness and the baseline scaling exponent 2. It contrasts with the class of growth models with preferential attachment, which is marked by competitiveness and baseline scaling exponent 3.

Related

• A Simple Model of Scale-free Networks Driven by both Randomness and Adaptability
• Preferential attachment alone is not sufficient to generate scale free random networks
• Atypical scaling behavior persists in real world interaction networks
• Realistic network growth using only local information: From random to scale-free and beyond
• Scale-free Networks without Growth or Preferential Attachment: Good get Richer