Evolution of overlaps between configurations in random Boolean networks
Year: 1986
Type: article
Abstract: Random Boolean nets are systems of randomly connected binary units (or spins). Each spin σi can take two possible values (σ i = 0 or 1). It receives, at time t, K binary input signals coming from K connected spins and updates its state according to a deterministic Boolean function of the K inputs. We compare the time evolution of the overlaps between different configurations for the two following models : Kauffman's model, for which the connections and Boolean function of each spin are randomly chosen at time t = 0 and remain unchanged at later times; the annealed model, for which these parameters are randomly reset at each time step. The numerical simulations for both models agree remarkably well with the theoretical predictions available for the second model.
Source: Journal de physique
Authors: B. Derrida, G. Weisbuch
Institution: École Normale Supérieure - PSL
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2154749468