Analysis of attractor distances in random boolean networks

We study the properties of the distance between attractors in RandomBoolean Networks, a prominent model of genetic regulatory networks. We definethree distance measures, upon which attractor distance matrices are constructed andtheir main statistic parameters are computed. The experimental analysis shows thatordered networks have a very clustered set of attractors, while chaotic networks’ attractorsare scattered; critical networks show, instead, a pattern with characteristicsof both ordered and chaotic networks.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