Complex contagion in social systems with distrust
Abstract
Social systems are characterized by the presence of group interactions and by the existence of both trust and distrust relations. Although there is a wide literature on signed social networks, where positive signs associated to the links indicate trust, friendship, agreement, while negative signs represent distrust, antagonism, and disagreement, very little is known about the effect that signed interactions can have on the spreading of social behaviors when, not only pairwise, but also higher-order interactions are taken into account. In this paper we focus on processes of complex contagion, such as the adoption of social norms or the diffusion of novelties, where exposure to multiple sources is needed for the contagion to occur. Complex contagion has been recently modeled, at a microscopic scale, by higher-order networks, such as simplicial complexes, which allow transmission to happen not only through the links connecting pair of nodes, but also in group interactions, namely over simplices of dimension larger or equal than two. Here, we introduce a model of complex contagion on signed simplicial complexes, and we investigate the role played by trust and distrust on the dynamics of a social contagion process. The presence of higher-order signed structures in our model naturally induces new infection and recovery mechanisms, thus increasing the richness of the contagion dynamics. Through numerical simulations and analytical results in the mean-field approximation, we show how distrust determines the way the system moves from a state where no individuals adopt the social behavior, to a state where a finite fraction of the population actively spreads it. Interestingly, we observe that the fraction of spreading individuals displays a non-monotonic dependence on the average number of connections between individuals. We then investigate how social balance affects social contagion, finding that balanced triads have an ambivalent impact on the spreading process, either promoting or impeding contagion based on the relative abundance of fully trusted relations. Our results shed light on the nontrivial effect of trust on the spreading of social behaviors in systems with group interactions, paving the way to further investigations of spreading phenomena in structured populations.
I Introduction
Contagion is the process through which a disease, an opinion, a behavior or a technological innovation spreads in a population of interacting individuals [1]. While some spreading processes only require a single exposure for a contagion to occur, others are only triggered by multiple exposures. In the first case, the spreading process is referred to as simple contagion, while in the latter case it is known as complex contagion [2]. The spread of an infectious disease in a population is a typical example of a simple contagion [3], while the propagation of a social behavior, such as the adoption of a social norm, of an opinion, or even a novel item can be characterized either as a simple [4] or a complex contagion [5]. In particular in social contagion there are cases where the individuals/agents of a social system can either accept or refuse transmission, based on the type of their social interactions, instead of just passively receive it as in the case of a virus [6].
The spread of a social behavior in a population is utterly determined by the precise patterns of interactions among individuals. Usually, the structure of contacts in a social system is mathematically modeled as a graph, whose nodes represent the individuals, the social agents, while the edges encode for their pairwise interactions [7]. Without surprise thus, the contagion process is shaped by the structure of such graph, for instance by its modular organization, the existence of short paths, weak ties or influential nodes [8, 9, 10, 11]. Complex contagion on networks has been notably analyzed using threshold models, where a susceptible individual becomes infected if a sufficiently large fraction of its neighbors is infected [12, 13].
Although network science provides powerful tools to model dynamical processes in social systems, the network approach has strong limitations in dealing with group interactions. The latter are indeed a fundamental ingredient of social systems and result to be a main driver for social contagion [14]. As a consequence, last years have seen a growing interest in higher-order networks, namely mathematical structures generalizing complex networks and accounting for group interactions [15, 16, 17, 18, 19]. Recent works on social contagion on higher-order networks have demonstrated that peer pressure and group reinforcement can induce novel phenomena, such as the appearance of abrupt phase transitions and bistability [14, 20, 21, 22, 23, 24, 25]. One aspect that still has not been considered and explored exhaustively is the role that trust/distrust can have on the diffusion of a novel idea or item, or in the adoption of a social norm. Trust among individuals is a key driver of contagion in social systems: agents are more prone to adopt a novel behavior if it comes from trusted sources. Moreover, infected agents, i.e., agents having adopted a given item, when they interact with other infected agents that they do not trust, can decide to stop adopting the item. The rationale behind the latter process is that two agents that distrust each other would not be inclined to share the same item. Some researches have already started to investigate the impact of trust on social contagion and epidemic spreading on networks [26, 27, 28], but no work has yet considered contagion processes on signed higher-order networks.
In this paper we propose a model of complex contagion on signed higher-order networks, which allows to investigate the impact of trust and distrust among individuals on the spread of contagion in a social system, by properly taking into account interactions in groups of two or more individuals at the microscopic level. Our model is inspired by the model of complex contagion on simplicial complexes proposed in Ref. [14]. Indeed, as the underlying structure of the social system we consider a simplicial complex instead of a network. A simplicial complex is a made not only by nodes and by links connecting pairs of nodes, and representing pairwise interactions between individuals, but also by more complex objects, which represent interactions in groups of more than two individuals. We then extend the model of Ref. [14] by introducing positive and negative signs over the links of the simplicial complex. It is however a common experience that the trust/distrust relations existing between two individuals can change once the two individuals are interacting into a group of larger size. For this reason we propose and analyze two variants of our social contagion model. In the first version of the model we assume that the signs of the pairwise interactions remain the same also in higher-order interactions. In the second one, we relax such an assumption allowing agents to exhibit pairwise trust/distrust relations different from those experienced in groups involving more than two individuals. Namely, in order to determine the distribution of signed relations in a group interactions, we recur to social balance theory [29, 30, 31, 32, 33]. According to this theory a group of three individuals, a triad, is balanced when there is an odd number of relations among them. Thus we have two distinct balanced configurations that can be interpreted either as “the friend of my friend is my friend” in case of three trust relations, or “the enemy of my enemy is my friend” in presence of a single trust relation. Both of these configurations ensure the consistency of the members’ attitude with respect to each other. At contrast, a triad in which there is an even number of trust relations leads unavoidably to some kind of frustration among the individuals in the triad as it implies that the “friend of my friend is my enemy” or that “the enemy of my enemy is my enemy”, both cases being unwanted by its members. For this reason we expect these types of triads to appear less frequently.
With the first version of our model, we show how the level of distrust in the social network determines the nature of the transition, i.e., continuous or discontinuous, from a state where no individual adopts the social behavior, i.e., disease-free state, to a regime where a fraction of agents spread it, i.e., to an endemic state. Particularly, we show that the size of the endemic state can be a non-monotonic function of the average node degree, depending of the level of distrust in the population. With the second version of the model, we analyze the ambivalent role of social balance, showing that simplicial complexes where balanced triads are overrepresented compared to the random case can either promote or impede contagion. We corroborate our findings by comparing the mean-field predictions to stochastic simulations performed by using a Gillespie algorithm [34]. In the framework of social balance theory, namely the second proposed model, we show that a structurally balanced network - a network in which balanced triads are overrepresented compared to the random case - can either promote or impede contagion. In particular, we find that the abundance of triangles with three positive signs enhances the emergence of a bistable regime and thus lets the system easily switch to an endemic state. We also show that the other balanced configuration, i.e., two negative signs, induces instead the opposite behavior. Similar results are also presented when investigating the role of unbalanced triangles.
The paper is organized as follows. In Section II, we introduce our model of complex contagion on signed simplicial complexes. In Section III, we derive the mean-field equations of the model, while in Section IV, we determine the equilibrium solutions of the system and examine their stability, assuming a random distribution of edge signs, namely under the assumption of the first model. In section V, we introduce the second version of the model, and we investigate how structural balance affects contagion. We then conclude with some future perspectives.
II Modeling social contagion with trust and distrust
In the context of pairwise interactions, trust and distrust relations between individuals are represented as links associated with signs, respectively positive or negative. Inspired by this, to model group interactions with trust or distrust we will use signed simplices. A -simplex, , is a collection of distinct nodes. With such a definition, a -simplex is a node, a -simplex is a link, corresponding to a dyadic interaction, a -simplex is a triangle, representing an interaction among three individuals, and so forth. To model trust and distrust, each node in a -simplex, , is endowed with a positive or negative sign toward each of the remaining nodes of the simplex. For simplicity, we assume (dis)trust relations to be reciprocal. Let us observe that in real social systems the existence of a (dis)trust relation between two individuals in a pairwise interaction does not imply that the same (dis)trust relation exists when a third person is involved in the interaction.
In our model, individuals are assumed to be either in an infected state, i.e., they are spreading a given social behavior, or in a susceptible state, i.e., they are not. Note that we will hereafter keep using the vocabulary of epidemic processes. In particular, we will denote endemic state the condition of the system where a positive fraction of individuals are infected, i.e., they have adopted and spread the social behavior. Also, we will refer to the threshold above which an endemic state emerges as epidemic threshold. However, compared to epidemic spreading, in our model we assume that individuals can adopt but also refuse to adopt the social behavior under study, namely because they can change their mind by interacting with others. This is impossible in the case of disease spreading.

