Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proves Cheeger inequalities for persistent up p-Laplacians on complex inclusions, with reductions for pseudomanifolds and comparisons to graph cases.
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.