کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10481255 | 933081 | 2005 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scaling of distances in correlated complex networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The influence of node-node degree correlations on distances in complex networks has been studied. We have found that even the presence of strong correlations in complex networks does not break a universal scaling of distances between vertices of such networks as science collaboration networks, biological networks, Internet Autonomous Systems and public transport systems. A mean distance between two nodes of degrees ki and kj in such networks equals to ãlijã=A-Blog(kikj) for a fixed value of the product kikj. The scaling is valid over several decades. Parameters A and B depend on the mean value of a node degree ãkãnn calculated for the nearest neighbors. We have found that extending our simple theory basing on a random branching tree by the first-order node degree correlations improves theoretical predictions for parameters A and B in assortative networks, while it fails in disassortative ones.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 351, Issue 1, 1 June 2005, Pages 167-174
Journal: Physica A: Statistical Mechanics and its Applications - Volume 351, Issue 1, 1 June 2005, Pages 167-174
نویسندگان
Janusz A. HoÅyst, Julian Sienkiewicz, Agata Fronczak, Piotr Fronczak, Krzysztof Suchecki,