Not checkedNot checked for notices yet.
Majority networks and local consensus algorithm
Eric Goles, Pablo Medina, Julio Santiváñez
Scientific Reports · 2023
doi:10.1038/s41598-023-28835-2 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY-NC-ND
References35
35 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.