Develops an FPRAS for consensus probabilities in voter models with agnostic nodes by combining martingale analysis with rumour-spreading bounds and MCMC estimation.
Distributed Computing 34, 3 (2021), 207–225
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Voter Model Meets Rumour Spreading: an FPRAS for Consensus Probabilities on Voter Models with Agnostic Nodes
Develops an FPRAS for consensus probabilities in voter models with agnostic nodes by combining martingale analysis with rumour-spreading bounds and MCMC estimation.