In our model, we assume that infection and recovery processes can take place at three distinct levels, namely at the level of single individuals, i.e., -simplices, at the level of pairwise contacts, i.e., -simplices, and also at the level of three-body interactions, -simplices. To present our results in a simple and direct way, we limit our analysis here to simplices up to order . This assumption is motivated by the fact that larger interacting groups are less abundant compared to smaller groups [35]. However, our modeling approach can be straightforwardly extended to larger group sizes [20]. At the level of -simplices, we only have recovery processes, with infected individuals coming back to the susceptible state with a rate , namely they stop spreading after an average time . At the level of -simplices, two processes are at play, an infection process and a recovery one. For the infection process, a susceptible individual gets infected with a rate when interacting with a trusted infected individual (see top panel of Fig. 1). For the recovery process, if an infected individual interacting with a distrusted infected individual becomes susceptible with a rate (see bottom panel of Fig. 1). Two-body recovery processes have not been extensively adopted, with a few exceptions [36], and in our case the idea behind it is that individuals that do not trust each other are less willing to adopt and spread the same social behavior.
In the case of three-body interactions, we consider five different processes, namely three types of infections and two types of recoveries. An individual can change state by interacting with two infected individuals, with a rate that depends on the trust/distrust relations existing among the three agents. This comes from the assumption that, when interacting in group, each agent has full knowledge of all the trust/distrust relations existing among the group members. Note that this is a reasonable assumption in the case of small groups. Let us first consider the cases in which a susceptible individual, , participates in a three-body interaction with two infected ones, and (see Fig. 2).
Case 1: If all the agents trust each other, i.e., there are three “” signs in the -simplex, then the susceptible individual becomes infected with a rate .
Case 2: If trusts and but there is a distrust relation between and , can still be infected, but with a positive rate . This comes from the idea that the distrust relation existing among and can negatively influence the propensity of to adopt the social behavior.
Case 3: If a susceptible agent trusts agent but distrusts agent , while there is a trust relation between and , then becomes infected with a positive rate . As in the previous case, the presence of a distrust relation determines a decrease in the adoption rate of agent , even more than in the case of the second mechanism, as agent directly experience distrust.

