48,140 research outputs found
Approximating the Real Structured Stability Radius with Frobenius Norm Bounded Perturbations
We propose a fast method to approximate the real stability radius of a linear
dynamical system with output feedback, where the perturbations are restricted
to be real valued and bounded with respect to the Frobenius norm. Our work
builds on a number of scalable algorithms that have been proposed in recent
years, ranging from methods that approximate the complex or real pseudospectral
abscissa and radius of large sparse matrices (and generalizations of these
methods for pseudospectra to spectral value sets) to algorithms for
approximating the complex stability radius (the reciprocal of the
norm). Although our algorithm is guaranteed to find only upper bounds to the
real stability radius, it seems quite effective in practice. As far as we know,
this is the first algorithm that addresses the Frobenius-norm version of this
problem. Because the cost mainly consists of computing the eigenvalue with
maximal real part for continuous-time systems (or modulus for discrete-time
systems) of a sequence of matrices, our algorithm remains very efficient for
large-scale systems provided that the system matrices are sparse
Speed of synchronization in complex networks of neural oscillators Analytic results based on Random Matrix Theory
We analyze the dynamics of networks of spiking neural oscillators. First, we
present an exact linear stability theory of the synchronous state for networks
of arbitrary connectivity. For general neuron rise functions, stability is
determined by multiple operators, for which standard analysis is not suitable.
We describe a general non-standard solution to the multi-operator problem.
Subsequently, we derive a class of rise functions for which all stability
operators become degenerate and standard eigenvalue analysis becomes a suitable
tool. Interestingly, this class is found to consist of networks of leaky
integrate and fire neurons. For random networks of inhibitory
integrate-and-fire neurons, we then develop an analytical approach, based on
the theory of random matrices, to precisely determine the eigenvalue
distribution. This yields the asymptotic relaxation time for perturbations to
the synchronous state which provides the characteristic time scale on which
neurons can coordinate their activity in such networks. For networks with
finite in-degree, i.e. finite number of presynaptic inputs per neuron, we find
a speed limit to coordinating spiking activity: Even with arbitrarily strong
interaction strengths neurons cannot synchronize faster than at a certain
maximal speed determined by the typical in-degree.Comment: 17 pages, 12 figures, submitted to Chao
Topological Speed Limits to Network Synchronization
We study collective synchronization of pulse-coupled oscillators interacting
on asymmetric random networks. We demonstrate that random matrix theory can be
used to accurately predict the speed of synchronization in such networks in
dependence on the dynamical and network parameters. Furthermore, we show that
the speed of synchronization is limited by the network connectivity and stays
finite, even if the coupling strength becomes infinite. In addition, our
results indicate that synchrony is robust under structural perturbations of the
network dynamics.Comment: 5 pages, 3 figure
The spectral radius remains a valid indicator of the echo state property for large reservoirs
In the field of Reservoir Computing, scaling the spectral radius of the weight matrix of a random recurrent neural network to below unity is a commonly used method to ensure the Echo State Property. Recently it has been shown that this condition is too weak. To overcome this problem, other more involved - sufficient conditions for the Echo State Property have been proposed. In this paper we provide a large-scale experimental verification of the Echo State Property for large recurrent neural networks with zero input and zero bias. Our main conclusion is that the spectral radius method remains a valid indicator of the Echo State Property; the probability that the Echo State Property does not hold, drops for larger networks with spectral radius below unity, which are the ones of practical interest
Preconditioning complex symmetric linear systems
A new polynomial preconditioner for symmetric complex linear systems based on
Hermitian and skew-Hermitian splitting (HSS) for complex symmetric linear
systems is herein presented. It applies to Conjugate Orthogonal Conjugate
Gradient (COCG) or Conjugate Orthogonal Conjugate Residual (COCR) iterative
solvers and does not require any estimation of the spectrum of the coefficient
matrix. An upper bound of the condition number of the preconditioned linear
system is provided. Moreover, to reduce the computational cost, an inexact
variant based on incomplete Cholesky decomposition or orthogonal polynomials is
proposed. Numerical results show that the present preconditioner and its
inexact variant are efficient and robust solvers for this class of linear
systems. A stability analysis of the method completes the description of the
preconditioner.Comment: 26 pages, 4 figures, 4 table
Universal transient behavior in large dynamical systems on networks
We analyze how the transient dynamics of large dynamical systems in the
vicinity of a stationary point, modeled by a set of randomly coupled linear
differential equations, depends on the network topology. We characterize the
transient response of a system through the evolution in time of the squared
norm of the state vector, which is averaged over different realizations of the
initial perturbation. We develop a mathematical formalism that computes this
quantity for graphs that are locally tree-like. We show that for unidirectional
networks the theory simplifies and general analytical results can be derived.
For example, we derive analytical expressions for the average squared norm for
random directed graphs with a prescribed degree distribution. These analytical
results reveal that unidirectional systems exhibit a high degree of
universality in the sense that the average squared norm only depends on a
single parameter encoding the average interaction strength between the
individual constituents. In addition, we derive analytical expressions for the
average squared norm for unidirectional systems with fixed diagonal disorder
and with bimodal diagonal disorder. We illustrate these results with numerical
experiments on large random graphs and on real-world networks.Comment: 19 pages, 7 figures. Substantially enlarged version. Submitted to
Physical Review Researc
- …