کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1897113 | 1044492 | 2008 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Dominant vertices in regulatory networks dynamics
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Discrete-time regulatory networks are dynamical systems on directed graphs with a structure that is inspired on natural systems of interacting units. Using a notion of determination between vertices, we define sets of dominant vertices, and we prove that in the asymptotic regime, the projection of the dynamics on a dominant set allows us to determine the state of the whole system at all times. We provide an algorithm to find sets of dominant vertices, and we test its accuracy on several examples. We also explore the possibility of using the dominant set characteristics as a measure of the structural complexity of networks.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica D: Nonlinear Phenomena - Volume 237, Issue 21, 1 November 2008, Pages 2685–2695
Journal: Physica D: Nonlinear Phenomena - Volume 237, Issue 21, 1 November 2008, Pages 2685–2695
نویسندگان
Beatriz Luna, Edgardo Ugalde,