Nesting of dynamical systems and mode-dependent networks

  title={Nesting of dynamical systems and mode-dependent networks},
  author={David I. Spivak and Joshua Tan},
  journal={J. Complex Networks},
For many networks, the connection pattern (often called the topology) can vary in time, depending on the changing state, or mode, of the modules within the network. For example, "airplane mode" is the name for one communicative mode of a modern cellphone, in which it will not connect with any cellphone towers; thus the topology of the cellular network is dependent on the modes of its modules. This paper addresses the issue of nesting such mode-dependent networks, in which a local network can be… 
Poly: An abundant categorical setting for mode-dependent dynamics
Dynamical systems---by which we mean machines that take time-varying input, change their state, and produce output---can be wired together to form more complex systems. Previous work has shown how to
Data-driven dynamics and collective decision-making
In the original project, AFOSR grant FA9550-20-1-0348, we proposed a mathematical formalism for modeling, designing, and simulating very general sorts of interactions [Spi20]. The mathematical
Pixel matrices and other compositional analyses of interconnected systems
It is proposed to investigate compositional techniques for analyzing systems of all sorts, whether combining the constraints and requirements necessary to design a robot, or combining the equations that describe its function, so that the knowledge today is efficiently utilized in the networks of tomorrow.
Morphisms of Networks of Hybrid Open Systems
It is shown that a collection of relations holding among pairs of systems induces a relation between interconnected systems, and the procedure for building networks preserves morphisms of open systems, which both justifies the formalism and concretizes the intuition that a network is aCollection of systems pieced together in a certain way.
Rewriting with Frobenius
A DPO rewriting formalism which is able to absorb multiple Frobenius structures, thus sensibly simplifying diagrammatic reasoning in the analysis of compound systems in a compositional, resource-sensitive manner.
Yoneda Hacking: The Algebra of Attacker Actions
This work develops a categorical formalism to model attacker actions and illustrates this modeling framework using an unmanned aerial vehicle (UAV) cyber-physical system model, and demonstrates and model two types of attacks, a rewiring attack which violates data integrity and a rewriting attack, which violates availability.
Agoric computation: trust and cyber-physical systems
This thesis reviews the logical and mathematical basis of stateless abstractions and takes steps towards the software implementation of agoric modelling as a framework for simulation and verification of the reliability of increasingly complex systems, and reports on experimental results related to a few select applications.
Containerized microservices: Structures and dynamics
A framework of categories is adopted for modelling structures and dynamics of containerized microservices, and established models show that the adopted framework can be applied in modelling microservice-oriented applications, and it is able to bring functional and structural features of applications closer together.
Operadic Analysis of Distributed Systems
A higher category theory known as operad theory is described and used to evaluate the effects of disruptions and failures of NextGen communication channels on the safe separation of aircraft within the National Airspace (NAS).
Model-based analysis of nuclear arms control verification processes
A probabilistic Bayesian Network model for an arms control inspection scenario; a dynamical system that models an arms race with dynamics reflecting verification activities; and mathematical games, which are used for understanding the design space of treaties that constrain inspection schedules are covered.


Asynchronous networks and event driven dynamics
The notion of a functional asynchronous network is made rigorous, the phenomenon of dynamical locks is discussed, and a foundational result on the spatiotemporal factorization of the dynamics for a large class of functional asynchronous networks is presented.
Catastrophic cascade of failures in interdependent networks
This work develops a framework for understanding the robustness of interacting networks subject to cascading failures and presents exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks.
Multilayer networks
This chapter shows how interconnected multilayer topology describes such networks more accurately than edge coloring does and introduces the tensor formalism used to construct them.
Modular dynamical systems on networks
It is shown that a class of maps between graphs called graph fibrations give rise to maps between dynamical systems on networks, which allows us to produce conjugacy between dynamicals systems out of combinatorial data.
Algebras of Open Dynamical Systems on the Operad of Wiring Diagrams
This paper uses the language of operads to study the algebraic nature of assembling complex dynamical systems from an interconnection of simpler ones, and defines two W-algebras, G and L, which associate semantic content to the structures in W.
The steady states of coupled dynamical systems compose according to matrix arithmetic
Open dynamical systems are mathematical models of machines that take input, change their internal state, and produce output. For example, one may model anything from neurons to robots in this way.
The Structure and Function of Complex Networks
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Categories in Control
Control theory uses "signal-flow diagrams" to describe processes where real-valued functions of time are added, multiplied by scalars, differentiated and integrated, duplicated and deleted. These
The lattice of flow diagrams
  • D. Scott
  • Computer Science
    Symposium on Semantics of Algorithmic Languages
  • 1971
This paper represents a continuation of the program sketched in Outline of a Mathematical Theory of Computation (PRG 2), and though the notion of equivalence of diagrams is touched upon a full algebraic formulation remains to be done.
Quantum techniques for studying equilibrium in reaction networks
A proof of Anderson, Craciun and Kurtz's theorem is presented using tools from the theory of second quantization: Fock space, annihilation and creation operators and coherent states, and how the systems studied here can be described using either of two equivalent formalisms: reaction networks and stochastic Petri nets.