Related papers: Loosely-Stabilizing Phase Clocks and the Adaptive …
We study here the problem of determining the majority type in an arbitrary connected network, each vertex of which has initially two possible types. The vertices may have a few additional possible states and can interact in pairs only if…
Understanding how information can efficiently spread in distributed systems under noisy communications is a fundamental question in both biological research and artificial system design. When agents are able to control whom they interact…
We present an approach which enables to identify phase synchronization in coupled chaotic oscillators without having to explicitly measure the phase. We show that if one defines a typical event in one oscillator and then observes another…
Perfect synchronicity in $N$-player games is a useful theoretical dream, but communication delays are inevitable and may result in asynchronous interactions. Some systems such as financial markets are asynchronous by design, and yet most…
Population protocols model information spreading and computation in network systems where pairwise node exchanges are determined by an external random scheduler and nodes have small memory. Most of the population protocols in the literature…
In several real \emph{Multi-Agent Systems} (MAS), it has been observed that only weaker forms of\emph{metastable consensus} are achieved, in which a large majority of agents agree on some opinion while other opinions continue to be…
We provide a solution to the heretofore open problem of stabilization of systems with arbitrarily long delays at the input and output of a nonlinear system using output feedback only. The solution is global, employs the predictor approach…
This paper studies the stability of sampled and networked control systems with sampling and communication times governed by probabilistic clocks. The clock models have few restrictions, and can be used to model numerous phenomena such as…
We investigate collective synchronization in a system of coupled oscillators on small-world networks. The order parameters which measure synchronization of phases and frequencies are introduced and analyzed by means of dynamic simulations…
We consider the Relative-Majority Problem (also known as Plurality), in which, given a multi-agent system where each agent is initially provided an input value out of a set of $k$ possible ones, each agent is required to eventually compute…
After decades of study, there are only two known mechanisms to induce global synchronization in a population of oscillators: deterministic coupling and common forcing. The inclusion of independent random forcing in these models typically…
We consider an array of nearest-neighbor coupled nonlinear autonomous oscillators with quenched random frequencies and purely conservative coupling. We show that global phase-locked states emerge in finite lattices and study numerically…
We develop a formalism to analyze the behaviour of pulse--coupled identical phase oscillators with a specific attention devoted to the onset of partial synchronization. The method, which allows describing the dynamics both at the…
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…
Using experiments on a colloidal particle trapped in an optical tweezer, we confirm a recent proposal to increase the effective mobility or clock rate of systems described by Langevin dynamics, by simultaneously scaling deterministic forces…
We have developed an experimental setup of very simple self-propelled robots to observe collective motion emerging as a result of inelastic collisions only. A circular pool and commercial RC boats were the basis of our first setup, where we…
The \emph{rational fair consensus problem} can be informally defined as follows. Consider a network of $n$ (selfish) \emph{rational agents}, each of them initially supporting a \emph{color} chosen from a finite set $ \Sigma$. The goal is to…
We experimentally demonstrated that the stability of an atomic clock improves at fastest rate $\tau^{-1}$ (where $\tau$ is the averaging time) when the phase of a local oscillator is genuinely compared to the continuous phase of many atoms…
Population protocols are a model of computation in which indistinguishable mobile agents interact in pairs to decide a property of their initial configuration. Originally introduced by Angluin et. al. in 2004 with a constant number of…
In this technical note, we first clarify a technical issue in the convergence proof of a free-will arbitrary time (FwAT) consensus law proposed recently in Pal et al. IEEE Trans. Cybern. (2020)[1], making the results questionable. We then…