Related papers: Bit flipping and time to recover
The bittide mechanism enables logically synchronous computation across distributed systems by leveraging the continuous frame transmission inherent to wired networks such as Ethernet. Instead of relying on a global clock, bittide uses a…
Neural networks have shown remarkable performance in various tasks, yet they remain susceptible to subtle changes in their input or model parameters. One particularly impactful vulnerability arises through the Bit-Flip Attack (BFA), where…
The binary Defect Combination Problem consists in finding a fully working subset from a given ensemble of imperfect binary components. We determine the typical properties of the model using methods of statistical mechanics, in particular,…
A bipartite spin system is proposed for which a fast transfer from one defined state into another exists. For sufficient coupling between the spins, this implements a bit-flipping mechanism which is much faster than that induced by…
Recent studies from social, biological, and engineering network systems have drawn attention to the dynamics over signed networks, where each link is associated with a positive/negative sign indicating trustful/mistrustful,…
A coarsened model for a binary system with limited miscibility of components is proposed; the system is described in terms of structural states in small parts of the material. The material is assumed to have two alternative types of…
Binary decisions are the simplest form of decisions that are made in our daily lives. Examples include choosing a two-way path in a maze, accepting or declining an offer, etc. These decisions are also made by computers, machines and various…
We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…
In this work, we consider the dynamics of repairable systems characterized by three distinct states: one signifying normal operational states, another representing degraded conditions and a third denoting failed conditions. These systems…
Various networks such as cloud computing, water/gas/electricity networks, wireless sensor networks, transportation networks, and 4G/5G networks, have become an integral part of our daily lives. A binary-state network (BN) is often used to…
We study complex networks of stochastic two-state units. Our aim is to model discrete stochastic excitable dynamics with a rest and an excited state. Both states are assumed to possess different waiting time distributions. The rest state is…
In this work, we explore the robustness of a bit-flip operation against thermal and quantum noise for bits represented by the symmetry-broken pairs of the period-doubled (PD) states in a classical parametric oscillator and discrete time…
Binary-state models are those in which the constituent elements can only appear in two possible configurations. These models are fundamental in the mathematical treatment of a number of phenomena such as spin interactions in magnetism,…
Given a discrete-state continuous-time reactive system, like a digital circuit, the classical approach is to first model it as a state transition system and then prove its properties. Our contribution advocates a different approach: to…
Since the invention of the solid-state transistor, the overwhelming majority of computers followed the von Neumann architecture that strictly separates logic operations and memory. Today, there is a revived interest in alternative…
The central question of systems biology is to understand how individual components of a biological system such as genes or proteins cooperate in emerging phenotypes resulting in the evolution of diseases. As living cells are open systems in…
We experimentally investigate how interactions between Kerr parametric oscillators (KPOs) degrade their bit-flip times, where a bit flip is defined as a transition between the two degenerate ground states of a KPO. Interactions between KPOs…
A model for the dynamical evolution of a granular binary mixture is analyzed. This system is submitted to a tapping procedure, similarly to what is done in real experiments. In the weak vibration limit, an effective dynamics for the tapping…
A one-dimensional flocking model using active Ising spins is studied, where the system evolves through the reinforcement learning approach \textit{via} defining state, action, and cost function for each spin. The orientation of spin with…
In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined…