scientific article; zbMATH DE number 6851888
From MaRDI portal
Publication:4608618
Recommendations
- On approximate majority and probabilistic time
- The consensus times of the majority vote process on a torus
- The majority vote process and other consensus processes on trees
- On randomized algorithms for the majority problem
- A correspondence between voting procedures and stochastic orderings
- К оценке эффективности голосующих процедур
- The Average-Case Complexity of Determining the Majority
- On some generalizations of a mean voter theorem
- Time-space trade-offs in population protocols for the majority problem
Cited in
(13)- The r-majority vote action on 0-1 sequences
- Opinion forming in Erdős-Rényi random graph and expanders
- Convergence in (social) influence networks
- How long does it take for all users in a social network to choose their communities?
- Stabilization Time in Weighted Minority Processes
- A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion
- On approximate majority and probabilistic time
- Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
- Quasi-majority functional voting on expander graphs
- A general stabilization bound for influence propagation in graphs
- Testing spreading behavior in networks with arbitrary topologies
- Opinion diffusion in graphs: an adversarial approach
- On the complexity of reasoning about opinion diffusion under majority dynamics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608618)