Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.
Cover time and mixing time of random walks on dynamic graphs.Random Struct
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.