activity
20132025
most citedCooperative Boolean systems with generically long attractors I

4 citations · 4 across the 7 of their papers we have counts for

collaborators
Showing math.DSShow all

2 papers · 1 filter

math.DS2013

Cooperative Boolean systems with generically long attractors II

Winfried Just, Maciej Malicki

We prove that cooperativity in Boolean networks precludes a strong notion of sensitive dependence on initial conditions. Weaker notions of sensitive dependence are shown to be cons…

math.DS2013★ 4 cited

Cooperative Boolean systems with generically long attractors I

Winfried Just, Maciej Malicki

We study the class of cooperative Boolean networks whose only regulatory functions are COPY, binary AND, and binary OR. We prove that for all sufficiently large N and c < 2 there e…