Common Chaos in Arbitrarily Complex Feedback Networks

Abstract
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.