arXiv subjects

Serhiy Yanchuk

Publications and source records attributed to Serhiy Yanchuk.

At least 37 records · Page 2Linked to original sources

arXiv2022

Heterogeneous nucleation in finite size adaptive dynamical networks

Phase transitions in equilibrium and nonequilibrium systems play a major role in the natural sciences. In dynamical networks, phase transitions organize qualitative changes in the collective behavior of coupled dynamical units. Adaptive dynamical networks feature a connectivity structure that changes over time, co-evolving with the nodes' dynamical state. In this Letter, we show the emergence of two distinct first-order nonequilibrium phase transitions in a finite size adaptive network of heterogeneous phase oscillators. Depending on the nature of defects in the internal frequency distribution, we observe either an abrupt single-step transition to full synchronization or a more gradual multi-step transition. This observation has a striking resemblance to heterogeneous nucleation. We develop a mean-field approach to study the interplay between adaptivity and nodal heterogeneity and describe the dynamics of multicluster states and their role in determining the character of the phase transition. Our work provides a theoretical framework for studying the interplay between adaptivity and nodal heterogeneity.

nlin.AO↗

arXiv2022

Spatio-temporal phenomena in complex systems with time delays

Real-world systems can be strongly influenced by time delays occurring in self-coupling interactions, due to unavoidable finite signal propagation velocities. When the delays become significantly long, complicated high-dimensional phenomena appear and a simple extension of the methods employed in low-dimensional dynamical systems is not feasible. We review the general theory developed in this case, describing the main destabilization mechanisms, the use of visualization tools, and commenting on the most important and effective dynamical indicators as well as their properties in different regimes. We show how a suitable approach, based on a comparison with spatio-temporal systems, represents a powerful instrument for disclosing the very basic mechanism of long-delay systems. Various examples from different models and a series of recent experiments are reported.

nlin.CD↗

arXiv2022

Asymmetric Adaptivity induces Recurrent Synchronization in Complex Networks

Rhythmic activities that alternate between coherent and incoherent phases are ubiquitous in chemical, ecological, climate, or neural systems. Despite their importance, general mechanisms for their emergence are little understood. In order to fill this gap, we present a framework for describing the emergence of recurrent synchronization in complex networks with adaptive interactions. This phenomenon is manifested at the macroscopic level by temporal episodes of coherent and incoherent dynamics that alternate recurrently. At the same time, the dynamics of the individual nodes do not change qualitatively. We identify asymmetric adaptation rules and temporal separation between the adaptation and the dynamics of individual nodes as key features for the emergence of recurrent synchronization. Our results suggest that asymmetric adaptation might be a fundamental ingredient for recurrent synchronization phenomena as seen in pattern generators, e.g., in neuronal systems.

nlin.AO↗

arXiv2021

Collective activity bursting in networks of excitable systems adaptively coupled to a pool of resources

We study the collective dynamics in a network of excitable units (neurons) adaptively interacting with a pool of resources. The resource pool is influenced by the average activity of the network, whereas the feedback from the resources to the network is comprised of components acting homogeneously or inhomogeneously on individual units of the network. Moreover, the resource pool dynamics is assumed to be slow and has an oscillatory degree of freedom. We show that the feedback loop between the network and the resources can give rise to collective activity bursting in the network. To explain the mechanisms behind this emergent phenomenon, we combine the Ott-Antonsen reduction for the collective dynamics of the network and singular perturbation theory to obtain a reduced system describing the interaction between the network mean field and the resources.

nlin.AO↗

arXiv2021

Spaceless description of active optical media

The acclaimed Maxwell-Bloch (or Arecchi-Bonifacio) equations are a valid dynamical model, effectively describing wave propagation in nonlinear optical media: from the amplification in input-output devices to multimode instabilities arising in laser systems. However, the inherent spatial variability of the physical observables represents an obstacle to fast simulations and analysis, especially whenever networks of active elements have to be considered. In this paper, we propose an approach which, stripping the spatial dependence of its role as a generator of dynamical richness, allows for a compelling simple portrait. It leads to (a few) ordinary differential equations in input-output configurations, complemented by a time-delayed feedback in closed-loop setups. Such scheme reproduces accurately the dynamics, paving the way to a plain treatment of the wealth of phenomena described by the Maxwell-Bloch equations.

physics.optics↗

arXiv2021

Master memory function for delay-based reservoir computers with single-variable dynamics

We show that many delay-based reservoir computers considered in the literature can be characterized by a universal master memory function (MMF). Once computed for two independent parameters, this function provides linear memory capacity for any delay-based single-variable reservoir with small inputs. Moreover, we propose an analytical description of the MMF that enables its efficient and fast computation. Our approach can be applied not only to reservoirs governed by known dynamical rules such as Mackey-Glass or Ikeda-like systems but also to reservoirs whose dynamical model is not available. We also present results comparing the performance of the reservoir computer and the memory capacity given by the MMF.

