Related papers: Lyapunov Exponents in Random Boolean Networks
We derive asymptotic formulas for the Lyapunov exponent of almost all monotone Boolean networks. The formulas are different depending on whether the number of variables of the constituent Boolean functions, or equivalently, the connectivity…
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…
Anomalies are known to appear in the perturbation theory for the one-dimensional Anderson model. A systematic approach to anomalies at critical points of products of random matrices is developed, classifying and analysing their possible…
By interpreting a temporal network as a trajectory of a latent graph dynamical system, we introduce the concept of dynamical instability of a temporal network, and construct a measure to estimate the network Maximum Lyapunov Exponent (nMLE)…
Lyapunov exponents are well-known characteristic numbers that describe growth rates of perturbations applied to a trajectory of a dynamical system in different state space directions. Covariant (or characteristic) Lyapunov vectors indicate…
We discuss several numerical methods for calculating Lyapunov exponents (a quantitative measure of chaos) in systems of ordinary differential equations. We pay particular attention to constrained systems, and we introduce a variety of…
Deep neural networks (DNNs) have emerged as a powerful tool with a growing body of literature exploring Lyapunov-based approaches for real-time system identification and control. These methods depend on establishing bounds for the second…
We introduce the notion of Lyapunov exponents for random dynamical systems, conditioned to trajectories that stay within a bounded domain for asymptotically long times. This is motivated by the desire to characterize local dynamical…
This paper presents new sufficient conditions for convergence and asymptotic or exponential stability of a stochastic discrete-time system, under which the constructed Lyapunov function always decreases in expectation along the system's…
The dependence of the Lyapunov exponent on the closeness parameter, $\epsilon$, in tangent bifurcation systems is investigated. We study and illustrate two averaging procedures for defining Lyapunov exponents in such systems. First, we…
The Lyapunov exponent is used to characterize the stability of the dynamic response of the system, and it is often employed to verify if a system is chaotic. Since its discovery in the nineteenth century, various methods have been proposed…
We consider three matrix models of order 2 with one random entry $\epsilon$ and the other three entries being deterministic. In the first model, we let $\epsilon\sim\textrm{Bernoulli}\left(\frac{1}{2}\right)$. For this model we develop a…
We propose a new method for parameter learning in Bayesian networks with qualitative influences. This method extends our previous work from networks of binary variables to networks of discrete variables with ordered values. The specified…
Recurrent Neural Networks (RNN) are ubiquitous computing systems for sequences and multivariate time series data. While several robust architectures of RNN are known, it is unclear how to relate RNN initialization, architecture, and other…
Recurrent neural networks (RNNs) have been successfully applied to a variety of problems involving sequential data, but their optimization is sensitive to parameter initialization, architecture, and optimizer hyperparameters. Considering…
Methods have previously been developed for the approximation of Lyapunov functions using radial basis functions. However these methods assume that the evolution equations are known. We consider the problem of approximating a given Lyapunov…
We present a new algorithm for computing the Lyapunov exponents spectrum based on a matrix differential equation. The approach belongs to the so called continuous type, where the rate of expansion of perturbations is obtained for all times,…
For cooperative random linear systems of ordinary differential equations a method is presented of obtaining lower estimates of the top Lyapunov exponent. The proofs are based on applying some polynomial Lyapunov-like function. Known…
We develop a versatile deep neural network architecture, called Lyapunov-Net, to approximate Lyapunov functions of dynamical systems in high dimensions. Lyapunov-Net guarantees positive definiteness, and thus it can be easily trained to…
In this paper the Benettin-Wolf algorithm to determine all Lyapunov exponents for a class of fractional-order systems modeled by Caputo's derivative and the corresponding Matlab code are presented. First it is proved that the considered…