Title of article :
Gaining scale-free and high clustering complex networks
Author/Authors :
Shouliang Bu، نويسنده , , Bing-Hong Wang، نويسنده , , Tao Zhou، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Pages :
5
From page :
864
To page :
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.
Journal title :
Physica A Statistical Mechanics and its Applications
Serial Year :
2007
Journal title :
Physica A Statistical Mechanics and its Applications
Record number :
871321
Link To Document :
بازگشت