2003
DOI: 10.1016/s0167-2789(03)00174-x
|View full text |Cite
|
Sign up to set email alerts
|

Boolean dynamics of networks with scale-free topology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

8
264
2
21

Year Published

2008
2008
2019
2019

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 357 publications
(295 citation statements)
references
References 24 publications
8
264
2
21
Order By: Relevance
“…1, the damage probability after double knockout is rather high regardless of the degree distribution and is higher than the damage probability after single knockout. As one can see, the double-knockout damage probability is higher in a network with higher average degree, which is consistent with the established conclusion that the complexity of the dynamics increases with larger average node in-degree [26][27][28]. The NKK model with K=1 is an exception; here the damage probability is 1 whether one or two nodes are damaged.…”
Section: Damage Probability and Class Distribution In Simulations Of supporting
confidence: 87%
See 2 more Smart Citations
“…1, the damage probability after double knockout is rather high regardless of the degree distribution and is higher than the damage probability after single knockout. As one can see, the double-knockout damage probability is higher in a network with higher average degree, which is consistent with the established conclusion that the complexity of the dynamics increases with larger average node in-degree [26][27][28]. The NKK model with K=1 is an exception; here the damage probability is 1 whether one or two nodes are damaged.…”
Section: Damage Probability and Class Distribution In Simulations Of supporting
confidence: 87%
“…Two states that initially differ in a single node's state will diverge on average in the chaotic phase. The critical boundary is average degree <K> = 2 when considering unbiased Boolean logic (all Boolean functions) and using an annealed approximation (at every time step the input nodes and Boolean functions are randomized for each node) [25][26][27][28][29][30]. We note that our setting of a steady state damaged by a single node knockout is different from what was considered in previous work on random Boolean network ensembles.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Networks with pronounced power-law degree distributions also emerged in other model systems with comparable dynamicl and evolutionary time scales [16,17]. In real-world systems, it was noticed by Aldana [26] that a major fraction of scale-free complex networks has their decay exponent γ in the tiny range of γ ∈ [2.0, 2.5].…”
Section: Dynamics and Evolutionmentioning
confidence: 97%
“…Figure 18 shows a small graph corresponding to the regulatory network of E. coli (left) and the degree distribution for a the bigger network of S. cerevisiae (right). This new finding has stimulated research in Boolean networks which have a power-law degree distribution [Aldana, 2003, Aldana andCluzel, 2003], further extending the results on random Boolean networks.…”
Section: Gene Networkmentioning
confidence: 67%