On Data-Driven Computation of Information Transfer for Causal Inference in Discrete-Time Dynamical Systems

2020 ◽  
Vol 30 (4) ◽  
pp. 1651-1676
Author(s):  
S. Sinha ◽  
U. Vaidya
2009 ◽  
Vol 19 (10) ◽  
pp. 3283-3309 ◽  
Author(s):  
ALFREDO MEDIO ◽  
MARINA PIREDDU ◽  
FABIO ZANOLIN

This article describes a method — called here "the method of Stretching Along the Paths" (SAP) — to prove the existence of chaotic sets in discrete-time dynamical systems. The method of SAP, although mathematically rigorous, is based on some elementary geometrical considerations and is relatively easy to apply to models arising in applications. The paper provides a description of the basic mathematical ideas behind the method, as well as three applications to economic models. Incidentally, the paper also discusses some questions concerning the definition of chaos and some problems arising from economic models in which the dynamics are defined only implicitly.


Author(s):  
Wassim M. Haddad ◽  
Sergey G. Nersesov

This chapter develops vector dissipativity notions for large-scale nonlinear discrete-time dynamical systems. In particular, it introduces a generalized definition of dissipativity for large-scale nonlinear discrete-time dynamical systems in terms of a vector dissipation inequality involving a vector supply rate, a vector storage function, and a nonnegative, semistable dissipation matrix. On the subsystem level, the proposed approach provides a discrete energy flow balance in terms of the stored subsystem energy, the supplied subsystem energy, the subsystem energy gained from all other subsystems independent of the subsystem coupling strengths, and the subsystem energy dissipated. The chapter also develops extended Kalman–Yakubovich–Popov conditions, in terms of the local subsystem dynamics and the interconnection constraints, for characterizing vector dissipativeness via vector storage functions for large-scale discrete-time dynamical systems.


1992 ◽  
Vol 12 (1) ◽  
pp. 153-183 ◽  
Author(s):  
Joel W. Robbin ◽  
Dietmar A. Salamon

AbstractLet be an attractor network for a dynamical system ft: M → M, indexed by the lower sets of a partially ordered set P. Our main theorem asserts the existence of a Lyapunov map ψ:M → K(P) which defines the attractor network. This result is used to prove the existence of connection matrices for discrete-time dynamical systems.


Sign in / Sign up

Export Citation Format

Share Document