356 citations · 358 across the 3 of their papers we have counts for
3 papers
q-bio.MN2004★ 1 cited
Counting attractors in synchronously updated random Boolean networks
Björn Samuelsson, Carl Troein
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors.…
q-bio.MN2004★ 356 cited
Genetic networks with canalyzing Boolean rules are always stable
Stuart Kauffman, Carsten Peterson, Björn Samuelsson +1
We determine stability and attractor properties of random Boolean genetic network models with canalyzing rules for a variety of architectures. For all power law, exponential, and f…
cond-mat.dis-nn2002★ 1 cited
The Number of Attractors in Kauffman Networks
B. Samuelsson, C. Troein
The Kauffman model describes a particularly simple class of random Boolean networks. Despite the simplicity of the model, it exhibits complex behavior and has been suggested as a m…