Local Certification of Majority Dynamics

09/04/2023
βˆ™
by   Diego Maldonado, et al.
βˆ™
0
βˆ™

In majority voting dynamics, a group of n agents in a social network are asked for their preferred candidate in a future election between two possible choices. At each time step, a new poll is taken, and each agent adjusts their vote according to the majority opinion of their network neighbors. After T time steps, the candidate with the majority of votes is the leading contender in the election. In general, it is very hard to predict who will be the leading candidate after a large number of time-steps. We study, from the perspective of local certification, the problem of predicting the leading candidate after a certain number of time-steps, which we call Election-Prediction. We show that in graphs with sub-exponential growth Election-Prediction admits a proof labeling scheme of size π’ͺ(log n). We also find non-trivial upper bounds for graphs with a bounded degree, in which the size of the certificates are sub-linear in n. Furthermore, we explore lower bounds for the unrestricted case, showing that locally checkable proofs for Election-Prediction on arbitrary n-node graphs have certificates on Ξ©(n) bits. Finally, we show that our upper bounds are tight even for graphs of constant growth.

READ FULL TEXT
research
βˆ™ 09/11/2023

Testing Spreading Behavior in Networks with Arbitrary Topologies

Inspired by the works of Goldreich and Ron (J. ACM, 2017) and Nakar and ...
research
βˆ™ 11/19/2019

Majority dynamics and the median process: connections, convergence and some new conjectures

We consider the median dynamics process in general graphs. In this model...
research
βˆ™ 09/28/2022

From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds

Due to the more complicated population dynamics of the NSGA-II, none of ...
research
βˆ™ 09/08/2022

Consensus on Dynamic Stochastic Block Models: Fast Convergence and Phase Transitions

We introduce two models of consensus following a majority rule on time-e...
research
βˆ™ 02/18/2020

Quasi-majority Functional Voting on Expander Graphs

Consider a distributed graph where each vertex holds one of two distinct...
research
βˆ™ 05/16/2020

Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks

The asynchronous rumor algorithm spreading propagates a piece of informa...
research
βˆ™ 05/03/2023

Random Schreier graphs of the general linear group over finite fields and expanders

In this paper we discuss potentially practical ways to produce expander ...

Please sign up or login with your details

Forgot password? Click here to reset