Related papers: Maximum Performance at Minimum Cost in Network Syn…
In decentralized optimization, several nodes connected by a network collaboratively minimize some objective function. For minimization of Lipschitz functions lower bounds are known along with optimal algorithms. We study a specific class of…
Synchronization is essential for the stability and coordinated operation of complex networked systems. Pinning control, which selectively controls a subset of nodes, provides a scalable solution to enhance network synchronizability.…
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…
We study the synchronization properties of a generic networked dynamical system, and show that, under a suitable approximation, the transition to synchronization can be predicted with the only help of eigenvalues and eigenvectors of the…
Synchronization is crucial for the correct functionality of many natural and man-made complex systems. In this work we characterize the formation of synchronization patterns in networks of Kuramoto oscillators. Specifically, we reveal…
Oscillator Ising machines (OIMs) are networks of coupled oscillators that seek the minimum energy state of an Ising model. Since many NP-hard problems are equivalent to the minimization of an Ising Hamiltonian, OIMs have emerged as a…
In this Letter we investigate networks that have been optimized to realize a trade-off between enhanced synchronization and cost of wire to connect the nodes in space. Analyzing the evolved arrangement of nodes in space and their…
We derive a master stability function (MSF) for synchronization in networks of coupled dynamical systems with small but arbitrary parametric variations. Analogous to the MSF for identical systems, our generalized MSF simultaneously solves…
We show how coupling of local optimization processes can lead to better solutions than multi-start local optimization consisting of independent runs. This is achieved by minimizing the average energy cost of the ensemble, subject to…
Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a…
In this paper, we investigate the collective synchronization of system of coupled oscillators on Barab\'{a}si-Albert scale-free network. We propose an approach of structural perturbations aiming at those nodes with maximal betweenness. This…
In this paper, we address the finite time synchronization of a network of dynamical systems with time-varying interactions modeled using temporal networks. We synchronize a few nodes initially using external control inputs. These nodes are…
To understand how certain dynamical behaviors can or cannot persist as the underlying network grows is a problem of increasing importance in complex dynamical systems as well as sustainability science and engineering. We address the…
Linearized models of power systems are often desirable to formulate tractable control and optimization problems that still reflect real-world physics adequately under various operating conditions. In this paper, we propose an approach that…
Algebraic connectivity is one way to quantify graph connectivity, which in turn gauges robustness as a network. In this paper, we consider the problem of maximising algebraic connectivity both local and globally over all simple, undirected,…
In modern network design, "efficiency" is often conflated with raw performance metrics like latency or aggregate throughput. This paper proposes a resource-centric definition of efficiency, isolating the hardware cost required to maintain a…
We propose new mathematical optimization models for generating sparse dynamical graphs, or networks, that can achieve synchronization. The synchronization phenomenon is studied using the Kuramoto model, defined in terms of the adjacency…
We present a formula for determining synchronizability in large, randomized and weighted simplicial complexes. This formula leverages eigenratios and costs to assess complete synchronizability under diverse network topologies and intensity…
Network science has traditionally examined how structure determines dynamics. Here we invert this paradigm: we ask how functional dynamics and resource constraints shape network architecture. We introduce GradNet, an AI-enabled optimization…
We analyze the final state sensitivity of nonlocal networks with respect to initial conditions of their units. By changing the initial conditions of a single network unit, we perturb an initially synchronized state. Depending on the…