Analysis of attractor distances in Random Boolean Networks

2010/11/21 by Roli, Andrea, Benedettini, Stefano, Serra, Roberto +1
#Biological Physics (physics.bio-ph) #Chaotic Dynamics (nlin.CD) #FOS: Biological sciences #FOS: Computer and information sciences #FOS: Physical sciences #Neural and Evolutionary Computing (cs.NE) #Quantitative Methods (q-bio.QM)

paper · doi:10.48550/arxiv.1011.4682

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.

Related

• Dynamical regimes in non-ergodic random Boolean networks
• The Dynamics of Canalizing Boolean Networks
• Counting attractors in synchronously updated random Boolean networks
• The Number of Attractors in Kauffman Networks
• On the length of attractors in boolean networks with an interaction graph by layers