Related papers: Loosely-Stabilizing Phase Clocks and the Adaptive …
Dynamically available total-order broadcast (TOB) protocols tolerate fluctuating participation, e.g., as high as 99% of their participants going offline, which is especially useful in permissionless blockchain environments. However,…
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…
We consider leader election in anonymous radio networks modeled as simple undirected connected graphs. Nodes communicate in synchronous rounds. Nodes are anonymous and execute the same deterministic algorithm, so symmetry can be broken only…
We introduce a prototype model for globally-coupled oscillators in which each element is given an oscillation frequency and a preferential oscillation direction (polarization), both randomly distributed. We found two collective transitions:…
We study the stabilization of networked control systems with asynchronous sensors and controllers. Offsets between the sensor and controller clocks are unknown and modeled as parametric uncertainty. First we consider multi-input linear…
We present a general framework for modeling a wide selection of flocking scenarios under free boundary conditions. Several variants have been considered - including examples for the widely observed behavior of hierarchically interacting…
We investigate the phenomena of political bi-polarization in a population of interacting agents by means of a generalized version of the model introduced in PRE E 101, 012101 (2020) for the dynamics of voting intention. Each agent has a…
In this paper, synchronization of fractional order Coullet system with precise and also unknown parameters are studied. The proposed method which is based on the adaptive backstepping, has been developed to synchronize two chaotic systems…
Phase synchronization refers to a kind of collective phenomenon that the phase difference between two or more systems is locked, and it has widely been investigated between systems with the identical physical properties, such as the…
We study the problem of controlling population dynamics, a class of linear dynamical systems evolving on the probability simplex, from the perspective of online non-stochastic control. While Golowich et.al. 2024 analyzed the fully…
We introduce a graph-theoretic approach to synchronizing clocks in an {\em ad hoc} network of $N$~timepieces. Clocks naturally drift away from being synchronized because of many physical factors. The manual way of clock synchronization…
We demonstrate a deterministic Byzantine consensus algorithm with synchronous operation in partial synchrony. It is naturally leaderless, tolerates any number of $ f<n/2 $ Byzantine processes with 2 rounds of exchange of originator-only…
We consider a population of $n$ agents which communicate with each other in a decentralized manner, through random pairwise interactions. One or more agents in the population may act as authoritative sources of information, and the…
In this work, the synchronization problem of a master-slave system of autonomous ordinary differential equations (ODEs) is considered. Here, the systems are, chaotic with a nonlinearity represented by a piecewise linear function,…
In populations with community structure, the formation of consensus requires both alignment within and diffusion of beliefs across groups, processes that evolve on distinct time scales. How do modularity, asymmetry, and polarization shape…
We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that reify semantic constraints between actions. Constraint types include…
A model for synchronization of globally coupled phase oscillators including ``inertial'' effects is analyzed. In such a model, both oscillator frequencies and phases evolve in time. Stationary solutions include incoherent (unsynchronized)…
The population protocol model describes a network of $n$ anonymous agents who cannot control with whom they interact. The agents collectively solve some computational problem through random pairwise interactions, each agent updating its own…
Common noise acting on a population of identical oscillators can synchronize them. We develop a description of this process which is not limited to the states close to synchrony, but provides a global picture of the evolution of the…
We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes $n$. The protocol is completely distributed, with the exception of requiring all nodes…