Related papers: Synchronization in Anonymous Networks Under Arbitr…
In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…
Consider the execution of a sequential algorithm that requires the program to converge to an optimal state, and then terminate/stutter. To design such an algorithm, we need to ensure that the state space that it traverses forms a directed…
Among the fundamental questions in computer science is that of the impact of synchronism/asynchronism on computations, which has been addressed in various fields of the discipline: in programming, in networking, in concurrence theory, in…
In computer networks, participants may cooperate in processing tasks, so that loads are balanced among them. We present local distributed algorithms that (repeatedly) use local imbalance criteria to transfer loads concurrently across the…
In this paper, the investigation is first motivated by showing two examples of simple regular symmetrical graphs, which have the same structural parameters, such as average distance, degree distribution and node betweenness centrality, but…
Many tasks executed in dynamic distributed systems, such as sensor networks or enterprise environments with bring-your-own-device policy, require central coordination by a leader node. In the past it has been proven that distributed leader…
Finding conditions that support synchronization is a fertile and active area of research with applications across multiple disciplines. Here we present and analyze a scheme for synchronizing chaotic dynamical systems by transiently…
Algorithms and dynamics over networks often involve randomization, and randomization may result in oscillating dynamics which fail to converge in a deterministic sense. In this paper, we observe this undesired feature in three applications,…
To observe synchronization in a large network of classical or quantum systems demands both excellent control of the interactions between the nodes and very accurate preparation of the initial conditions due to the involved nonlinearities…
In decentralized optimization, nodes of a communication network each possess a local objective function, and communicate using gossip-based methods in order to minimize the average of these per-node functions. While synchronous algorithms…
One of the most important problems in the field of distributed optimization is the problem of minimizing a sum of local convex objective functions over a networked system. Most of the existing work in this area focus on developing…
This paper presents an application of partial contraction analysis to the study of global synchronization in discrete chaotic systems. Explicit sufficient conditions on the coupling strength of networks of discrete oscillators are derived.…
This work addresses the instability in asynchronous data parallel optimization. It does so by introducing a novel distributed optimizer which is able to efficiently optimize a centralized model under communication constraints. The optimizer…
Synchronization in networks of discrete-time linear time-invariant systems is considered under relative actuation. Neither input nor output matrices are assumed to be commensurable. A distributed algorithm that ensures synchronization via…
This paper considers the synchronization problem for networks of coupled nonlinear dynamical systems under switching communication topologies. Two types of nonlinear agent dynamics are considered. The first one is non-expansive dynamics…
This paper deals with synchronization of a class of infinite-dimensional systems. The considered network is described by a collection of semilinear Lipschitz boundary-actuated infinite-dimensional dynamics. For undirected connected graphs,…
We propose an adaptive control strategy for the simultaneous estimation of topology and synchronization in complex dynamical networks with unknown, time-varying topology. Our approach transforms the problem of time-varying topology…
We consider systems that are well modelled as a networks that evolve in time, which we call {\it Moving Neighborhood Networks}. These models are relevant in studying cooperative behavior of swarms and other phenomena where emergent…
We present an algorithm for synchronous deterministic Byzantine consensus, tolerant to links failures and links asynchrony. It cares for a class of networks with specific needs, where both safety and liveness are essential, and timely…
A mobile robot system consists of anonymous mobile robots, each of which autonomously performs sensing, computation, and movement according to a common algorithm, so that the robots collectively achieve a given task. There are two main…