Probability of local bifurcation type from a fixed point: A random matrix perspective

Results regarding probable bifurcations from fixed points are presented in the context of general dynamical systems (real, random matrices), time-delay dynamical systems (companion matrices), and a set of mappings known for their properties as universal approximators (neural networks). The eigenvalue spectra is considered both numerically and analytically using previous work of Edelman et. al. Based upon the numerical evidence, various conjectures are presented. The conclusion is that in many circumstances, most bifurcations from fixed points of large dynamical systems will be due to complex eigenvalues. Nevertheless, surprising situations are presented for which the aforementioned conclusion is not general, e.g. real random matrices with Gaussian elements with a large positive mean and finite variance.Comment: 21 pages, 19 figure

Spectral Theory for Networks with Attractive and Repulsive Interactions

There is a wealth of applied problems that can be posed as a dynamical system defined on a network with both attractive and repulsive interactions. Some examples include: understanding synchronization properties of nonlinear oscillator;, the behavior of groups, or cliques, in social networks; the study of optimal convergence for consensus algorithm; and many other examples. Frequently the problems involve computing the index of a matrix, i.e. the number of positive and negative eigenvalues, and the dimension of the kernel. In this paper we consider one of the most common examples, where the matrix takes the form of a signed graph Laplacian. We show that the there are topological constraints on the index of the Laplacian matrix related to the dimension of a certain homology group. In certain situations, when the homology group is trivial, the index of the operator is rigid and is determined only by the topology of the network and is independent of the strengths of the interactions. In general these constraints give upper and lower bounds on the number of positive and negative eigenvalues, with the dimension of the homology group counting the number of eigenvalue crossings. The homology group also gives a natural decomposition of the dynamics into "fixed" degrees of freedom, whose index does not depend on the edge-weights, and an orthogonal set of "free" degrees of freedom, whose index changes as the edge weights change. We also present some numerical studies of this problem for large random matrices.Comment: 27 pages; 9 Figure

Dynamics of neural systems with discrete and distributed time delays

In real-world systems, interactions between elements do not happen instantaneously, due to the time required for a signal to propagate, reaction times of individual elements, and so forth. Moreover, time delays are normally nonconstant and may vary with time. This means that it is vital to introduce time delays in any realistic model of neural networks. In order to analyze the fundamental properties of neural networks with time-delayed connections, we consider a system of two coupled two-dimensional nonlinear delay differential equations. This model represents a neural network, where one subsystem receives a delayed input from another subsystem. An exciting feature of the model under consideration is the combination of both discrete and distributed delays, where distributed time delays represent the neural feedback between the two subsystems, and the discrete delays describe the neural interaction within each of the two subsystems. Stability properties are investigated for different commonly used distribution kernels, and the results are compared to the corresponding results on stability for networks with no distributed delays. It is shown how approximations of the boundary of the stability region of a trivial equilibrium can be obtained analytically for the cases of delta, uniform, and weak gamma delay distributions. Numerical techniques are used to investigate stability properties of the fully nonlinear system, and they fully confirm all analytical findings

Optimal Piecewise-Linear Approximation of the Quadratic Chaotic Dynamics

This paper shows the influence of piecewise-linear approximation on the global dynamics associated with autonomous third-order dynamical systems with the quadratic vector fields. The novel method for optimal nonlinear function approximation preserving the system behavior is proposed and experimentally verified. This approach is based on the calculation of the state attractor metric dimension inside a stochastic optimization routine. The approximated systems are compared to the original by means of the numerical integration. Real electronic circuits representing individual dynamical systems are derived using classical as well as integrator-based synthesis and verified by time-domain analysis in Orcad Pspice simulator. The universality of the proposed method is briefly discussed, especially from the viewpoint of the higher-order dynamical systems. Future topics and perspectives are also provide