The Social Psychology of Homophily: The Collective Sentiments of Education Advocacy Groups

2020 ◽  
Vol 122 (6) ◽  
pp. 1-32
Author(s):  
Jonathan A. Supovitz ◽  
Christian Kolouch ◽  
Alan J. Daly

Background/Context As a major area of civic decision making, public education is a central arena for advocacy groups seeking to influence policy debates. An emerging body of research examines advocates’ use of social media. While debates about policy can be thought of as a clash of large ideas contained within frames, cognitive linguists note that framing strategies are activated by the particular words that advocates choose to convey their positions. Purpose/Objective/Research Question/Focus of Study This study examined the vociferous debate surrounding the Common Core State Standards on Twitter during the height of state adoption in 2014 and 2015. Combining social network analysis and natural language processing techniques, we first identified the organically forming factions within the Common Core debate on Twitter and then captured the collective psychological sentiments of these factions. Research Design The study employed quantitative statistical comparisons of the frequency of words used by members of different factions around the Common Core on Twitter that are associated in prior research with four psychological characteristics: mood, motivation, conviction, and thinking style. Data Collection and Analysis Data were downloaded from Twitter from November 2014 to October 2015 using at least one of three hashtags: #commoncore, #ccss, or #stopcommoncore. The resulting data set consisted of more than 500,000 tweets and retweets from more than 100,000 distinct actors. We then ran a community detection algorithm to identify the structural subcommunities, or factions. To measure the four psychological characteristics, we adapted Pennebaker and colleagues’ Linguistic Inquiry and Word Count libraries. We then connected the individual tweet authors to their faction based on the results of the social network analysis community detection algorithm. Using these groups, and the standardized results for each psychological characteristic/dimension, we performed a series of analyses of variance with Bonferroni corrections to test for differences in the psychological characteristics among the factions. Findings/Results For each of the four psychological characteristics, we found different patterns among the different factions. Educators opposed to the Common Core had the highest level of drive motivation, use of sad words, and use of words associated with a narrative thinking style. Opponents of the Common Core from outside education exhibited an affiliative drive motivation, a narrative thinking style, high levels of anger words, and low levels of conviction in their choice of language. Supporters of the Common Core used words that represented a more analytic thinking style, stronger levels of conviction, and words associated with a higher level of achievement orientation. Conclusions/Recommendations Individuals on Twitter, mostly strangers to each other, band together to form fluid communities as they share positions on particular issues. On Twitter, these bonds are formed by behavioral choices to follow, retweet, and mention others. This study reveals how like-minded individuals create a collective sentiment through their specific choice of words to express their views. By analyzing the underlying psychological characteristics associated with language, we show the distinct pooled psychologies of activists as they engaged together in political activity in an effort to influence the political environment.

2021 ◽  
pp. 2150164
Author(s):  
Pengli Lu ◽  
Zhou Yu ◽  
Yuhong Guo

Community detection is important for understanding the structure and function of networks. Resistance distance is a kind of distance function inherent in the network itself, which has important applications in many fields. In this paper, we propose a novel community detection algorithm based on resistance distance and similarity. First, we propose the node similarity, which is based on the common nodes and resistance distance. Then, we define the distance function between nodes by similarity. Furthermore, we calculate the distance between communities by using the distance between nodes. Finally, we detect the community structure in the network according to the nearest-neighbor nodes being in the same community. Experimental results on artificial networks and real-world networks show that the proposed algorithm can effectively detect the community structures in complex networks.


2020 ◽  
Author(s):  
Wala Rebhi ◽  
Nesrine Ben Yahia ◽  
Narjès Bellamine Ben Saoud

