Abstract

We study the binary q-voter model with generalized anticonformity on random Erdős–Rényi graphs. In such a model, two types of social responses, conformity and anticonformity, occur with complementary probabilities and the size of the source of influence q_c in case of conformity is independent from the size of the source of influence q_a in case of anticonformity. For q_c=q_a=q the model reduces to the original q-voter model with anticonformity. Previously, such a generalized model was studied only on the complete graph, which corresponds to the mean-field approach. It was shown that it can display discontinuous phase transitions for q_c ge q_a + Delta q, where Delta q=4 for q_a le 3 and Delta q=3 for q_a>3. In this paper, we pose the question if discontinuous phase transitions survive on random graphs with an average node degree langle krangle le 150 observed empirically in social networks. Using the pair approximation, as well as Monte Carlo simulations, we show that discontinuous phase transitions indeed can survive, even for relatively small values of langle krangle. Moreover, we show that for q_a < q_c - 1 pair approximation results overlap the Monte Carlo ones. On the other hand, for q_a ge q_c - 1 pair approximation gives qualitatively wrong results indicating discontinuous phase transitions neither observed in the simulations nor within the mean-field approach. Finally, we report an intriguing result showing that the difference between the spinodals obtained within the pair approximation and the mean-field approach follows a power law with respect to langle krangle, as long as the pair approximation indicates correctly the type of the phase transition.

Highlights

  • We investigated the q-voter model with generalized anticonformity on random graphs via Monte Carlo simulations, as well as pair approximation

  • As within mean-field approach (MFA), discontinuous phase transitions appear only if the size of the influence group qc needed for conformity is sufficiently larger than the size of the influence group qa needed for anticonformity, precisely for qa ≤ qc − 3

  • pair approximation (PA) gives results in agreement with Monte Carlo simulations in the case of qa < qc − 1 for any value of qa

Read more

Summary

Pair approximation

We considered the model on the complete graph, for which the MFA gives exact ­results[7]. The probability to choose randomly an up-spin at time t in the neighborhood of node x is just equivalent to c(t). This assumption is strictly valid only for the complete graph. . .) depends on a given model and its parameters, since it describes the flipping probability of a node in a given state. As the total number of neighbors with opposite opinions is equal to the number of active links i of a given voter and the group of influence is chosen without repetition, the flipping probability takes the following form.

Monte Carlo results
Summary
Author contributions
Additional information
Full Text
Published version (Free)

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 call