Location of Repository


By Joseph Lizier


� from the perspective of distributed computation. 2. Random Boolean Networks Discrete dynamical models of nodes [1]: • In a directed network structure, • which is determined at random from an average in-degree /K; • With Boolean states, • Updated synchronously in discrete time, • using heterogeneous random update functions. RBNs exhibit a well known phase transition from ordered-chaotic behaviour as a function of the connectivity /K: (quantified with respect to δ- the Hamming distance between the final attractors of two initial networks states differentiated by only a single node’s state

Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.usyd.edu.au/%7Ej... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.