For any finite tree with odd degrees, the exact worst-case stabilization time is characterized; with random initial opinions on perfect binary trees, stabilization takes about D/4 to D/3 time with high probability, where D is the diameter.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Majority dynamics on finite trees
For any finite tree with odd degrees, the exact worst-case stabilization time is characterized; with random initial opinions on perfect binary trees, stabilization takes about D/4 to D/3 time with high probability, where D is the diameter.