Abstract Multiplex graphs have been recently proposed as a model to represent high-level complexity in real-world networks such as heterogeneous social networks where actors could be characterized by heterogeneous properties and could be linked with different types of social interactions. This has brought new challenges in community detection, which aims to identify pertinent groups of nodes in a complex graph. In this context, great efforts have been made to tackle the problem of community detection in multiplex graphs. However, most of the proposed methods until recently deal with static multiplex graph and ignore the temporal dimension, which is a key characteristic of real networks. Even more, the few methods that consider temporal graphs, they just propose to follow communities over time and none of them use the temporal aspect directly to detect stable communities, which are often more meaningful in reality. Thus, this paper proposes a new two-step method to detect stable communities in temporal multiplex graphs. The first step aims to find the best static graph partition at each instant by applying a new hybrid community detection algorithm, which considers both relations heterogeneities and nodes similarities. Then, the second step considers the temporal dimension in order to find final stable communities. Finally, experiments on synthetic graphs and a real social network show that this method is competitive and it is able to extract high-quality communities.


2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Junjie Jia ◽  
Pengtao Liu ◽  
Xiaojin Du ◽  
Yuchao Zhang

Aiming at the problem of the lack of user social attribute characteristics in the process of dividing overlapping communities in multilayer social networks, in this paper, we propose a multilayer social network overlapping community detection algorithm based on trust relationship. By combining structural trust and social attribute trust, we transform a complex multilayer social network into a single-layer trust network. We obtain the community structure according to the community discovery algorithm based on trust value and merge communities with higher overlap. The experimental comparison and analysis are carried out on the synthetic network and the real network, respectively. The experimental results show that the proposed algorithm has higher harmonic mean and modularity than other algorithms of the same type.


Author(s):  
Fuzhong Nian ◽  
Li Luo ◽  
Xuelong Yu

The evolution analysis of community structure of social network will help us understand the composition of social organizations and the evolution of society better. In order to discover the community structure and the regularity of community evolution in large-scale social networks, this paper analyzes the formation process and influencing factors of communities, and proposes a community evolution analysis method of crowd attraction driven. This method uses the traditional community division method to divide the basic community, and introduces the theory of information propagation into complex network to simulate the information propagation of dynamic social networks. Then defines seed node, the activity of basic community and crowd attraction to research the influence of groups on individuals in social networks. Finally, making basic communities as fixed groups in the network and proposing community detection algorithm based on crowd attraction. Experimental results show that the scheme can effectively detect and identify the community structure in large-scale social networks.


Author(s):  
Paramita Dey

The rapid growth of internet with large number of social network sites makes it easy to interconnect people from all over the world on a shared platform. Social network can be represented by a graph, where individual users are represented as nodes/vertices and connections between them are represented as edges of the graph. As social network inherits the properties of graph, its characterization includes centrality and community detection. In this chapter we discuss three centrality measures and its effects for information propagation. We discuss three popular hierarchical community detection measures and make a comparative analysis of them. Moreover we propose a new ego-based community detection algorithm which can be very efficient in terms of time complexity for very large network like online social network. In this chapter, a network is formed based on the data collected from Twitter account using hashtag(#).


2017 ◽  
Vol 99 (3) ◽  
pp. 50-55 ◽  
Author(s):  
Jonathan Supovitz

Political debate about the Common Core State Standards (the first major education policy initiative in the social media age) ramped up quickly on social media, particularly on Twitter. However, while the increased and intense conversation influenced many states to disavow Common Core in name, those states ended up adopting standards that were essentially the same. More important, the author argues, the Twitter-based conflict over Common Core served as a proxy war for other concerns and revealed lasting changes in the nature of political advocacy in education.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Xu Han ◽  
Deyun Chen ◽  
Hailu Yang

The semantic social network is a kind of network that contains enormous nodes and complex semantic information, and the traditional community detection algorithms could not give the ideal cogent communities instead. To solve the issue of detecting semantic social network, we present a clustering community detection algorithm based on the PSO-LDA model. As the semantic model is LDA model, we use the Gibbs sampling method that can make quantitative parameters map from semantic information to semantic space. Then, we present a PSO strategy with the semantic relation to solve the overlapping community detection. Finally, we establish semantic modularity (SimQ) for evaluating the detected semantic communities. The validity and feasibility of the PSO-LDA model and the semantic modularity are verified by experimental analysis.


Sign in / Sign up

Export Citation Format

Share Document