We now consider the cases where three infected individuals, experiencing distrust relations, interact (see Fig. 3).
Case 4: If an agent distrusts both and , perceiving a trust relation between them, it will become susceptible with a rate .
Case 5: If the three agents distrust each other, one of them can still become susceptible, but at a smaller rate, i.e., . In both cases, the rationale is that distrust can induce doubt, pushing the agents to stop adopting the social behavior.

So far, we have described the microscopic mechanisms, occurring at the level of -simplices, underlying our model of social contagion with trust and distrust. However, the macroscopic spreading of social behaviors within a population is determined by the precise patterns of interaction among individuals. To model the complex structure of interactions in a real social systems, we rely on signed simplicial complexes. Given a set of nodes, a simplicial complex is a collection of signed simplices, with an inclusion requirement, meaning that for any simplex , all simplices are also contained in . Let us observe that the inclusion property means, for example, that if three people interact altogether, then each of them will also interact pairwise with the two others. In the following, we will denote by the fraction of -simplices (the links) with a minus sign in the simplicial complex, i.e., the fraction of dyadic relations based on distrust. Let us observe that besides the epidemic parameters and the number of trust/distrust relations, our model of social contagion will also depend on the topological features of the simplicial complex representing the interactions among the individuals, e.g., the arrangement of trust/distrust relations, the average number of and -simplices incident to a node, and so on. In the following we will focus on the impact of the distrust using mean-field equations and stochastic simulations.
III Mean-field equations
Let us now cast the microscopic mechanisms discussed so far into an ODE model for the fraction of infected agents at time . Working in a mean-field approximation that neglects -nodes correlations, we get:
(1) | |||||
where (resp. ) is the mean number of trust links, i.e. links with a “” sign (resp. distrust links, i.e. with a “” sign), which are incident in a node. We can write , and thus , where is the average node degree, and the fraction of negative links existing in the social network. For , the mean number of triangles with trust relations, i.e., “” signs, is denoted by .
The different terms in the first line of Eq. (1) respectively model (from the left to right) the standard (single-node) recovery, the infection due to a pairwise interaction between a susceptible and an infected person trusting each other, and finally the recovery of an infected agent because of a dyadic interaction involving two distrusting infected agents (i.e., the processes described in Fig. 1). The second line, again from left to right, describes a contagion due to a triadic interaction involving two infected and one susceptible agent, all trusting each other (see top panel of Fig. 2). A contagion occurring in a triadic group with two infected and one susceptible people, the latter trusting the two others who do not trust each other; the factor represents the fact that, focusing on one node, only one third of all triangles with two “” and one “” has the right configuration of signs (see middle panel of Fig. 2). Finally, a contagion due to again a triadic interaction with two infected individuals and a susceptible one, where the susceptible person trusts one person but not the other one. The factor again is due to the fact that only a fraction of such triangles has the right signs setting (see bottom panel of Fig. 2). The third line of Eq. (1) denotes the recovery of an infected person because of a triadic interaction involving three infected people, the former one distrusting the latter two, from which the factor follows. Then a recovery process involving three mutually distrusting infected people (see Fig. 3).
IV Stationary densities: existence and stability
We are now interested in finding the stationary solutions of Eq. (1) and in studying their stability. This will allow us to investigate the asymptotic behavior of our system and to draw conclusion on the conditions leading to the emergence on an endemic state. Let us start by assuming that the three agents taking part in a three-body interaction maintain the same trust and distrust relations they have in pairwise interactions, meaning that the signs of the three-body interaction are directly “inherited” from the three underlying pairs. This will allow us to draw some preliminary conclusions on the role of trust on contagion. we will then relax such an hypothesis and present a more general setting in the following section. Under this working assumption, we can write
where is the average number of -simplices incident to a node. We can thus determine the stationary solutions of the mean-field equations and their stability. Beside the disease free equilibrium , that is always a solution, there can be other two solutions given by:
(3) |
if and the parameters are such that , where and with:
(4) | |||||
(5) | |||||
(6) |
We notice that, in the special case where all agents trust each other, i.e. when , we have , and and we recover the fixed points obtained in [14]. In this case, it has been shown that the epidemic threshold is given by and that the transition at the epidemic threshold is continuous when and discontinuous otherwise; in that case the system shows bistability for an interval of values of , i.e., it admits as stable equilibria both the disease free state and the endemic state. In the following we show how the analysis can be extended to the general case where .
By rescaling time by and linearizing (2) close to the equilibrium , we can realize that the latter is stable if and only if . Hence, we find that the epidemic threshold for the disease free equilibrium is given by . Above this threshold, the infection will always spread and reach a non-zero fraction of the population, while below this threshold the infection will die out unless the fraction of initially infected nodes is sufficiently large, i.e., above a critical mass. In that case nonlinear terms might sustain the disease. Crucially, we observe that the epidemic threshold increases as becomes larger (see top panel of Fig. 4). This means that distrust can limit the spreading of the infection, as a large value of is needed to initiate the contagion process. Let us now analyze the existence and the stability of the aforementioned fixed points , as a function of .
-
•
By looking at the definition of one can realize that if then assume complex values, where as one can observe by rewriting it as follows
-
•
If and , then are real but negative, so they are not physically acceptable.
-
•
If and , then are real and positive, so they are both physically acceptable, moreover is unstable while is stable.
-
•
If , are real but is negative, thus the only physically acceptable solution is which is stable.
By considering the behavior of the solutions for large , we can prove that . In Table 1 we summarize the different asymptotic solutions of Eq. (2) and their stability as a function of the involved parameters.
The above analysis allows us to conclude that when , the prevalence of infected individuals has a discontinuous phase transition at and it is bistable for . On the other hand when , the transition from the disease-free state to the endemic state is instead continuous.
(stable) | (stable) | and (stable) | (stable) |
---|---|---|---|
(unstable) | (unstable) |
IV.1 Impact of on bistability
Results reported in Fig. 4 show that the prevalence increases with and as previously stated for unbounded values of . The mean-field predictions (curves) are compared with stochastic simulations (points) obtained by using the Gillespie algorithm; we can observe the very good agreement between the mean-field findings and the numerical ones, confirming thus the validity of the used assumptions. We refer to Appendix A for a description of the algorithm and more details about the numerical simulations.
The results shown in the figure allow us to appreciate the substantial impact that distrust has on the social contagion. First, we observe that for a given , which is above the epidemic threshold, decreases as increases. Hence, the larger is the distrust in the network the lower is the fraction of people that are infected at equilibrium. Even more interestingly, the presence of trust and distrust relationships conditions the nature of the transition from the disease-free state to the endemic one, and so the existence of a bistable regime. In particular, we observe that increasing the amount of distrust in the network makes the bistability region to shrink until it vanishes, with the transition at becoming continuous. Mathematically, this means that by tuning the value of we can shift from a case where , i.e., the bistability region exists, to one where , i.e., a bistable regime is not allowed.

