Skip to main navigation Skip to search Skip to main content

A small-world model of scale-free networks: Features and verifications

Wenjun Xiao, Shizhong Jiang, Guanrong Chen

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

It is now well known that many large-sized complex networks obey a scale-free powerlaw vertex-degree distribution. Here, we show that when the vertex degrees of a large-sized network follow a scale-free power-law distribution with exponent γ ≥ 2, the number of degree-1 vertices, if nonzero, is of order N and the average degree is of order lower than log N, where N is the size of the network. Furthermore, we show that the number of degree-1 vertices is divisible by the least common multiple of k 1 γ , k 2 γ, . . ., k l γ, and l is less than log N, where l = k 1 <k 2 <⋯ <k l is the vertex-degree sequence of the network. The method we developed here relies only on a static condition, which can be easily verified, and we have verified it by a large number of real complex networks. © (2011) Trans Tech Publications.
Original languageEnglish
Title of host publicationIntelligent Structure and Vibration Control
Pages166-170
Volume50-51
DOIs
Publication statusPublished - 2011
EventInternational Conference on Intelligent Structure and Vibration Control, ISVC 2011 - Chongqing, China
Duration: 14 Jan 201116 Jan 2011

Publication series

NameApplied Mechanics and Materials
Volume50-51
ISSN (Print)1660-9336
ISSN (Electronic)1662-7482

Conference

ConferenceInternational Conference on Intelligent Structure and Vibration Control, ISVC 2011
PlaceChina
CityChongqing
Period14/01/1116/01/11

Research Keywords

  • Complex network
  • Computer network
  • Scale-free network
  • Small-world network
  • Software network

Fingerprint

Dive into the research topics of 'A small-world model of scale-free networks: Features and verifications'. Together they form a unique fingerprint.

Cite this