Supercriticality of an annealed approximation of Boolean networks
From MaRDI portal
(Redirected from Publication:742995)
Abstract: We consider a model recently proposed by Chatterjee and Durrett [CD2011] as an "annealed approximation" of boolean networks, which are a class of cellular automata on a random graph, as defined by S. Kauffman [K69]. The starting point is a random directed graph on vertices; each vertex has input vertices pointing to it. For the model of [CD2011], a discrete time threshold contact process is then considered on this graph: at each instant, each vertex has probability of choosing to receive input; if it does, and if at least one of its input vertices were in state 1 at the previous instant, then it is labelled with a 1; in all other cases, it is labelled with a 0. and are kept fixed and is taken to infinity. Improving a result of [CD2011], we show that if , then the time of persistence of activity of the dynamics is exponential in .
Recommendations
- Criticality in random threshold networks: annealed approximation and beyond
- A NUMERICAL INVESTIGATION OF THE CRITICAL PHASE OF RANDOM BOOLEAN NETWORKS
- Energy and criticality in random Boolean networks
- Critical points for random Boolean networks
- Persistence of activity in threshold contact processes, an annealed approximation of random Boolean networks
- Phase transition for the threshold contact process, an approximation of heterogeneous random Boolean networks
Cited in
(3)
This page was built for publication: Supercriticality of an annealed approximation of Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742995)