IV.2 Non-monotonic behavior of the prevalence
Let us now investigate how the infection depends on the average degree . In Fig. 5, we show the prevalence as a function of the distrust for two particular values of the average node degree . The other parameters are identical to those used in Fig. 4, but . Each curve corresponds to a fixed different value of . Let us consider the blue and red curves corresponding respectively to and . The associated values of (resp. and ) are large enough so that the system is never bistable regardless of (see Fig. 4).
As we have already seen, the lower the fraction of distrust and the larger the infection. We observe that, while the prevalence is monotonic and continuous with respect to , it is non-monotonic with respect to the average connectivity . Indeed for low enough values of increasing the connectivity of the network reduces the prevalence while the opposite phenomenon takes place for large values of the distrust. Geometrically, this translates into the crossing of both curves at a particular value which can be analytically computed (see Appendix B).
This behavior apparently looks counter-intuitive. For a given value of , the only parameters changing as a function of are and . Therefore, the magnitude of the prevalence with respect to the average degree will depends on the relative strength between these two parameters, which are associated to pairwise infections and recoveries, respectively.

V The social balance theory
The model presented in the previous section is based on the assumption that agents maintain the same pairwise trust/distrust relations when they are involved in interactions in group of more than two. This assumption implies that the distribution of signed triangles depends on the fraction of negative links in the network, , and not on a peculiar combination of “” and “”. However social balance theory affirms that in a social network, the fraction of balanced triangles, i.e., triadic relations with an odd number of positive links, is larger than the one we would obtain if signs were randomly distributed [29, 30, 37]. In this section we extend the previous model in order to investigate the role of balanced and unbalanced full triangles on social contagion. This can be achieved by introducing new parameters, , where , refers to the number of positive links in the triangles, to express the excess or the deficiency of peculiar signed -simplices with respect to the case where these inherit the signs of the links. This allows us to write
(7) |
The model presented in the previous section, i.e., where all the signs were randomly attributed to the edges, can be recovered with the choice for all . If there were only balanced triangles, then , while denotes the complete absence of balanced triangles. Let us note that the parameters are not independent from each other as we must have , hence
(8) |
Let us observe that the solutions of Eq. (1) are still given by and obtained by (3), of course with new parameters , depending on the new definitions of , given by (V). The same analysis above performed concerning the existence and stability of the stationary densities can be straightforwardly adapted to the present case.
In the following, we examine how the distribution of distrust relations influences the contagion outcome. As a first analysis, we set the bias parameters relative to balanced triangles to be equal, i.e., , and we investigate the impact on the contagion of the parameters relative to unbalanced triangles, i.e., and . In Fig. 6 we show the prevalence curves for two values of , i.e., (red curve) and (blue curve), while fixing , the values of the other parameters are reported in the caption. Notice that the value of is automatically adapted as to satisfy Eq. (8). Note also that is fixed, meaning that the average number of negative links is constant. In the same Figure we compare the mean-field solution (curves) with the results of stochastic simulations performed using the Gillespie algorithm (points); the agreement is again satisfactory, the discrepancy being due to finite size effects that enhance correlations, neglected in the construction of the mean-field model (see Appendix A for more details).
We can observe two opposite behaviors. On the one hand, for small values of , the prevalence increases when reducing , i.e., decreasing the number of unbalanced triangles (the red curve is above the blue one). On the other hand, for large values of , we find on the contrary that increases as we increase (the red curve is below the blue one). This implies the existence of a value at which both curves have the same prevalence. The prevalence at the particular value can be computed explicitly (see Appendix C) and is given, by assuming , and by:
(9) |
provided the parameters to ensure the prevalence to lie into . For the parameters used in Fig. 6, we obtain .
To further investigate the crossing behavior, we construct the phase diagram of as a function of and . This is shown in the inset Fig. 6. Note that we binned the values of so to better visualise the crossing. For large values of (right of the dashed green line), the prevalence increases as we increase , while the opposite holds for small values of (left of the dashed green line). Note that the black region corresponds to the parameter set for which the disease-free state is the only stable equilibrium.
These results highlight how the effect of balanced and unbalanced triangles on the prevalence highly depends on the link infectivity of the process. As already stated, real social systems are more likely composed by balanced configurations, i.e., they are associated to low values of and . So in our analysis, we expect a contagion spreading on them to show a behavior more similar to that of the red curve. Hence, we would expect real social systems to have larger (resp. smaller) prevalence compared to random sign configurations when the infectivity is small (resp. large). This counter-intuitive behavior is due to the high nonlinearity of the contagion process, as infection and recovery mechanisms are associated to both balanced and unbalanced triangles (see Fig. 2 and 3).
Finally, we find that by tuning the bias parameter we can change the nature of the transition from the disease-free state to the endemic one. Indeed, we can observe that the system becomes bistable for low enough values of (the red curve shows bistability, while the blue curve does not).
We now allow to vary, thus studying the behavior of the system as a function of both and . Still, we assume that , with their value determined by Eq. (8). In Fig. 7, we show the phase diagram of as function of and for (left) and (right). In both panels, the white region denoted by is such that the values of and would imply which is not physically acceptable. In particular, the delimiting line of region is given by , and it corresponds to the case where no balanced triangles are present, i.e., . Coherently with the previous analysis, when is large enough (left panel), the infection increases with and . Note that the vertical dashed line represents , corresponding to the case previously studied. For , the behavior of the system with respect to and is more complex. Indeed, for small values of , the prevalence decreases as is increases, while the opposite is true for large values of .
For this latter case, we distinguish two additional zones. In zone , there is no bistability, while the latter is present in zone . The separation line between the two is found for , and takes, for the above values of the parameters, the expression, .
![]() |
![]() ![]() |
To conclude the analysis, we further investigate the impact of the particular configurations of balanced and unbalanced triangles present in the network. In particular, we first fix the values of and , namely the bias parameters for the balanced triangles, and vary and , so the bias parameters for the unbalanced configurations, then we do the opposite, fixing and , and varying and .
In the top panel of Fig. 8 we report the fraction of infected nodes as a function of and for fixed ; let us remember again that because of the constraint (8) and are not independent each other. We can observe that for a fixed , the larger , i.e., the more triangles with two positive links, the larger the final infection state. Let us emphasize that , i.e., the fraction of triangles with no positive links, impacts the system outcome in the opposite direction: the larger the value of the parameter, the smaller the fraction of infected. This comes from the fact that is associated to the three-body infection process having rates and (see Fig. 2), while is related instead to recoveries occurring at rate (see Fig. 3). Let us also observe that by increasing , and thus by decreasing , decreases and thus the system is more prone to exhibit a bistable regime. Moreover, for a given value of in the bistability region, we find that the critical amount of infected people needed to converge to the endemic state decreases as increases. Stated differently, by increasing the number of unbalanced triangles with two positive links, the system can “easily” switch to an endemic state.
In the bottom panel of Fig. 8 we show the results corresponding to a variation of , and thus , for fixed . Again the two parameters have opposite impact: by increasing (resp. ), the infection increases (resp. decreases). Similarly to the previous case, is associated to three-body infections occurring at rate , while is linked to recoveries occurring at rate . Coherently, when we increase the value of a bistable regime can emerge.


