Impact of network randomness on multiple opinion dynamics

January 07, 2018 Β· Declared Dead Β· πŸ› Physica A: Statistical Mechanics and its Applications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Vivian Dornelas, Marlon Ramos, Celia Anteneodo arXiv ID 1801.02184 Category physics.soc-ph Cross-listed cs.SI Citations 8 Venue Physica A: Statistical Mechanics and its Applications Last Checked 3 months ago
Abstract
People often face the challenge of choosing among different options with similar attractiveness. To study the distribution of preferences that emerge in such situations, a useful approach is to simulate opinion dynamics on top of complex networks, composed by nodes (individuals) and their connections (edges), where the state of each node can be one amongst several opinions including the undecided state. We use two different dynamics rules: the one proposed by Travieso-Fontoura (TF) and the plurality rule (PR), which are paradigmatic of outflow and inflow dynamics, respectively. We are specially interested in the impact of the network randomness on the final distribution of opinions. For that purpose, we consider Watts-Strogatz networks, which possess the small-world property, and where randomness is controlled by a probability $p$ of adding random shortcuts to an initially regular network. Depending on the value of $p$, the average connectivity $\langle k \rangle$, and the initial conditions, the final distribution can be basically (i) consensus, (ii) coexistence of different options, or (iii) predominance of indecision. We find that, in both dynamics, the predominance of a winning opinion is favored by increasing the number of reconnections (shortcuts), promoting consensus. In contrast to the TF case, in the PR dynamics, a fraction of undecided nodes can persist in the final state. In such cases, a maximum number of undecided nodes occurs within the small-world region, due to ties in the decision group.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted