Abstract
In this paper, we study consensus behavior based on the local application of the majority consensus algorithm (a generalization of the majority rule) over four-connected bi-dimensional networks. In this context, we characterize theoretically every four-vicinity network in its capacity to reach consensus (every individual at the same opinion) for any initial configuration of binary opinions. Theoretically, we determine all regular grids with four neighbors in which consensus is reached and in which ones not. In addition, in those instances in which consensus is not reached, we characterize statistically the proportion of configurations that reach spurious fixed points from an ensemble of random initial configurations. Using numerical simulations, we also analyze two observables of the system to characterize the algorithm: (1) the quality of the achieved consensus, that is if it respects the initial majority of the network; and (2) the consensus time, measured as the average amount of steps to reach convergence.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
