ISSN:
1522-9602
Source:
Springer Online Journal Archives 1860-2000
Topics:
Biology
,
Mathematics
Notes:
Abstract The basis of an analytical description of the behaviour of large random nets of binary elements of the type first investigated in detail by S. A. Kauffman is presented. It is shown that information about the network dynamics can be deduced from quite general considerations of the properties of the state transition graph and matrix. An expression for the matrix elements of the state transition matrix in terms of the Boolean function specification of the net is derived. Using these ideas the distribution of limit cycle lengthsl for a completely random net is calculated and shown to bex 1/l, a result which agrees well with experimental data.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02462422
Permalink