Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userReaching Agreement in Competitive Microbial Systems
56
0
0.0
(
0
)
Added by
Joel Rybicki
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this work, we consider distributed agreement tasks in microbial distributed systems under stochastic population dynamics and competitive interactions. We examine how competitive exclusion can be used to solve distributed agreement tasks in the microbial setting. To this end, we develop a new technique for analyzing the time to reach competitive exclusion in systems with two competing species under biologically realistic population dynamics. We use this technique to analyze a protocol that exploits competitive interactions to solve approximate majority consensus efficiently in microbial systems. To corroborate our analytical results, we use computer simulations to show that these consensus dynamics occur within practical time scales.
rate research
Read More
We consider a basic quantum hybrid network model consisting of a number of nodes each holding a qubit, for which the aim is to drive the network to a consensus in the sense that all qubits reach a common state. Projective measurements are applied serving as control means, and the measurement results are exchanged among the nodes via classical communication channels. We show how to carry out centralized optimal path planning for this network with all-to-all classical communications, in which case the problem becomes a stochastic optimal control problem with a continuous action space. To overcome the computation and communication obstacles facing the centralized solutions, we also develop a distributed Pairwise Qubit Projection (PQP) algorithm, where pairs of nodes meet at a given time and respectively perform measurements at their geometric average. We show that the qubit states are driven to a consensus almost surely along the proposed PQP algorithm, and that the expected qubit density operators converge to the average of the networks initial values.
Microbial electrolysis cells (MECs) employ electroactive bacteria to perform extracellular electron transfer, enabling hydrogen generation from biodegradable substrates. In previous work, we developed and analyzed a differential-algebraic equation (DAE) model for MECs. The model resembles a chemostat with ordinary differential equations (ODEs) for concentrations of substrate, microorganisms, and an extracellular mediator involved in electron transfer. There is also an algebraic constraint for electric current and hydrogen production. Our goal is to determine the outcome of competition between methanogenic archaea and electroactive bacteria, because only the latter contribute to electric current and resulting hydrogen production. We investigate asymptotic stability in two industrially releva
Microbial dormancy is an evolutionary trait that has emerged independently at various positions across the tree of life. It describes the ability of a microorganism to switch to a metabolically inactive state that can withstand unfavorable conditions. However, maintaining such a trait requires additional resources that could otherwise be used to increase e.g. reproductive rates. In this paper, we aim for gaining a basic understanding under which conditions maintaining a seed bank of dormant individuals provides a fitness advantage when facing resource limitations and competition for resources among individuals (in an otherwise stable environment). In particular, we wish to understand when an individual with a dormancy trait can invade a resident population lacking this trait despite having a lower reproduction rate than the residents. To this end, we follow a stochastic individual-based approach employing birth-and-death processes, where dormancy is triggered by competitive pressure for resources. In the large-population limit, we identify a necessary and sufficient condition under which a complete invasion of mutants has a positive probability. Further, we explicitly determine the limiting probability of invasion and the asymptotic time to fixation of mutants in the case of a successful invasion. In the proofs, we observe the three classical phases of invasion dynamics in the guise of Coron et al. (2017, 2019).
In this paper we will present the Multidimensional Byzantine Agreement (MBA) Protocol, a leaderless Byzantine agreement protocol defined for complete and synchronous networks that allows a network of nodes to reach consensus on a vector of relevant information regarding a set of observed events. The consensus process is carried out in parallel on each component, and the output is a vector whose components are either values with wide agreement in the network (even if no individual node agrees on every value) or a special value $bot$ that signals irreconcilable disagreement. The MBA Protocol is probabilistic and its execution halts with probability 1, and the number of steps necessary to halt follows a Bernoulli-like distribution. The design combines a Multidimensional Graded Consensus and a Multidimensional Binary Byzantine Agreement, the generalization to the multidimensional case of two protocols by Micali and Feldman. We prove the correctness and security of the protocol assuming a synchronous network where less than a third of the nodes are malicious.
Consider a distributed system with $n$ processors out of which $f$ can be Byzantine faulty. In the approximate agreement task, each processor $i$ receives an input value $x_i$ and has to decide on an output value $y_i$ such that - the output values are in the convex hull of the non-faulty processors input values, - the output values are within distance $d$ of each other. Classically, the values are assumed to be from an $m$-dimensional Euclidean space, where $m ge 1$. In this work, we study the task in a discrete setting, where input values with some structure expressible as a graph. Namely, the input values are vertices of a finite graph $G$ and the goal is to output vertices that are within distance $d$ of each other in $G$, but still remain in the graph-induced convex hull of the input values. For $d=0$, the task reduces to consensus and cannot be solved with a deterministic algorithm in an asynchronous system even with a single crash fault. For any $d ge 1$, we show that the task is solvable in asynchronous systems when $G$ is chordal and $n > (omega+1)f$, where $omega$ is the clique number of~$G$. In addition, we give the first Byzantine-tolerant algorithm for a variant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact variants of these and related tasks over a large class of combinatorial structures.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
