{"title":"COMPLEX CONTAGION IN SOCIAL SYSTEMS WITH DISTRUST","authors":"JEAN-FRANÇOIS DE KEMMETER, LUCA GALLO, FABRIZIO BONCORAGLIO, VITO LATORA, TIMOTEO CARLETTI","doi":"10.1142/s0219525924400010","DOIUrl":"https://doi.org/10.1142/s0219525924400010","url":null,"abstract":"<p>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 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, where exposure to multiple sources is needed for the contagion to occur. 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 with respect to 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.</p>","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"68 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141552631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
JOHANNES FALK, EDWIN EICHLER, KATJA WINDT, MARC-THORSTEN HÜTT
{"title":"STRUCTURAL INSULATORS AND PROMOTORS IN NETWORKS UNDER GENERIC PROBLEM-SOLVING DYNAMICS","authors":"JOHANNES FALK, EDWIN EICHLER, KATJA WINDT, MARC-THORSTEN HÜTT","doi":"10.1142/s0219525923500121","DOIUrl":"https://doi.org/10.1142/s0219525923500121","url":null,"abstract":"<p>The collective coordination of distributed tasks in a complex system can be represented as decision dynamics on a graph. This abstract representation allows studying the performance of local decision heuristics as a function of task complexity and network architecture. Here, we identify hard-to-solve and easy-to-solve networks in a social differentiation task within the basic model of small-world graphs. We show that, depending on the details of the decision heuristic as well as the length of the added links, shortcuts can serve as <i>structural promotors</i>, which speed up convergence toward a solution, but also as <i>structural insulators</i>, which make the network more difficult to solve. Our findings have implications for situations where, in distributed decision systems, regional solutions emerge, which are globally incompatible as, for example, during the emergence of technological standards.</p>","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"19 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140149949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"INVOLUTION GAME WITH SPECIALIZATION STRATEGY","authors":"BO LI","doi":"10.1142/s0219525923500133","DOIUrl":"https://doi.org/10.1142/s0219525923500133","url":null,"abstract":"<p>Involution now refers to the phenomenon that competitors in the same field make more efforts to struggle for limited resources but get lower individual “profit effort ratio”. In this work, we investigate the evolution of the involution game when competitors in the same field can adopt not only the strategy of making more efforts but also a specialization strategy which allows competitors to devote all their efforts to part of the competitive field. Based on the existing model, we construct the involution game with the specialization strategy and simulate the evolution of it on a square lattice under different social resource, allocation parameter (characterizing the intensity of social competition), effort and other conditions. In addition, we also conduct a theoretical analysis to further understand the underlying mechanism of our model and to avoid illusive results caused by the model settings. Our main results show that, when the total effort of the specialization strategy and the ordinary strategy is equal, the group composed of all the agents has a certain probability to choose the ordinary strategy if the allocation parameter is very large (that is to say, the intensity of competition is very weak), otherwise the group will choose the specialization strategy; when the total effort of the two strategies is not equal, the proportion of the specialization strategy adoption is related to the social resource, the effort and the allocation parameter. To some extent, our study can explain why division of labor appears in human society and provide suggestions for individuals on competition strategy selection and governments on competition policy development.</p>","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"36 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140149858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Influence of Network Structure and Agent Property on System Performance","authors":"Hongzhong Deng, Ji Li, Hongqian Wu, Bingfeng Ge","doi":"10.1142/s021952592350011x","DOIUrl":"https://doi.org/10.1142/s021952592350011x","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"103 33","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138609137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Carlos Zapata-Carratala, Maximilian Schich, Taliesin Beynon, Xerxes D. Arsiwalla
{"title":"Hypermatrix Algebra and Irreducible Arity in Higher-Order Systems: Concepts and Perspectives","authors":"Carlos Zapata-Carratala, Maximilian Schich, Taliesin Beynon, Xerxes D. Arsiwalla","doi":"10.1142/s0219525923500078","DOIUrl":"https://doi.org/10.1142/s0219525923500078","url":null,"abstract":"Theoretical and computational frameworks of complexity science are dominated by binary structures. This binary bias, seen in the ubiquity of pair-wise networks and formal binary operations in mathematical models, limits our capacity to faithfully capture irreducible polyadic interactions in higher-order systems. A paradigmatic example of a higher-order interaction is the Borromean link of three interlocking rings. In this paper, we propose a mathematical framework via hypergraphs and hypermatrix algebras that allows to formalize such forms of higher-order bonding and connectivity in a parsimonious way. Our framework builds on and extends current techniques in higher-order networks — still mostly rooted in binary structures such as adjacency matrices — and incorporates recent developments in higher-arity structures to articulate the compositional behavior of adjacency hypermatrices. Irreducible higher-order interactions turn out to be a widespread occurrence across natural sciences and socio-cultural knowledge representation. We demonstrate this by reviewing recent results in computer science, physics, chemistry, biology, ecology, social science, and cultural analysis through the conceptual lens of irreducible higher-order interactions. We further speculate that the general phenomenon of emergence in complex systems may be characterized by spatio-temporal discrepancies of interaction arity.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":" 87","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135191254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Linlin lu, Lecai Liang, Jing Zhou, Shuifen Zhan, Rong Zhuang
{"title":"Dynamic Risk Assessment Method for Road Transport of Hazardous Chemicals Based on BP Neural Network Algorithm","authors":"Linlin lu, Lecai Liang, Jing Zhou, Shuifen Zhan, Rong Zhuang","doi":"10.1142/s1793962324410150","DOIUrl":"https://doi.org/10.1142/s1793962324410150","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135868265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An evolutionary model of social network structure driven by information interaction","authors":"Fuzhong Nian, Jianjian Zhou, Yinuo Qian","doi":"10.1142/s0219525923500108","DOIUrl":"https://doi.org/10.1142/s0219525923500108","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"92 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135869169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}