Skip to main content
Log in

Beyond the binary case in random nets

  • Published:
Bulletin of Mathematical Biology Aims and scope Submit manuscript

Abstract

Experiments on random binary, ternary, etc. (P=2, 3,…, 10) switching nets are reported. Behavioral cycle lengths are examined as functions of output variety,P, input connectance,K, and net size,N. Overall, output variety appears an influential, well-behaved net property. Strong, but well-behaved interactions appear among net variables. In high connectance nets, median cycle length grows approx. asP N/2. Other factors constant, one-connected nets show the shortest cycles, and connectance effects appear to converge asymptotically aroundN. Data for cycle length as a function of net size suggest a concavity not compatible with the Kauffman “square root law” (Kauffman, 1969). Evidence of a positive relationship between cycle length and run-in length is found in two-input nets; weaker evidence is obtained that in higher connectance nets this relationship becomes negative in sign. The “modular complexity” ofP>2 nets is examined briefly.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature

  • Bradley, J. V. 1968.Distribution-free Statistical Tests. Englewood Cliffs, N.J.: Prentice-Hall.

    MATH  Google Scholar 

  • Fogelman-Soulie, F., E. Goles-Chac and G. Weisbuch. 1982. “Roles of the Different Boolean Mappings in Random Networks.”Bull. math. Biol. 44, 715–730.

    Article  MathSciNet  MATH  Google Scholar 

  • Gelfand, A. E. 1982. “A Behavioral Summary for Completely Random Nets.”Bull. math. Biol. 44, 309–320.

    Article  MathSciNet  MATH  Google Scholar 

  • — and C. C. Walker. 1984.Network Modeling Techniques: Inference from Small Scale Properties to Large Scale Systems. New York: Dekker.

    MATH  Google Scholar 

  • Holland, J. H. 1960. “Cycles in Logical Nets.”J. Franklin Inst. 270, 202–226.

    Article  MathSciNet  MATH  Google Scholar 

  • Kauffman, S. A. 1969. “Metabolic Stability and Epigenesis in Randomly Constructed Genetic Nets.”J. theor. Biol. 22, 437–467.

    Article  MathSciNet  Google Scholar 

  • Kauffman, S. A. 1983. Personal communication.

  • Sherlock, R. A. 1979. “Analysis of the Behaviour of Kauffman Binary Networks—II.”Bull. math. Biol. 41, 707–724.

    MathSciNet  MATH  Google Scholar 

  • Weaver, W. 1948. “Science and Complexity.”Am. Scientist 36, 536–544.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Walker, C.C. Beyond the binary case in random nets. Bltn Mathcal Biology 46, 845–857 (1984). https://doi.org/10.1007/BF02462073

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02462073

Keywords

Navigation