We consider the median dynamics process in general graphs. In this model, each vertex has an independent initial opinion uniformly distributed in the interval [0,1] and, with rate one, updates its opinion to coincide with the median of its neighbors. This process provides a continuous analog of binary majority dynamics. We deduce properties of median dynamics through this connection and raise new conjectures regarding the behavior of majority dynamics on general graphs. We also prove these conjectures on some graphs where majority dynamics has a simple description.
|Number of pages||22|
|Journal||Stochastic Processes and their Applications|
|State||Published - Jan 2023|
Bibliographical noteFunding Information:
This work was supported by the Israel Science Foundation through grant 575/16 and by the German Israeli Foundation through grant I-1363-304.6/2016 . We thank Idan Alter for providing us with the simulations in Section 5 .
- Majority dynamics
- Median process