A simple population protocol for fast robust approximate majority
From MaRDI portal
Recommendations
- A Simple Population Protocol for Fast Robust Approximate Majority
- Fast and exact majority in population protocols
- scientific article; zbMATH DE number 6850453
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
Cites work
- scientific article; zbMATH DE number 5605125 (Why is no real title available?)
- scientific article; zbMATH DE number 3729228 (Why is no real title available?)
- scientific article; zbMATH DE number 52077 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- Computation in networks of passively mobile finite-state sensors
- Differential equations for random processes and random graphs
- Fast Computation by Population Protocols with a Leader
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- The computational power of population protocols
Cited in
(57)- Noisy rumor spreading and plurality consensus
- Synthesizing and tuning chemical reaction networks with specified behaviours
- Passively mobile communicating machines that use restricted space
- Distributed computation with continual population growth
- Distributed computation with continual population growth
- Fault-tolerant simulation of population protocols
- Majority consensus thresholds in competitive Lotka-Volterra populations
- Game dynamics and equilibrium computation in the population protocol model
- Constant-space population protocols for uniform bipartition
- Approximate majority analyses using tri-molecular chemical reaction networks
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Verifying polymer reaction networks using bisimulation
- Step-by-step community detection in volume-regular graphs
- Data Collection in Population Protocols with Non-uniformly Random Scheduler
- Uniform bipartition in the population protocol model with arbitrary graphs
- Computing threshold circuits with void reactions in step chemical reaction networks
- Modular verification of chemical reaction network encodings via serializability analysis
- Mediated population protocols
- Polylogarithmic-time leader election in population protocols
- Computing threshold circuits with bimolecular void reactions in step chemical reaction networks
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- Loosely-stabilizing leader election in a population protocol model
- ppsim: a software package for efficiently simulating and visualizing population protocols
- Asynchronous opinion dynamics in social networks
- scientific article; zbMATH DE number 7651155 (Why is no real title available?)
- Fast and exact majority in population protocols
- Complete graph identification in population protocols
- Population-induced phase transitions and the verification of chemical reaction networks
- Robust biomolecular finite automata
- Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions
- Simple dynamics for plurality consensus
- Space-optimal proportion consensus with population protocols
- Fast computation by population protocols with a leader
- Modular verification of DNA strand displacement networks via serializability analysis
- Verifying chemical reaction network implementations: a bisimulation approach
- Verifying chemical reaction network implementations: a bisimulation approach
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Message complexity of population protocols
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- Distributed Averaging in Opinion Dynamics
- Data collection in population protocols with non-uniformly random scheduler
- A Simple Population Protocol for Fast Robust Approximate Majority
- Chemical reaction network designs for asynchronous logic circuits
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Speed faults in computation by chemical reaction networks
- Early adapting to trends: self-stabilizing information spread using passive communication
- Simplifying analyses of chemical reaction networks for approximate majority
- Chemical reaction network designs for asynchronous logic circuits
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Phase transition of the k-majority dynamics in biased communication models
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- Determining majority in networks with local interactions and very small local memory
- Time-space trade-offs in population protocols for the majority problem
- Limits for rumor spreading in stochastic populations
- A tight analysis of the parallel undecided-state dynamics with two colors
- Computing with biological switches and clocks
- TTLed random walks for collaborative monitoring in mobile and social networks
This page was built for publication: A simple population protocol for fast robust approximate majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352239)
