Advanced

Superpolynomial growth in the number of attractors in Kauffman networks (conference report)

Samuelsson, Björn LU and Troein, Carl LU (2003) In Acta Physica Polonica B 34(10). p.5051-5061
Abstract
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 model for real world network problems. This work is based on an earlier paper where we introduced a novel approach to analyzing attractors in random Boolean networks. Applying this approach to Kauffman networks, we prove that the average number of attractors grows faster than any power law with system size.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Acta Physica Polonica B
volume
34
issue
10
pages
5051 - 5061
publisher
Jagellonian University, Cracow, Poland
external identifiers
  • wos:000186418300030
ISSN
1509-5770
language
English
LU publication?
yes
id
6d5d7f9d-a547-4384-a155-d8b9baa6df90 (old id 296366)
date added to LUP
2007-09-21 10:22:01
date last changed
2016-10-05 14:12:08
@article{6d5d7f9d-a547-4384-a155-d8b9baa6df90,
  abstract     = {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 model for real world network problems. This work is based on an earlier paper where we introduced a novel approach to analyzing attractors in random Boolean networks. Applying this approach to Kauffman networks, we prove that the average number of attractors grows faster than any power law with system size.},
  author       = {Samuelsson, Björn and Troein, Carl},
  issn         = {1509-5770},
  language     = {eng},
  number       = {10},
  pages        = {5051--5061},
  publisher    = {Jagellonian University, Cracow, Poland},
  series       = {Acta Physica Polonica B},
  title        = {Superpolynomial growth in the number of attractors in Kauffman networks (conference report)},
  volume       = {34},
  year         = {2003},
}