It doesn’t take a village to fall for misinformation: Social media use,discussion heterogeneity preference,worry of the virus,faith in scientists,and COVID-19-related misinformation beliefs

With the circulation of misinformation about the COVID-19 pandemic, the World Health Organization has raised concerns about an “infodemic,” which exacerbates people’s misperceptions and deters preventive measures. Against this backdrop, this study examined the conditional indirect effect of social media use and discussion heterogeneity preference on COVID-19-related misinformation beliefs in the United States, using a national survey. Findings suggested that social media use was positively associated with misinformation beliefs, while discussion heterogeneity preference was negatively associated with misinformation beliefs. Furthermore, worry of COVID-19 was found to be a significant mediator as both associations became more significant when mediated through worry. In addition, faith in scientists served as a moderator that mitigated the indirect effect of discussion heterogeneity preference on misinformation beliefs. That is, among those who had stronger faiths in scientists, the indirect effect of discussion heterogeneity preference on misinformation belief became more negative. The findings revealed communication and psychological factors associated with COVID-19-related misinformation beliefs and provided insights into coping strategies during the pandemic.     

Prediction of risk factors of cyberbullying-related words in Korea: Application of data mining using social big data

The study examined a decision tree analysis using social big data to conduct the prediction model on types of risk factors related to cyberbullying in Korea. The study conducted an analysis of 103,212 buzzes that had noted causes of cyberbullying and data were collected from 227 online channels, such as news websites, blogs, online groups, social network services, and online bulletin boards. Using opinion-mining method and decision tree analysis, the types of cyberbullying were sorted using SPSS 25.0. The results indicated that the total rate of types of cyberbullying in Korea was 44%, which consisted of 32.3% victims, 6.4% perpetrators, and 5.3% bystanders. According to the results, the impulse factor was also the greatest influence on the prediction of the risk factors and the propensity for dominance factor was the second greatest factor predicting the types of risk factors. In particular, the impulse factor had the most significant effect on bystanders, and the propensity for dominance factor was also significant in influencing online perpetrators. It is necessary to develop a program to diminish the impulses that were initiated by bystanders as well as victims and perpetrators because many of those bystanders have tended to aggravate impulsive cyberbullying behaviors.     

Why do people purchase virtual goods? A uses and gratification (U&G) theory perspective

Few literature studies have investigated the relationships between different uses and gratifications (U&Gs) of mobile instant messaging (MIM) apps, continuation, and purchase intentions. To address this gap, the researchers aimed to examine the influence of the content, social, process, and technology U&Gs of MIM on continuation intentions toward MIMs, and purchase intentions toward virtual goods available on MIMs. A comprehensive research model was developed based on the U&G theory, which was tested using cross-sectional data from 309 Japanese MIM users. The study considered six different U&Gs of MIM as independent variables and purchase intentions towards stickers and continuation intentions towards MIM as dependent variables. The study results suggest that exposure U&G has a significant positive association with MIM sticker purchase intentions. The entertainment and affection U&G are positively associated with continuation intentions towards MIM use. The study contributes to the literature by investigating U&Gs that motivate MIM users to have both positive purchase intentions toward virtual goods, such as stickers, and continuation intentions toward MIMs. The study has significant theoretical and practical implications for both researchers and practitioners who are interested in virtual goods, the virtual economy, MIM apps, social media, new media, and the service economy.     

On effectiveness of wiretap programs in mapping social networks

Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost. Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php     

Identifying sets of key players in a social network

A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG. KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore new measures are presented. Stephen P. Borgatti is Professor of Organization Studies at the Carroll School of Management, Boston College. His research is focused on social networks, social cognition and knowledge management. He is also interested in the application of social network analysis to the solution of managerial problems.     

Limited resolution in complex network community detection with Potts model approach

According to Fortunato and Barthélemy, modularity-based community detection algorithms have a resolution threshold such that small communities in a large network are invisible. Here we generalize their work and show that the q-state Potts community detection method introduced by Reichardt and Bornholdt also has a resolution threshold. The model contains a parameter by which this threshold can be tuned, but no a priori principle is known to select the proper value. Single global optimization criteria do not seem capable for detecting all communities if their size distribution is broad.     

Validation and verification of social processes within agent-based computational organization models