Overall these results suggest that the bias parameters strongly impact the outcome of the contagion process, both in terms of its final prevalence and of its dynamics, i.e., continuous and discontinuous transitions, in a nontrivial way. Also, our model highlights that not only the relative proportion of balanced and unbalanced triangles determines the contagion, but also the particular configurations within these two classes can have a crucial influence on the system.
VI Conclusion
In this paper we have introduced a model of complex contagion on signed higher-order networks, which has allowed us to investigate, both numerically and analytically, the combined effect of group interactions and distrust relations on the dynamics of social contagion. In our model, a social system with group interactions is represented as a signed simplicial complex, in which the edges are attributed either a “” or a “” sign to respectively denote trust or distrust between agents. In our model we have two compartments, i.e. nodes can either be in the infected state (if they have adopted an opinion or a social norm) or the susceptible state. The existence of signed relations allows for additional infection and recovery channels, which are different from those in standard model for the spreading of a disease. Namely an infected agent can become susceptible because of a signed three-body interaction. Two variants of the model were considered: in the first one, edge signs were attributed randomly and maintained the same during a group interaction, while in the second one the distribution of signs in the triadic groups was biased so as to account for social balance theory. With the first variant of the model, we have highlighted how trust and distrust relations affect the transition of a system from a disease-free state to an endemic one. Specifically, we have shown that increasing distrust can change the nature of the transition from discontinuous to continuous, by making the bistability region associated to the first-order transition vanish. Moreover, we have characterized the nontrivial interplay existing between the fraction of distrust relations and the connectivity of the social network in shaping the collective dynamics of the system. With the second variant of the model, we have analyzed how the precise patterns of trust/distrust relations impact complex contagion in higher-order networks. In particular, we have highlighted how the contagion is determined not only by the relative proportion of balanced and unbalanced triangles, but also by which configuration within these two classes is more frequent. Various extensions of the present work are possible. First of all, it would be interesting to investigate how trust and distrust influences the contagion process on real-world higher-order networks. Also, it would be useful to generalize the model by considering larger group structures, e.g., groups of size , and the new infection and recovery channels related to those larger groups. A third research direction would be to allow the pattern of contacts to change over time or the signed relations and nodes states to co-evolve. Finally, it would be interesting to consider an heterogeneous mean-field approach to better investigate the impact of the structural properties of higher-order networks on contagion.
References
- [1] A. Barrat, M. Barthelemy, and A. Vespignani, Dynamical processes on complex networks. Cambridge university press, 2008.
- [2] D. Centola and M. Macy, “Complex contagions and the weakness of long ties,” American journal of Sociology, vol. 113, no. 3, pp. 702–734, 2007.
- [3] R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, “Epidemic processes in complex networks,” Reviews of modern physics, vol. 87, no. 3, p. 925, 2015.
- [4] A. L. Hill, D. G. Rand, M. A. Nowak, and N. A. Christakis, “Infectious disease modeling of social contagion in networks,” PLOS computational biology, vol. 6, no. 11, p. e1000968, 2010.
- [5] S. Lehmann and Y.-Y. Ahn, “Complex spreading phenomena in social systems,” Computational Social Sciences, vol. 10, pp. 978–3, 2018.
- [6] I. Z. Kiss, J. C. Miller, P. L. Simon, et al., “Mathematics of epidemics on networks,” Cham: Springer, vol. 598, p. 31, 2017.
- [7] V. Latora, V. Nicosia, and G. Russo, Complex networks: principles, methods and applications. Cambridge University Press, 2017.
- [8] G. Ghasemiesfeh, R. Ebrahimi, and J. Gao, “Complex contagion and the weakness of long ties in social networks: revisited,” in Proceedings of the fourteenth ACM conference on Electronic Commerce, pp. 507–524, 2013.
- [9] F. D. Malliaros, M.-E. G. Rossi, and M. Vazirgiannis, “Locating influential nodes in complex networks,” Scientific reports, vol. 6, no. 1, pp. 1–10, 2016.
- [10] S. Pei and H. A. Makse, “Spreading dynamics in complex networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2013, no. 12, p. P12002, 2013.
- [11] Z. Ruan, G. Iniguez, M. Karsai, and J. Kertész, “Kinetics of social contagion,” Physical review letters, vol. 115, no. 21, p. 218702, 2015.
- [12] E. Lee and P. Holme, “Social contagion with degree-dependent thresholds,” Physical Review E, vol. 96, no. 1, p. 012315, 2017.
- [13] W. Wang, M. Tang, P. Shu, and Z. Wang, “Dynamics of social contagions with heterogeneous adoption thresholds: crossover phenomena in phase transition,” New Journal of Physics, vol. 18, no. 1, p. 013029, 2016.
- [14] I. Iacopini, G. Petri, A. Barrat, and V. Latora, “Simplicial models of social contagion,” Nature communications, vol. 10, no. 1, pp. 1–9, 2019.
- [15] F. Battiston, G. Cencetti, I. Iacopini, V. Latora, M. Lucas, A. Patania, J.-G. Young, and G. Petri, “Networks beyond pairwise interactions: structure and dynamics,” Physics Reports, vol. 874, pp. 1–92, 2020.
- [16] F. Battiston, E. Amico, A. Barrat, G. Bianconi, G. Ferraz de Arruda, B. Franceschiello, I. Iacopini, S. Kéfi, V. Latora, Y. Moreno, et al., “The physics of higher-order interactions in complex systems,” Nature Physics, vol. 17, no. 10, pp. 1093–1098, 2021.
- [17] S. Majhi, M. Perc, and D. Ghosh, “Dynamics on higher-order networks: A review,” Journal of the Royal Society Interface, vol. 19, no. 188, p. 20220043, 2022.
- [18] G. Bianconi, Higher-order networks. Cambridge University Press, 2021.
- [19] C. Bick, E. Gross, H. A. Harrington, and M. T. Schaub, “What are higher-order networks?,” arXiv preprint arXiv:2104.11329, 2021.
- [20] G. F. de Arruda, G. Petri, and Y. Moreno, “Social contagion models on hypergraphs,” Physical Review Research, vol. 2, no. 2, p. 023032, 2020.
- [21] N. W. Landry and J. G. Restrepo, “The effect of heterogeneity on hypergraph contagion models,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 30, no. 10, p. 103117, 2020.
- [22] S. Chowdhary, A. Kumar, G. Cencetti, I. Iacopini, and F. Battiston, “Simplicial contagion in temporal higher-order networks,” Journal of Physics: Complexity, vol. 2, no. 3, p. 035019, 2021.
- [23] A. Barrat, G. Ferraz de Arruda, I. Iacopini, and Y. Moreno, “Social contagion on higher-order structures,” in Higher-Order Systems, pp. 329–346, Springer, 2022.
- [24] G. St-Onge, I. Iacopini, V. Latora, A. Barrat, G. Petri, A. Allard, and L. Hébert-Dufresne, “Influential groups for seeding and sustaining nonlinear contagion in heterogeneous hypergraphs,” Communications Physics, vol. 5, no. 1, p. 25, 2022.
- [25] G. Ferraz de Arruda, G. Petri, P. M. Rodriguez, and Y. Moreno, “Multistability, intermittency, and hybrid transitions in social contagion models on hypergraphs,” Nature Communications, vol. 14, no. 1, p. 1375, 2023.
- [26] M. Saeedian, N. Azimi-Tafreshi, G. Jafari, and J. Kertesz, “Epidemic spreading on evolving signed networks,” Physical Review E, vol. 95, no. 2, p. 022314, 2017.
- [27] S. Unicomb, G. Iñiguez, and M. Karsai, “Threshold driven contagion on weighted networks,” Scientific reports, vol. 8, no. 1, p. 3094, 2018.
- [28] H.-J. Li, W. Xu, S. Song, W.-X. Wang, and M. Perc, “The dynamics of epidemic spreading on signed networks,” Chaos, Solitons & Fractals, vol. 151, p. 111294, 2021.
- [29] F. Heider, “Attitudes and cognitive organization,” The Journal of psychology, vol. 21, no. 1, pp. 107–112, 1946.
- [30] F. Harary, “On the notion of balance of a signed graph.,” Michigan Mathematical Journal, vol. 2, no. 2, pp. 143–146, 1953.
- [31] J. Leskovec, D. Huttenlocher, and J. Kleinberg, “Signed networks in social media,” in Proceedings of the SIGCHI conference on human factors in computing systems, pp. 1361–1370, 2010.
- [32] X. Zheng, D. Zeng, and F.-Y. Wang, “Social balance in signed networks,” Information Systems Frontiers, vol. 17, no. 5, pp. 1077–1095, 2015.
- [33] A. Kirkley, G. T. Cantwell, and M. E. Newman, “Balance in signed networks,” Physical Review E, vol. 99, no. 1, p. 012320, 2019.
- [34] D. T. Gillespie, “Exact stochastic simulation of coupled chemical reactions,” J Phys Chem, vol. 81, pp. 2340–2361, 1977.
- [35] G. Cencetti, F. Battiston, B. Lepri, and M. Karsai, “Temporal properties of higher-order interactions in social networks,” Scientific reports, vol. 11, no. 1, p. 7028, 2021.
- [36] I. Iacopini, B. Schäfer, E. Arcaute, C. Beck, and V. Latora, “Multilayer modeling of adoption dynamics in energy demand management,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 30, no. 1, p. 013153, 2020.
- [37] M. Szell, R. Lambiotte, and S. Thurner, “Multirelational organization of large-scale social networks in an online world,” Proceedings of the National Academy of Sciences, vol. 107, no. 31, pp. 13636–13641, 2010.
- [38] C. Cianci and T. Carletti, “Stochastic patterns in a 1d rock-paper-scissors model with mutation,” Physica A: Statistical Mechanics and its Applications, vol. 410, p. 66, 2014.
- [39] T. Carletti and A. Filisetti, “The stochastic evolution of a protocell: The gillespie algorithm in a dynamically varying volume,” Computational and Mathematical Methods in Medicine, vol. 2012, p. 13, 2012.
Appendix A Stochastic simulations
In this appendix, we explain the procedure employed to generate (synthetic) signed simplicial complexes. We also briefly recall the implementation of the Gillespie algorithm used to simulate the contagion process on top of simplicial complexes.
To construct a simplicial complex made of nodes with an average number of links incident to a node and an average number of triangles incident to a node, we used the procedure described in [14]. Given a set of nodes, we first consider every pair of nodes and connect them with a probability
We then run over all the triplets of nodes and promote each of them to a -simplex with probability
One can check that such probabilities lead to the desired average degree and hyperdegree . Once the simplicial complex is constructed we have to associate signs to links and triangles. In the first model, we consider successively all the links and attribute them a negative sign with a probability and a positive sign otherwise. Then because we assume the agents keep the same dyadic trust/distrust relations once in the three-body interaction, we check all the -simplices and we add the same signs of the three pairwise couples.
In the second model, we take into account social balance theory by using a biased distribution of signs at the level of the triangles. In particular, the pairwise interactions receive a sign with the same process as above, i.e., a “” sign with a probability and a “” sign otherwise. On the other hand the signs of each triangle are assigned with the probabilities given by Eq. (V) for a given choice of , , namely we attribute positive signs and thus negative signs with a probability .
As already described in the main text, we performed the stochastic numerical simulations by using the Gillespie algorithm, that we here briefly describe; we refer the interested reader to [34, 38, 39] for more details and other applications of the method. At time , we start with a chosen fraction of infected nodes uniformly randomly distributed in the simplicial complex. We then establish a list of all the possible reactions, i.e., interaction channels as given in Figs. 1, 2 and 3, that can occur given the states of the nodes and the structure of the signed simplicial complex. The Gillespie method is able to determine the most probable reaction to occur and the most probable time at which it will take place. By denoting with the rate associated with the -th reaction and by the sum of all the rates, we generate two random numbers and from the uniform distribution in . The next reaction that will occur is the -th with such that:
This reaction will occur at time with
Note that the underlying assumption is that only one node changes its state during each reaction. After updating the state of this node, we repeat the process until the fraction of infected nodes stabilizes, i.e., fluctuates around the mean-field equilibrium taking into account the fluctuations.
Fig. 9 compares, for two distinct values of but fixed remaining parameters, the stochastic simulations (points) with respect to the mean-field prediction (continuous curve). The fraction of infected nodes obtained with the Gillespie algorithm was averaged over the last % of the orbit (when the system is close to the stationary state). To detect possible bistability, for each value of , we ran several independent stochastic simulations, with a distinct fraction of initially infected nodes, ranging in , uniformly randomly distributed among the nodes of the simplicial complex. Each stochastic simulation corresponds to a newly generated simplicial complex satisfying the above constraints on , and the fraction of signed triangles.
Let us observe that for , the stochastic simulations deviate from the mean-field predictions. Nevertheless, increasing the network density, e.g., by taking reduces this discrepancy as can be seen in the right panel for the same value of . In some few cases we observe a vanishing infection for large values of . This epidemic fade-out happens when initially the fraction of infected nodes is very small in which case the infection might die out due to the stochasticity of the system and to finite size population. Hence by increasing the number of nodes in the network, such behavior should disappear.


