Answers are grounded in this paper and cite their sources.
A class of differential equations, which captures the logical structure of discrete time logical switching networks composed of many elements, displays deterministic chaos if each element has many inputs. Statistical features of the dynamics are approximated by using a mean field Langevin-type equation with a random telegraph signal as a stochastic forcing function, and also by considering a random walk on an N-dimensional hypercube.
No takes yet. Share an insight, caveat, or question.
Mestl et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: