Analysis of attractor distances in Random Boolean Networks

Authors:
Andrea Roli;Stefano Benedettini;Roberto Serra;Marco Villani
Affiliations:
DEIS--Cesena, Alma Mater Studiorum Università di Bologna, Italy;DEIS--Cesena, Alma Mater Studiorum Università di Bologna, Italy;Dipartimento di scienze sociali, cognitive e quantitative, Università di Modena e Reggio Emilia, Italy and European Centre for Living Technology, Venice, Italy;Dipartimento di scienze sociali, cognitive e quantitative, Università di Modena e Reggio Emilia, Italy and European Centre for Living Technology, Venice, Italy
Venue:
Proceedings of the 2011 conference on Neural Nets WIRN10: Proceedings of the 20th Italian Workshop on Neural Nets
Year:
2011

Citing 1
Cited 2

Data clustering: a review

ACM Computing Surveys (CSUR)

Stochastic local search to automatically design Boolean networks with maximally distant attractors

EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Dynamical regimes and learning properties of evolved Boolean networks

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

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.