Appendix B Non-monotonicity of the prevalence with respect to the average node degree
In this appendix, we analyze the non-monotonic behavior of the infection as a function of the average node degree and the fraction of distrust in the network. Let us recall that the stationary density is given by
(10) |
see Eq. (3) in the main text. To highlight the non-monotonic behavior of the infection with respect to the average node degree , we compute the derivative of with respect to and determine for which value of it vanishes. One finds:
(11) |
From the latter expression, one deduces:
(12) |
Recalling that and , we see that the first two terms of the r.h.s of Eq. (12) cancel each other and we are left with:
(13) |
where we have stressed the dependence of and on . Notice that the latter expression is independent of . As an illustration, let us consider the parameters used in Fig. 5 in the main document. For these parameters, the function vanishes at the particular value as can be seen in the right panel of Fig. 10. We can thus conclude that for , the infection decreases as increases (see left panel the curve corresponding to ) while for , the opposite behavior holds true (see left panel the curve corresponding to ), i.e., is an increasing function of the average connectivity.


Appendix C Conditions for the presence of the crossing phenomenon
The aim of this section is to investigate in more details the crossing behavior observed in Fig. 6 in the main document. Let us start by recalling that stationary densities are solutions of
(14) |
where
(15) | |||||
(16) | |||||
(17) |
Let us observe that for all values of the parameters, while and can change signs.
Let us recall the definitions and with:
(18) |
and assume the number of triangles with a given number of positive/negative signs are given by
(19) |
By dividing (14) by , we get and thus rewrite the non zero solutions as follows
(20) |
Let us notice that would imply which can never happen being and positive numbers. Hence, we can write (assuming ):
(21) |
Let us observe that has a vertical asymptote for ; being this function invertible close to , we can conclude that for .
To have the crossing property, we need to find such that for some (see Fig. 6); a straightforward computation allows to show that this is equivalent to require:
(22) |
here and and similarly for and . Let us now consider the case of as in Fig. 6 and let us assume and . Recalling that , we deduce that:
(23) |
Taking into account the latter condition, one can show upon simplification that:
(24) |
Notice that the latter expression is independent of and belongs to provided , let us observer that this condition is always met when and , as considered in our analysis. The corresponding value can be deduced from Eq. (21).