کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871171 | 1440180 | 2018 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Fixed points and connections between positive and negative cycles in Boolean networks
ترجمه فارسی عنوان
نقاط ثابت و ارتباط بین چرخه مثبت و منفی در شبکه های بولی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
شبکه بولی، نقطه ثابت، نمودار تعامل، چرخه مثبت، چرخه منفی،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
We are interested in the relationships between the number of fixed points in a Boolean network f:{0,1}nâ{0,1}n and its interaction graph, which is the arc-signed digraph G on {1,â¦,n} that describes the positive and negative influences between the components of the network. A fundamental theorem of Aracena says that if G has no positive (resp. negative) cycle, then f has at most (resp. at least) one fixed point; the sign of a cycle being the product of the signs of its arcs. In this note, we generalize this result by taking into account the influence of connections between positive and negative cycles. In particular, we prove that if every positive (resp. negative) cycle of G has an arc a such that Gâa has a non-trivial initial strongly connected component containing the terminal vertex of a and only negative (resp. positive) cycles, then f has at most (resp. at least) one fixed point. This is, up to our knowledge, the first generalization of Aracena's theorem where the conditions are expressed with G only.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 243, 10 July 2018, Pages 1-10
Journal: Discrete Applied Mathematics - Volume 243, 10 July 2018, Pages 1-10
نویسندگان
Adrien Richard,