2012
DOI: 10.1103/physreve.86.061134
|View full text |Cite
|
Sign up to set email alerts
|

Analytic treatment of tipping points for social consensus in large random networks

Abstract: We introduce a homogeneous pair approximation to the naming game (NG) model by deriving a six-dimensional Open Dynamics Engine (ODE) for the two-word naming game. Our ODE reveals the change in dynamical behavior of the naming game as a function of the average degree {k} of an uncorrelated network. This result is in good agreement with the numerical results. We also analyze the extended NG model that allows for presence of committed nodes and show that there is a shift of the tipping point for social consensus … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

3
26
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(29 citation statements)
references
References 21 publications
3
26
0
Order By: Relevance
“…This result was shown to be largely independent of the structure of the model interactions within society but can be determined by as much as 10% to as little as 4% for a sparse network10. The percentage at which the tipping point (critical point of a phase transition) occurs is clearly model dependent and can vary from 4 to 15%1112.…”
mentioning
confidence: 91%
“…This result was shown to be largely independent of the structure of the model interactions within society but can be determined by as much as 10% to as little as 4% for a sparse network10. The percentage at which the tipping point (critical point of a phase transition) occurs is clearly model dependent and can vary from 4 to 15%1112.…”
mentioning
confidence: 91%
“…For a general social system of the above type, we can obtain a similar ODE system using exactly the same approach as in Ref. 6. The type of a link in this ODEs is ultimately given by the opinions or node-spins of its two ends (γ i − γ j ) regardless of the order but it is more convenient to work with link-based macrostates; a transformation between the link-based macrostate and the nodebased macrostate n is given in Ref.…”
Section: Monotonicity On Sparse Random Networkmentioning
confidence: 99%
“…The type of a link in this ODEs is ultimately given by the opinions or node-spins of its two ends (γ i − γ j ) regardless of the order but it is more convenient to work with link-based macrostates; a transformation between the link-based macrostate and the nodebased macrostate n is given in Ref. 6. Changes of l come from two parts: the direct change and the related change.…”
Section: Monotonicity On Sparse Random Networkmentioning
confidence: 99%
See 2 more Smart Citations