کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10729271 | 1038489 | 2005 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
فیزیک و نجوم
فیزیک و نجوم (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Generally, synchronization in a network of chaotic systems depends on the underlying coupling topology. Recently, there have been several studies conducted to determine what features of this topology contribute to the ability to synchronize. A short diameter has been proposed by several authors as a means to facilitate synchronization whereas others point to features such as the homogeneity of the degree sequence. Recently, it has been shown that the degree sequence by itself is not sufficient to determine synchronizability. The purpose of this Letter is to continue this study. For a given degree sequence, we construct two connected graphs with this degree sequence whose synchronizability can be quite different. In particular, we construct a graph with low synchronizability which improves upon previous bounds under certain conditions and we construct a graph which has synchronizability that is asymptotically maximal. On the other hand, we show analytically that for a random network model, homogeneity of the degree sequence is beneficial to synchronization.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physics Letters A - Volume 346, Issue 4, 17 October 2005, Pages 281-287
Journal: Physics Letters A - Volume 346, Issue 4, 17 October 2005, Pages 281-287
نویسندگان
Chai Wah Wu,