کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
975159 | 933018 | 2008 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Network growth with preferential attachment for high indegree and low outdegree
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We study the growth of a directed transportation network, such as a food web, in which links carry resources. We propose a growth process in which new nodes (or species) preferentially attach to existing nodes with high indegree (in food-web language, number of prey) and low outdegree (or number of predators). This scheme, which we call inverse preferential attachment, is intended to maximize the amount of resources available to each new node. We show that the outdegree (predator) distribution decays at least exponentially fast for large outdegree and is continuously tunable between an exponential distribution and a delta function. The indegree (prey) distribution is poissonian in the large-network limit.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 387, Issue 11, 15 April 2008, Pages 2631–2636
Journal: Physica A: Statistical Mechanics and its Applications - Volume 387, Issue 11, 15 April 2008, Pages 2631–2636
نویسندگان
Volkan Sevim, Per Arne Rikvold,