Kauffman networks with threshold functions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We investigate Threshold Random Boolean Networks with $K = 2$ inputs per node, which are equivalent to Kauffman networks, with only part of the canalyzing functions as update functions. According to the simplest consideration these networks should be critical but it turns out that they show a rich variety of behaviors, including periodic and chaotic oscillations. The results are supported by analytical calculations and computer simulations.
4 pages, submitted to PhysRev; http://www.edpsciences.org/10.1140/epjb/e2007-00161-0

Keywords

Disordered Systems and Neural Networks, Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134171

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0701176
 http://arxiv.org/abs/cond-mat/0701176
 Eur. Phys. J. B 57, 109-113 (2007)
 doi:10.1140/epjb/e2007-00161-0

Collections

arXiv