کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
978302 | 933270 | 2007 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Gaining scale-free and high clustering complex networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 374, Issue 2, 1 February 2007, Pages 864–868
Journal: Physica A: Statistical Mechanics and its Applications - Volume 374, Issue 2, 1 February 2007, Pages 864–868
نویسندگان
Shouliang Bu, Bing-Hong Wang, Tao Zhou,