Mean-Field and Non-Mean-Field Behaviors in Scale-free Networks with Random Boolean Dynamics

preprint2010arXivOpen access

Abstract

We study two types of simplified Boolean dynamics over scale-free networks, both with synchronous update. Assigning only Boolean functions AND and XOR to the nodes with probability 1−p1-p and pp, respectively, we are able to analyze the density of 1's and the Hamming distance on the network by numerical simulations and by a mean-field approximation (annealed approximation). We show that the behavior is quite different if the node always enters in the dynamic as its own input (self-regulation) or not. The same conclusion holds for the Kauffman KN model. Moreover, the simulation results and the mean-field ones (i) agree well when there is no self-regulation, and (ii) disagree for small pp when self-regulation is present in the model.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.