Related papers: Scalable Resetting Algorithms for Synchronization …
In this paper, we propose a novel stochastic binary resetting algorithm for networks of pulse-coupled oscillators (or, simply, agents) to reach global synchronization. The algorithm is simple to state: Every agent in a network oscillates at…
Driven by increased applications in biological networks and wireless sensor networks, synchronization of pulse-coupled oscillators (PCOs) has gained increased popularity. However, most existing results address the local synchronization of…
In this paper, we study the problem of robust global synchronization of resetting clocks in multi-agent networked systems, where by robust global synchronization we mean synchronization that is insensitive to arbitrarily small disturbances,…
The importance of pulse-coupled oscillators (PCOs) in biology and engineering has motivated research to understand basic properties of PCO networks. Despite the large body of work addressing PCOs, a global synchronization result for…
This work provides new insights on the convergence of a locally connected network of pulse coupled oscillator (PCOs) (i.e., a bio-inspired model for communication networks) to synchronous and desynchronous states, and their implication in…
We consider a discrete-time model of continuous-time distributed optimization over dynamic directed-graphs (digraphs) with applications to distributed learning. Our optimization algorithm works over general strongly connected dynamic…
Consider a distributed network on a finite simple graph $G=(V,E)$ with diameter $d$ and maximum degree $\Delta$, where each node has a phase oscillator revolving on $S^{1}=\mathbb{R}/\mathbb{Z}$ with unit speed. Pulse-coupling is a class of…
By spreading phases on the unit circle, desynchronization algorithm is a powerful tool to achieve round-robin scheduling, which is crucial in applications as diverse as media access control of communication networks, realization of…
In this paper, we consider the synchronization of heterogeneous pulse-coupled oscillators (PCOs), where some of the oscillators might be faulty or malicious. The oscillators interact through identical pulses at discrete instants and evolve…
It is a well known fact that sequential algorithms which exhibit a strong "local" nature can be adapted to the distributed setting given a legal graph coloring. The running time of the distributed algorithm will then be at least the number…
We introduce a system of pulse coupled oscillators that can change both their phases and frequencies; and prove that when there is a separation of time scales between phase and frequency adjustment the system converges to exact synchrony on…
We consider the fundamental problem of clock synchronization in a synchronous multi-agent system. Each agent holds a clock with an arbitrary initial value, and clocks must eventually indicate the same value. Previous algorithms worked in…
This paper considers the problem of distributed optimization over time-varying graphs. For the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing, based on a combination of a distributed inexact gradient…
Decentralized heading control is crucial for robotic network operations such as surveillance, exploration, and cooperative construction. However, few results consider decentralized heading control when the speed of heading adjustment is…
We present a simple randomized algorithm that can efficiently maintain a $(\Delta+1)$ coloring as the graph undergoes edge insertion and deletion updates, where $\Delta$ denotes an upper bound on the maximum degree. A key advantage is the…
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…
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.…
In graph sparsification, the goal has almost always been of {global} nature: compress a graph into a smaller subgraph ({sparsifier}) that maintains certain features of the original graph. Algorithms can then run on the sparsifier, which in…
Most graphs in real life keep changing with time. These changes can be in the form of insertion or deletion of edges or vertices. Such rapidly changing graphs motivate us to study dynamic graph algorithms. However, three important graph…
This paper is concerned with a constrained optimization problem over a directed graph (digraph) of nodes, in which the cost function is a sum of local objectives, and each node only knows its local objective and constraints. To…