The use of simulation modeling in computational analysis of organizations is becoming a prominent approach in social science research. However, relying on simulations to gain intuition about social phenomena has significant implications. While simulations may give rise to interesting macro-level phenomena, and sometimes even mimic empirical data, the underlying micro and macro level processes may be far from realistic. Yet, this realism may be important to infer results that are relevant to existing theories of social systems and to policy making. Therefore, it is important to assess not only predictive capability but also explanation accuracy of formal models in terms of the degree of realism reflected by the embedded processes. This paper presents a process-centric perspective for the validation and verification (V&V) of agent-based computational organization models. Following an overview of the role of V&V within the life cycle of a simulation study, emergent issues in agent-based organization model V&V are outlined. The notion of social contract that facilitates capturing micro level processes among agents is introduced to enable reasoning about the integrity and consistency of agent-based organization designs. Social contracts are shown to enable modular compositional verification of interaction dynamics among peer agents. Two types of consistency are introduced: horizontal and vertical consistency. It is argued that such local consistency analysis is necessary, but insufficient to validate emergent macro processes within multi-agent organizations. As such, new formal validation metrics are introduced to substantiate the operational validity of emergent macro-level behavior. Levent Yilmaz is Assistant Professor of Computer Science and Engineering in the College of Engineering at Auburn University and co-founder of the Auburn Modeling and Simulation Laboratory of the M&SNet. Dr. Yilmaz received his Ph.D. and M.S. degrees from Virginia Polytechnic Institute and State University (Virginia Tech). His research interests are on advancing the theory and methodology of simulation modeling, agent-directed simulation (to explore dynamics of socio-technical systems, organizations, and human/team behavior), and education in simulation modeling. Dr. Yilmaz is a member of ACM, IEEE Computer Society, Society for Computer Simulation International, and Upsilon Pi Epsilon. URL: http://www.eng.auburn.edu/~yilmaz     

Do social media literacy skills help in combating fake news spread? Modelling the moderating role of social media literacy skills in the relationship between rational choice factors and fake news sharing behaviour

This study modelled the rational factors that predict fake news sharing behaviour. It also tested the moderating role of social media literacy skills. The focus was on social media users in Nigeria. An online survey was conducted to gather the responses from participants across Nigerian geopolitical zones. Structural equation modelling (SEM) Smart PLS 3.6 was used to analyse the data. We found that information sharing, the news finds me perception, trust in social media and status-seeking lead to fake news sharing among social media users in Nigeria. Specifically, trust in social media and status-seeking had a greater effect on fake news sharing behaviour. We also found that social media literacy skills significantly moderate the relationship between information sharing, status-seeking, the news finds me perception, trust in social media and fake news sharing in such a way that the effects/relationships are stronger among those with low social media literacy skills. This outcome contributes to theory and practice which was highlighted in the concluding aspect of this study.     

A blockchain-based trustworthy collaborative power trading scheme for 5G-enabled social internet of vehicles

Social Internet of Vehicles (SIoV) falls under the umbrella of social Internet of Things (IoT), where vehicles are socially connected to other vehicles and roadside units that can reliably share information and services with other social entities by leveraging the capabilities of 5G technology, which brings new opportunities and challenges, e.g., collaborative power trading can address the mileage anxiety of electric vehicles. However, it relies on a trusted central party for scheduling, which introduces performance bottlenecks and cannot be set up in a distributed network, in addition, the lack of transparency in state-of-the-art Vehicle-to-Vehicle (V2V) power trading schemes can introduce further trust issues. In this paper, we propose a blockchain-based trustworthy collaborative power trading scheme for 5G-enabled social vehicular networks that uses a distributed market mechanism to introduce trusted power trading and avoids the dependence on a centralized dispatch center. Based on the game theory, we design the pricing and trading matching mechanism for V2V power trading to obtain maximum social welfare. We use blockchain to record power trading data for trusted pricing and use smart contracts for transaction matching. The simulation results verify the effectiveness of the proposed scheme in improving social welfare and reducing the load on the grid.     

On clique relaxation models in network analysis

Increasing interest in studying community structures, or clusters in complex networks arising in various applications has led to a large and diverse body of literature introducing numerous graph-theoretic models relaxing certain characteristics of the classical clique concept. This paper analyzes the elementary clique-defining properties implicitly exploited in the available clique relaxation models and proposes a taxonomic framework that not only allows to classify the existing models in a systematic fashion, but also yields new clique relaxations of potential practical interest. Some basic structural properties of several of the considered models are identified that may facilitate the choice of methods for solving the corresponding optimization problems. In addition, bounds describing the cohesiveness properties of different clique relaxation structures are established, and practical implications of choosing one model over another are discussed.