2000 character limit reached
Asynchronous Networks: Modularization of Dynamics Theorem
Published 3 Feb 2017 in math.DS and nlin.AO | (1702.01174v1)
Abstract: Building on the first part of this paper, we develop the theory of functional asynchronous networks. We show that a large class of functional asynchronous networks can be (uniquely) represented as feedforward networks connecting events or dynamical modules. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network: the Modularization of Dynamics Theorem. We give examples to illustrate the main results.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.