Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.
Lawler and Alan D
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
For 1<p<∞, ||D||_{ℓ^p→ℓ^p}=1 if and only if Θ(D^*D)=1, where Θ is the maximal average mass of any finite square submatrix.
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.
-
Norm of infinite doubly stochastic matrices
For 1<p<∞, ||D||_{ℓ^p→ℓ^p}=1 if and only if Θ(D^*D)=1, where Θ is the maximal average mass of any finite square submatrix.