Supercriticality for Annealed Approximations of Boolean Networks

Details Supercriticality for Annealed Approximations of Boolean Networks Supercriticality for Annealed Approximations of Boolean Networks

2010-07-06

arxiv.org/abs/1007.0862v1

Mathematics

Probability

Scientific paper

We consider a model proposed by Derrida and Pomeau (1986) and recently studied by Chatterjee and Durrett (2009); it is defined as an approximation to S. Kauffman's boolean networks (1969). The model starts with the choice of a random directed graph on $n$ vertices; each node has $r$ input nodes pointing at it. A discrete time threshold contact process is then considered on this graph: at each instant, each site has probability $q$ of choosing to receive input; if it does, and if at least one of its inputs were occupied by a $1$ at the previous instant, then it is labeled with a $1$; in all other cases, it is labeled with a $0$. $r$ and $q$ are kept fixed and $n$ is taken to infinity. Improving a result of Chatterjee and Durrett, we show that if $qr > 1$, then the time of persistence of the dynamics is exponential in $n$.

Affiliated with

Also associated with

No associations

Rating

Supercriticality for Annealed Approximations of Boolean Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Supercriticality for Annealed Approximations of Boolean Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Supercriticality for Annealed Approximations of Boolean Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216557