cs.ET↗

arXiv2021

Infinite-dimensional Folded-in-time Deep Neural Networks

The method recently introduced in arXiv:2011.10115 realizes a deep neural network with just a single nonlinear element and delayed feedback. It is applicable for the description of physically implemented neural networks. In this work, we present an infinite-dimensional generalization, which allows for a more rigorous mathematical analysis and a higher flexibility in choosing the weight functions. Precisely speaking, the weights are described by Lebesgue integrable functions instead of step functions. We also provide a functional back-propagation algorithm, which enables gradient descent training of the weights. In addition, with a slight modification, our concept realizes recurrent neural networks.

cs.LG↗

arXiv2021

Generalized splay states in phase oscillator networks

Networks of coupled phase oscillators play an important role in the analysis of emergent collective phenomena. In this article, we introduce generalized $m$-splay states constituting a special subclass of phase-locked states with vanishing $m$th order parameter. Such states typically manifest incoherent dynamics, and they often create high-dimensional families of solutions (splay manifolds). For a general class of phase oscillator networks, we provide explicit linear stability conditions for splay states and exemplify our results with the well-known Kuramoto-Sakaguchi model. Importantly, our stability conditions are expressed in terms of just a few observables such as the order parameter or the trace of the Jacobian. As a result, these conditions are simple and applicable to networks of arbitrary size. We generalize our findings to phase oscillators with inertia and adaptively coupled phase oscillator models.

math.DS↗

arXiv2021

The multiplex decomposition: An analytic framework for multilayer dynamical networks

Multiplex networks are networks composed of multiple layers such that the number of nodes in all layers is the same and the adjacency matrices between the layers are diagonal. We consider the special class of multiplex networks where the adjacency matrices for each layer are simultaneously triagonalizable. For such networks, we derive the relation between the spectrum of the multiplex network and the eigenvalues of the individual layers. As an application, we propose a generalized master stability approach that allows for a simplified, low-dimensional description of the stability of synchronized solutions in multiplex networks. We illustrate our result with a duplex network of FitzHugh-Nagumo oscillators. In particular, we show how interlayer interaction can lead to stabilization or destabilization of the synchronous state. Finally, we give explicit conditions for the stability of synchronous solutions in duplex networks of linear diffusive systems.

nlin.AO↗

arXiv2021

Synchronization in networks with heterogeneous adaptation rules and applications to distance-dependent synaptic plasticity

This work introduces a methodology for studying synchronization in adaptive networks with heterogeneous plasticity (adaptation) rules. As a paradigmatic model, we consider a network of adaptively coupled phase oscillators with distance-dependent adaptations. For this system, we extend the master stability function approach to adaptive networks with heterogeneous adaptation. Our method allows for separating the contributions of network structure, local node dynamics, and heterogeneous adaptation in determining synchronization. Utilizing our proposed methodology, we explain mechanisms leading to synchronization or desynchronization by enhanced long-range connections in nonlocally coupled ring networks and networks with Gaussian distance-dependent coupling weights equipped with a biologically motivated plasticity rule.

math.DS↗

arXiv2021

Deep Neural Networks using a Single Neuron: Folded-in-Time Architecture using Feedback-Modulated Delay Loops

Deep neural networks are among the most widely applied machine learning tools showing outstanding performance in a broad range of tasks. We present a method for folding a deep neural network of arbitrary size into a single neuron with multiple time-delayed feedback loops. This single-neuron deep neural network comprises only a single nonlinearity and appropriately adjusted modulations of the feedback signals. The network states emerge in time as a temporal unfolding of the neuron's dynamics. By adjusting the feedback-modulation within the loops, we adapt the network's connection weights. These connection weights are determined via a back-propagation algorithm, where both the delay-induced and local network connections must be taken into account. Our approach can fully represent standard Deep Neural Networks (DNN), encompasses sparse DNNs, and extends the DNN concept toward dynamical systems implementations. The new method, which we call Folded-in-time DNN (Fit-DNN), exhibits promising performance in a set of benchmark tasks.

cs.LG↗

arXiv2021

What adaptive neuronal networks teach us about power grids

Power grid networks, as well as neuronal networks with synaptic plasticity, describe real-world systems of tremendous importance for our daily life. The investigation of these seemingly unrelated types of dynamical networks has attracted increasing attention over the last decade. In this paper, we provide insight into the fundamental relation between these two types of networks. For this, we consider well-established models based on phase oscillators and show their intimate relation. In particular, we prove that phase oscillator models with inertia can be viewed as a particular class of adaptive networks. This relation holds even for more general classes of power grid models that include voltage dynamics. As an immediate consequence of this relation, we find a novel type of multicluster state for phase oscillators with inertia. Moreover, the phenomenon of cascading line failure in power grids is translated into an adaptive neuronal network.

