scholarly journals On Approximate Majority and Probabilistic Time

2007 ◽  
Author(s):  
Emanuele Viola
Keyword(s):  
Approximate Majority

scholarly journals Modelling the spread of innovation in wild birds

2017 ◽  
Vol 14 (131) ◽  
pp. 20170215 ◽  
Author(s):  
Thomas R. Shultz ◽  
Marcel Montrey ◽  
Lucy M. Aplin
Keyword(s):  
Diffusion Of Innovation ◽  
Group Dynamics ◽  
Equation Model ◽  
Theoretical Computer Science ◽  
Wild Birds ◽  
Social Conformity ◽  
Differential Equation Model ◽  
Theoretical Computer ◽  
Agent Based ◽  
Approximate Majority

We apply three plausible algorithms in agent-based computer simulations to recent experiments on social learning in wild birds. Although some of the phenomena are simulated by all three learning algorithms, several manifestations of social conformity bias are simulated by only the approximate majority (AM) algorithm, which has roots in chemistry, molecular biology and theoretical computer science. The simulations generate testable predictions and provide several explanatory insights into the diffusion of innovation through a population. The AM algorithm's success raises the possibility of its usefulness in studying group dynamics more generally, in several different scientific domains. Our differential-equation model matches simulation results and provides mathematical insights into the dynamics of these algorithms.

scholarly journals On Approximate Majority and Probabilistic Time

2009 ◽  
Vol 18 (3) ◽  
pp. 337-375 ◽  
Author(s):  
Emanuele Viola
Keyword(s):  
Approximate Majority

scholarly journals The Cell Cycle Switch Computes Approximate Majority

2012 ◽  
Vol 2 (1) ◽  
Author(s):  
Luca Cardelli ◽  
Attila Csikász-Nagy
Keyword(s):  
Cell Cycle ◽  
Approximate Majority

scholarly journals Robust finite automata in stochastic chemical reaction networks

2021 ◽  
Vol 8 (12) ◽  
Author(s):  
David Arredondo ◽  
Matthew R. Lakin
Keyword(s):  
Finite Automata ◽  
Chemical Species ◽  
State Transitions ◽  
Biomolecular Systems ◽  
Current State ◽  
Input Signals ◽  
Finite State ◽  
The Face ◽  
Approximate Majority ◽  
Control Circuits

Finite-state automata (FSA) are simple computational devices that can nevertheless illustrate interesting behaviours. We propose that FSA can be employed as control circuits for engineered stochastic biological and biomolecular systems. We present an implementation of FSA using counts of chemical species in the range of hundreds to thousands, which is relevant for the counts of many key molecules such as mRNAs in prokaryotic cells. The challenge here is to ensure a robust representation of the current state in the face of stochastic noise. We achieve this by using a multistable approximate majority algorithm to stabilize and store the current state of the system. Arbitrary finite state machines can thus be compiled into robust stochastic chemical automata. We present two variants: one that consumes its input signals to initiate state transitions and one that does not. We characterize the state change dynamics of these systems and demonstrate their application to solve the four-bit binary square root problem. Our work lays the foundation for the use of chemical automata as control circuits in bioengineered systems and biorobotics.

Approximate majority analyses using tri-molecular chemical reaction networks

2019 ◽  
Vol 19 (1) ◽  
pp. 249-270 ◽  
Author(s):  
Anne Condon ◽  
Monir Hajiaghayi ◽  
David Kirkpatrick ◽  
Ján Maňuch
Keyword(s):  
Chemical Reaction ◽  
Chemical Reaction Networks ◽  
Reaction Networks ◽  
Approximate Majority

scholarly journals A simple population protocol for fast robust approximate majority

2008 ◽  
Vol 21 (2) ◽  
pp. 87-102 ◽  
Author(s):  
Dana Angluin ◽  
James Aspnes ◽  
David Eisenstat
Keyword(s):  
Population Protocol ◽  
Approximate Majority
Sign in / Sign up

Export Citation Format

Share Document