Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.
Distributed probabilistic polling and applications to proportionate agreement.Information and Computation, 171(2):248–268, 2001
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Develops an FPRAS for consensus probabilities in voter models with agnostic nodes by combining martingale analysis with rumour-spreading bounds and MCMC estimation.
citing papers explorer
-
Temporal Conductance and Bounds on the Voter Model for Dynamic Networks
Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.
-
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.