The expected time until opinions on an n-vertex graph differ by at most ε is Õ(n^{max(3-p,2/p)}) when each initial opinion has L^p norm at most 1, and this scaling is tight on cycles.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Edge-averaging dynamics on finite graphs: moment dependence
The expected time until opinions on an n-vertex graph differ by at most ε is Õ(n^{max(3-p,2/p)}) when each initial opinion has L^p norm at most 1, and this scaling is tight on cycles.