2 papers
cs.GT2026
Entropy Bounds for Local Coordination and Graph Amenability
Ron Peretz, Dean Kraizberg
We study local pure coordination games on finite graphs. In these games, each vertex must choose one of two symmetric actions using only local information, and the cost is the aver…
math.PR2025
The edge-averaging process on graphs with random initial opinions
Dor Elboim, Yuval Peres, Ron Peretz
In several settings (e.g., sensor networks and social networks), nodes of a graph are equipped with initial opinions, and the goal is to estimate the average of these opinions usin…