Supercriticality of an annealed approximation of Boolean networks

From MaRDI portal
Publication:742995

DOI10.1214/ECP.V18-2479zbMATH Open1302.82076arXiv1007.0862MaRDI QIDQ742995FDOQ742995


Authors: Thomas Mountford, Daniel Valesin Edit this on Wikidata


Publication date: 22 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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 n vertices; each vertex has r 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 q 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. r and q are kept fixed and n is taken to infinity. Improving a result of [CD2011], we show that if qr>1, then the time of persistence of activity of the dynamics is exponential in n.


Full work available at URL: https://arxiv.org/abs/1007.0862




Recommendations





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)