Gaining scale-free and high clustering complex networks

Shouliang Bu, Bing-Hong Wang and Tao Zhou

Physica A: Statistical Mechanics and its Applications, 2007, vol. 374, issue 2, 864-868

Abstract: By making use of two observing facts for many natural and social networks, i.e., the nodes’ diversity, and the disassortative (or assortative) properties for biological and technological (or social) networks, a simple and elegant model with three kinds of nodes and deterministic selective linking rule is proposed in this paper. We show that the given model can successfully capture two generic topological properties of many real networks: they are scale-free and they display a high degree of clustering. In practice, most models proposed to describe the topology of complex networks have difficulty to capture simultaneously these two features.

Keywords: Complex networks; Scale-free (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437106008673
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:374:y:2007:i:2:p:864-868

DOI: 10.1016/j.physa.2006.08.048

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().