Attractor Stability of Boolean networks under noise
We study the impact of noise on attractor dynamics in Boolean networks, focusing on their stability and transition behaviors. By constructing attractor matrices based on single-node perturbations, we propose a framework to quantify attractor stability and identify dominant attractors. We find that attractors are more stable than predicted by basin sizes, showing the importance of dynamical structure in noisy environments. In addition, under global perturbations, basin sizes dictate long-term behavior; under local noise, however, attractor dominance is determined by noise-induced transition patterns rather than basin sizes. Our results show that transition dynamics induced by stochastic perturbations provide an efficient and quantitative description for the attractor stability and dynamics in Boolean networks under noise.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Upper bound for the stability of Boolean networks
Boolean networks, inspired by gene regulatory networks, were developed to understand the complex behaviors observed in biological systems, with network attractors corresponding to biological phenotypes or cell types. In …
An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks
Boolean networks are conventionally used to represent and simulate gene regulatory networks. In the analysis of the dynamic of a Boolean network, the attractors are the objects of a special attention. In this work, we pr…
Therapeutic target discovery using Boolean network attractors: avoiding pathological phenotypes
Target identification, one of the steps of drug discovery, aims at identifying biomolecules whose function should be therapeutically altered in order to cure the considered pathology. This work proposes an algorithm for …
Drug DiscoveryDifficult control is related to instability in biologically inspired Boolean networks
Previous work in Boolean dynamical networks has suggested that the number of components that must be controlled to select an existing attractor is typically set by the number of attractors admitted by the dynamics, with …
An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?
Asynchronous Boolean networks are a type of discrete dynamical system in which each variable can take one of two states, and a single variable state is updated in each time step according to pre-selected rules. Boolean n…