nlin.AO↗

arXiv2021

Modelling power grids as pseudo adaptive networks

Power grids, as well as neuronal networks with synaptic plasticity, describe real-world systems of tremendous importance for our daily life. The investigation of these seemingly unrelated types of dynamical networks has attracted increasing attention over the last decade. In this work, we exploit the recently established relation between these two types of networks to gain insights into the dynamical properties of multifrequency clusters in power grid networks. For this, we consider the model of Kuramoto-Sakaguchi phase oscillators with inertia and describe the emergence of multicluster states. Building on this, we provide a new perspective on solitary states in power grid networks by introducing the concept of pseudo coupling weights.

nlin.AO↗

arXiv2021

Absolute stability and absolute hyperbolicity in systems with discrete time-delays

An equilibrium of a delay differential equation (DDE) is absolutely stable, if it is locally asymptotically stable for all delays. We present criteria for absolute stability of DDEs with discrete time-delays. In the case of a single delay, the absolute stability is shown to be equivalent to asymptotic stability for sufficiently large delays. Similarly, for multiple delays, the absolute stability is equivalent to asymptotic stability for hierarchically large delays. Additionally, we give necessary and sufficient conditions for a linear DDE to be hyperbolic for all delays. The latter conditions are crucial for determining whether a system can have stabilizing or destabilizing bifurcations by varying time delays.

math.DS↗

arXiv2021

Insight into Delay Based Reservoir Computing via Eigenvalue Analysis

In this paper we give a profound insight into the computation capability of delay-based reservoir computing via an eigenvalue analysis. We concentrate on the task-independent memory capacity to quantify the reservoir performance and compare these with the eigenvalue spectrum of the dynamical system. We show that these two quantities are deeply connected, and thus the reservoir computing performance is predictable by analyzing the small signal response of the reservoir. Our results suggest that any dynamical system used as a reservoir can be analyzed in this way. We apply our method exemplarily to a photonic laser system with feedback and compare the numerically computed recall capabilities with the eigenvalue spectrum. Optimal performance is found for a system with the eigenvalues having real parts close to zero and off-resonant imaginary parts.

cs.LG↗

arXiv2021

Effect of diluted connectivities on cluster synchronization of adaptively coupled oscillator networks

Synchronization in networks of oscillatory units is an emergent phenomenon present in various systems, such as biological, technological, and social systems. Many real-world systems have adaptive properties, meaning that their connectivities change with time, depending on the dynamical state of the system. Networks of adaptively coupled oscillators show various synchronization phenomena, such as hierarchical multifrequency clusters, traveling waves, or chimera states. While these self-organized patterns have been previously studied on all-to-all coupled networks, this work extends the investigations towards more complex networks, analyzing the influence of random network topologies for various degrees of dilution of the connectivities. Using numerical and analytical approaches, we investigate the robustness of multicluster states on networks of adaptively coupled Kuramoto-Sakaguchi oscillators against the random dilution of the underlying network topology. Further, we utilize the master stability approach for adaptive networks in order to highlight the interplay between adaptivity and topology.

nlin.AO↗

arXiv2020

Emulating complex networks with a single delay differential equation

A single dynamical system with time-delayed feedback can emulate networks. This property of delay systems made them extremely useful tools for Machine Learning applications. Here we describe several possible setups, which allow emulating multilayer (deep) feed-forward networks as well as recurrent networks of coupled discrete maps with arbitrary adjacency matrix by a single system with delayed feedback. While the network's size can be arbitrary, the generating delay system can have a low number of variables, including a scalar case.

math.DS↗

arXiv2020

Deep Time-Delay Reservoir Computing: Dynamics and Memory Capacity

The Deep Time-Delay Reservoir Computing concept utilizes unidirectionally connected systems with time-delays for supervised learning. We present how the dynamical properties of a deep Ikeda-based reservoir are related to its memory capacity (MC) and how that can be used for optimization. In particular, we analyze bifurcations of the corresponding autonomous system and compute conditional Lyapunov exponents, which measure the generalized synchronization between the input and the layer dynamics. We show how the MC is related to the systems distance to bifurcations or magnitude of the conditional Lyapunov exponent. The interplay of different dynamical regimes leads to a adjustable distribution between linear and nonlinear MC. Furthermore, numerical simulations show resonances between clock cycle and delays of the layers in all degrees of the MC. Contrary to MC losses in a single-layer reservoirs, these resonances can boost separate degrees of the MC and can be used, e.g., to design a system with maximum linear MC. Accordingly, we present two configurations that empower either high nonlinear MC or long time linear MC.

nlin.AO↗