Related papers: Loosely-Stabilizing Phase Clocks and the Adaptive …
We study synchronization dynamics in populations of coupled phase oscillators with higher-order interactions and community structure. We find that the combination of these two properties gives rise to a number of states unsupported by…
The problem of consensus in the presence of adversarially behaving agents has been studied extensively in the literature. The proposed algorithms typically guarantee that the consensus value lies within the convex hull of initial normal…
We consider the problem of efficiently simulating population protocols. In the population model, we are given a distributed system of $n$ agents modeled as identical finite-state machines. In each time step, a pair of agents is selected…
We study synchronization phenomenon in a self-correcting population of noisy phase oscillators with randomly distributed natural frequencies. In our model each oscillator stochastically switches its phase to the ensemble-averaged value…
We study Plurality Consensus in the Gossip Model over a network of $n$ anonymous agents. Each agent supports an initial opinion or color. We assume that at the onset, the number of agents supporting the plurality color exceeds that of the…
We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive,…
We consider the problem of counting the population size in the population model. In this model, we are given a distributed system of $n$ identical agents which interact in pairs with the goal to solve a common task. In each time step, the…
We propose a population model for $\delta$-pulse-coupled oscillators with sparse connectivity. The model is given as an evolution equation for the phase density which take the form of a partial differential equation with a non-local term.…
This paper presents a randomized self-stabilizing algorithm that elects a leader $r$ in a general $n$-node undirected graph and constructs a spanning tree $T$ rooted at $r$. The algorithm works under the synchronous message passing network…
This paper addresses the leader-following consensus problem for discrete-time positive multi-agent systems over time-varying graphs. We assume that the followers may have mutually different positive dynamics which can also be different from…
We consider a population of globally coupled oscillators driven by common noise. By applying the Ott-Antonsen ansatz and by averaging over the fast oscillations, we obtain analytically tractable equations for the noisy evolution of the…
A sufficiently connected topology linking the constituent units of a complex system is usually seen as a prerequisite for the emergence of collective phenomena such as synchronization. We present a random network of heterogeneous phase…
The phenomenon of slow switching in populations of globally coupled oscillators is discussed. This characteristic collective dynamics, which was first discovered in a particular class of the phase oscillator model, is a result of the…
The majority of the literature on consensus assumes that protocols are jointly started at all nodes of the distributed system. We show how to remove this problematic assumption in semi-synchronous systems, where messages delays and relative…
It is well known that the consensus problem cannot be solved deterministically in an asynchronous environment, but that randomized solutions are possible. We propose a new model, called noisy scheduling, in which an adversarial schedule is…
We consider the problem of synchronizing two electric power generators, one of which (the leader) is serving a time-varying electrical load, so that they can ultimately be connected to form a single power system. Each generator is described…
Consider an arbitrary network of communicating modules on a chip, each requiring a local signal telling it when to execute a computational step. There are three common solutions to generating such a local clock signal: (i) by deriving it…
We consider the following distributed consensus problem: Each node in a complete communication network of size $n$ initially holds an \emph{opinion}, which is chosen arbitrarily from a finite set $\Sigma$. The system must converge toward a…
We consider synchronization of chaotic systems coupled indirectly through a common environmnet where the environment has an intrinsic dynmics of its own modulated via feedback from the systems. We find that a rich vareity of synchronization…
We study the dynamics of phase synchronization in growing populations of discrete phase oscillatory systems when the division process is coupled to the distribution of oscillator phases. Using mean field theory, linear stability analysis,…