Approximate majority analyses using tri-molecular chemical reaction networks

被引:11
作者
Condon, Anne [1 ]
Hajiaghayi, Monir [1 ]
Kirkpatrick, David [1 ]
Manuch, Jan [1 ]
机构
[1] Univ British Columbia, Dept Comp Sci, Vancouver, BC, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Approximate Majority; Chemical reaction networks; Population protocols; COMPUTATION; CONSENSUS;
D O I
10.1007/s11047-019-09756-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Approximate Majority is a well-studied problem in the context of chemical reaction networks (CRNs) and their close relatives, population protocols: Given a mixture of two types of species with an initial gap between their counts, a CRN computation must reach consensus on the majority species. Angluin, Aspnes, and Eisenstat proposed a simple population protocol for Approximate Majority and proved correctness and Oolog nTHORN time efficiency with high probability, given an initial gap of size xo ffiffiffinp log nTHORN when the total molecular count in the mixture is n. Motivated by their intriguing but complex proof, we provide a new analysis of several CRNs for Approximate Majority, starting with a very simple trimolecular protocol with just two reactions and two species. We obtain simple analyses of three bi-molecular protocols, including that of Angluin et al., by showing how they emulate the tri-molecular protocol. Our results improve on those of Angluin et al. in that they hold even with an initial gap of Xo root n log n log np THORN. We prove that our tri-molecular CRN is robust even when there is some uncertainty in the reaction rates, when some molecules are Byzantine (i.e., adversarial), or when activation of molecules is triggered by epidemic. We also analyse a natural variant of our tri-molecular protocol for the more general problem of multi-valued consensus. Our analysis approach, which leverages the simplicity of a tri-molecular CRN to ultimately reason about these many variants, may be useful in analysing other CRNs too.
引用
收藏
页码:249 / 270
页数:22
相关论文
共 23 条
[1]  
Alistarh D, 2017, PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P2560
[2]   Computation in networks of passively mobile finite-state sensors [J].
Angluin, D ;
Aspnes, J ;
Diamadi, Z ;
Fischer, MJ ;
Peralta, R .
DISTRIBUTED COMPUTING, 2006, 18 (04) :235-253
[3]   A simple population protocol for fast robust approximate majority [J].
Angluin, Dana ;
Aspnes, James ;
Eisenstat, David .
DISTRIBUTED COMPUTING, 2008, 21 (02) :87-102
[4]  
Angluin D, 2006, LECT NOTES COMPUT SC, V4167, P61
[5]  
[Anonymous], 1997, Stochastic Processes in Physics and Chemistry
[6]  
[Anonymous], DISTRIB COMPUT
[7]  
[Anonymous], 1968, An Introduction to Probability Theory and Its Applications
[8]  
Becchetti Luca, 2016, Proc. 27th Annu. ACMSIAM Symp. Discret. Algorithms (SODA), DOI DOI 10.1137/1.9781611974331.CH46
[9]  
Cardelli Luca, 2016, DNA Computing and Molecular Programming. 22nd International Conference, DNA 22. Proceedings: LNCS 9818, P35, DOI 10.1007/978-3-319-43994-5_3
[10]   The Cell Cycle Switch Computes Approximate Majority [J].
Cardelli, Luca ;
Csikasz-Nagy, Attila .
SCIENTIFIC REPORTS, 2012, 2