Analysis of attractor distances in Random Boolean Networks
Neural and Evolutionary Computing
2010-11-23 v1 Chaotic Dynamics
Biological Physics
Quantitative Methods
Abstract
We study the properties of the distance between attractors in Random Boolean Networks, a prominent model of genetic regulatory networks. We define three distance measures, upon which attractor distance matrices are constructed and their main statistic parameters are computed. The experimental analysis shows that ordered networks have a very clustered set of attractors, while chaotic networks' attractors are scattered; critical networks show, instead, a pattern with characteristics of both ordered and chaotic networks.
Keywords
Cite
@article{arxiv.1011.4682,
title = {Analysis of attractor distances in Random Boolean Networks},
author = {Andrea Roli and Stefano Benedettini and Roberto Serra and Marco Villani},
journal= {arXiv preprint arXiv:1011.4682},
year = {2010}
}
Comments
9 pages, 6 figures. Presented at WIRN 2010 - Italian workshop on neural networks, May 2010. To appear in a volume published by IOS Press