2020
DOI: 10.1007/978-3-030-54921-3_15
|View full text |Cite
|
Sign up to set email alerts
|

Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions

Abstract: In several real Multi-Agent Systems (MAS), it has been observed that only weaker forms of metastable consensus are achieved, in which a large majority of agents agree on some opinion while other opinions continue to be supported by a (small) minority of agents. In this work, we take a step towards the investigation of metastable consensus for complex (non-linear) opinion dynamics by considering the famous Undecided-State dynamics in the binary setting, which is known to reach consensus exponentially faster tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
11
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
2
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(13 citation statements)
references
References 35 publications
2
11
0
Order By: Relevance
“…We consider the dynamics in the binary opinion case over the fully connected network. We introduce in the process an uniform communication noise feature, following the definition in [17] and for which we give an equivalent formulation: for each communication with a sampled neighbor, there is probability p ∈ (0, 1) that it is noisy, i.e. the received opinion is sampled u.a.r.…”
Section: Our Results and Their Consequencesmentioning
confidence: 99%
See 4 more Smart Citations
“…We consider the dynamics in the binary opinion case over the fully connected network. We introduce in the process an uniform communication noise feature, following the definition in [17] and for which we give an equivalent formulation: for each communication with a sampled neighbor, there is probability p ∈ (0, 1) that it is noisy, i.e. the received opinion is sampled u.a.r.…”
Section: Our Results and Their Consequencesmentioning
confidence: 99%
“…Instead, with probability 1 − p the communication is unaffected by noise. As shown in [17], this noise model (over the complete network) is equivalent to a model without any communication noise and where two communities of stubborn agents (that is, they never change opinion) of equal size pn 2(1−p) are present in the network, where each of the two community holds a different opinion. Even though the complete graph is a strong assumption for such communication networks, we remark that, at every round, an agent pulls an opinion from three neighbors: therefore, the round-per-round communication pattern results is a dynamic graph with O (n) edges.…”
Section: Our Results and Their Consequencesmentioning
confidence: 99%
See 3 more Smart Citations