Related papers: An Attack-Resilient Pulse-Based Synchronization St…
Recent studies exploited external periodic synchronous signals to synchronize a pair of network nodes to address a threat of delaying the communications between the nodes. However, the sensing-based synchronization may yield faults due to…
Cyber-physical systems (CPSs) facilitate the integration of physical entities and cyber infrastructures through the utilization of pervasive computational resources and communication units, leading to improved efficiency, automation, and…
The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not…
Byzantine robustness has received significant attention recently given its importance for distributed and federated learning. In spite of this, we identify severe flaws in existing algorithms even when the data across the participants is…
Byzantine agreement is a fundamental problem in fault-tolerant distributed computing that has been studied intensively for the last four decades. Much of the research has focused on a static Byzantine adversary, where the adversary is…
We study how dynamical decoupling (DD) pulse sequences can improve the reliability of quantum computers. We prove upper bounds on the accuracy of DD-protected quantum gates and derive sufficient conditions for DD-protected gates to…
We make a short review about the synchronization in coupled phase oscillator models. Next, we study the common-noise-induced synchronization among active rotators. At an intermediate noise strength, the noise-induced synchronization takes…
Federated learning (FL) is recognized as a key enabling technology to provide intelligent services for future wireless networks and industrial systems with delay and privacy guarantees. However, the performance of wireless FL can be…
The role of intermediaries in the synchronization of small groups of light controlled oscillators (LCO) is addressed. A single LCO is a two-time-scale phase oscillator. When pulse-coupling two LCOs, the synchronization time decreases…
Synchronization of networked oscillators is known to depend fundamentally on the interplay between the dynamics of the graph's units and the microscopic arrangement of the network's structure. For non identical elements, the lack of…
We present a formula for determining synchronizability in large, randomized and weighted simplicial complexes. This formula leverages eigenratios and costs to assess complete synchronizability under diverse network topologies and intensity…
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…
Weakly coupled oscillators adjust their dynamics to work in unison: they synchronize. This ubiquitous phenomenon is observed for oscillating pendulum, electronic devices, as well as clapping crowds or flashing fireflies. In effect,…
The phenomenon of synchronization, where entities exhibit stable oscillations with aligned frequencies and phases, has been detected in diverse areas of natural science. It plays a crucial role in achieving frequency locking in multiple…
Quantum computation holds the promise of solving computational problems which are believed to be classically intractable. However, in practice, quantum devices are still limited by their relatively short coherence times and imperfect…
Understanding complex systems which exhibit desynchronization as an emergent property should have important implications, particularly in treating neurological disorders and designing efficient communication networks. Here were demonstrate…
Consider a linear time-invariant (LTI) dynamical system monitored by a network of sensors, modeled as nodes of an underlying directed communication graph. We study the problem of collaboratively estimating the state of the system when…
Sybil attacks, in which a large number of adversary-controlled nodes join a network, are a concern for many peer-to-peer database systems, necessitating expensive countermeasures such as proof-of-work. However, there is a category of…
Parallel p-bit Ising machines are a promising platform for fast and energy-efficient combinatorial optimization, but their scalability depends on update synchronization, hardware delay, and architectural cost. In this work, we establish a…
This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate…