scholarly journals Network Goal Analysis of Social and Organizational Systems: Testing Dynamic Network Theory in Complex Social Networks

2019 ◽  
Vol 56 (1) ◽  
pp. 107-129
Author(s):  
James D. Westaby ◽  
Adam K. Parr

Grounded in dynamic network theory, this study examined network goal analysis (NGA) to understand complex systems. NGA provides new insights by inserting goal nodes into social networks. Goal nodes can also represent missions, objectives, or desires, thus having wide applicability. The theory ties social networks to goal nodes through a parsimonious set of social network role linkages, such as independent goal striving, system supporting, feedback, goal preventing, supportive resisting, and system negating (i.e., those who are upset with others in the pursuit). Moreover, we extend the theory’s system reactance role linkage to better account for constructive conflicts. Two complex systems were examined: a team’s mission and an individual’s work project. In support of dynamic network theory, using the Quadratic Assignment Procedure, results demonstrated significant shared goal striving, system supporting, and shared connections between goal striving and system supporting. These findings manifest what we coin as multipendence: Systems having some actions independently involved with goals, while others are dependently involved in the associated network. NGA also demonstrated that the goal nodes manifested strong betweenness centrality, indicating that goal striving and feedback links were connecting entities across the wider system. Strategies to plan network goal interventions are illustrated with implications for practice.

2014 ◽  
Vol 25 (10) ◽  
pp. 1450056 ◽  
Author(s):  
Ke-Ke Shang ◽  
Wei-Sheng Yan ◽  
Xiao-Ke Xu

Previously many studies on online social networks simply analyze the static topology in which the friend relationship once established, then the links and nodes will not disappear, but this kind of static topology may not accurately reflect temporal interactions on online social services. In this study, we define four types of users and interactions in the interaction (dynamic) network. We found that active, disappeared, new and super nodes (users) have obviously different strength distribution properties and this result also can be revealed by the degree characteristics of the unweighted interaction and friendship (static) networks. However, the active, disappeared, new and super links (interactions) only can be reflected by the strength distribution in the weighted interaction network. This result indicates the limitation of the static topology data on analyzing social network evolutions. In addition, our study uncovers the approximately stable statistics for the dynamic social network in which there are a large variation for users and interaction intensity. Our findings not only verify the correctness of our definitions, but also helped to study the customer churn and evaluate the commercial value of valuable customers in online social networks.


2014 ◽  
Vol 13 (5) ◽  
pp. 963
Author(s):  
Burgert A. Senekal ◽  
Karlien Stemmet

The theory of complex systems has gained significant ground in recent years, and with it, complex network theory has become an essential approach to complex systems. This study follows international trends in examining the interlocking South African bank director network using social network analysis (SNA), which is shown to be a highly connected social network that has ties to many South African industries, including healthcare, mining, and education. The most highly connected directors and companies are identified, along with those that are most central to the network, and those that serve important bridging functions in facilitating network coherence. As this study is exploratory, numerous suggestions are also made for further research.


Author(s):  
Diane Harris Cline

This chapter views the “Periclean Building Program” through the lens of Actor Network Theory, in order to explore the ways in which the construction of these buildings transformed Athenian society and politics in the fifth century BC. It begins by applying some Actor Network Theory concepts to the process that was involved in getting approval for the building program as described by Thucydides and Plutarch in his Life of Pericles. Actor Network Theory blends entanglement (human-material thing interdependence) with network thinking, so it allows us to reframe our views to include social networks when we think about the political debate and social tensions in Athens that arose from Pericles’s proposal to construct the Parthenon and Propylaea on the Athenian Acropolis, the Telesterion at Eleusis, the Odeon at the base of the South slope of the Acropolis, and the long wall to Peiraeus. Social Network Analysis can model the social networks, and the clusters within them, that existed in mid-fifth century Athens. By using Social Network Analysis we can then show how the construction work itself transformed a fractious city into a harmonious one through sustained, collective efforts that engaged large numbers of lower class citizens, all responding to each other’s needs in a chaine operatoire..


Author(s):  
Yingzi Jin ◽  
Yutaka Matsuo

Previous chapters focused on the models of static networks, which consider a relational network at a given point in time. However, real-world social networks are dynamic in nature; for example, friends of friends become friends. Social network research has, in recent years, paid increasing attention to dynamic and longitudinal network analysis in order to understand network evolution, belief formation, friendship formation, and so on. This chapter focuses mainly on the dynamics and evolutional patterns of social networks. The chapter introduces real-world applications and reviews major theories and models of dynamic network mining.


Algorithms ◽  
2019 ◽  
Vol 12 (11) ◽  
pp. 234 ◽  
Author(s):  
Anam Luqman ◽  
Muhammad Akram ◽  
Florentin Smarandache

A complex neutrosophic set is a useful model to handle indeterminate situations with a periodic nature. This is characterized by truth, indeterminacy, and falsity degrees which are the combination of real-valued amplitude terms and complex-valued phase terms. Hypergraphs are objects that enable us to dig out invisible connections between the underlying structures of complex systems such as those leading to sustainable development. In this paper, we apply the most fruitful concept of complex neutrosophic sets to theory of hypergraphs. We define complex neutrosophic hypergraphs and discuss their certain properties including lower truncation, upper truncation, and transition levels. Furthermore, we define T-related complex neutrosophic hypergraphs and properties of minimal transversals of complex neutrosophic hypergraphs. Finally, we represent the modeling of certain social networks with intersecting communities through the score functions and choice values of complex neutrosophic hypergraphs. We also give a brief comparison of our proposed model with other existing models.


1990 ◽  
Vol 21 (2) ◽  
pp. 113-127 ◽  
Author(s):  
Nissan Rubin

This article suggests using social network theory to explain the varieties of mourning behavior in different societies. This context is used to compare the participation in funeral ceremonies of members of different social circles in modern-American society and in the Israeli kibbutz. The two cases demonstrate the validity of concepts deriving from social network analysis in the study of bereavement, mourning behavior, and funerary practice. The approach suggested might serve as a basis for a cross-cultural analysis of the range of participation in mourning rituals.


2017 ◽  
Author(s):  
Christopher Steven Marcum ◽  
David R. Schaefer

One of the great lessons from the last half century of research on social networks is that relationships are constantly in flux. While much social network analysis focuses on static relationships between actors, there is also a rich tradition of work extending back to foundational studies in network science focused on the notion that network change is an indelible aspect of social life for human and non-human actors alike (e.g., Bott, 1957; Heider, 1946; Newcomb 1961; Rapoport, 1949; Sampson, 1969). Today, social network researchers benefit from this history in that a host of methods to collect and analyze such dynamic network data have been developed. Among them, the methods based on stochastic process theory have given rise to a paradigm where inferences and predictions can be made on the mechanisms that drive changes in social structure.


2019 ◽  
Vol 57 (3) ◽  
pp. 344
Author(s):  
Dung Xuan Nguyen ◽  
Ban Van Doan ◽  
Ngoc Thi Bich Do

The Betweenness centrality is an important metric in the graph theory and can be applied in the analyzing social network. The main researches about Betweenness centrality often focus on reducing the complexity. Nowadays, the number of users in the social networks is huge. Thus, improving the computing time of Betweenness centrality to apply in the social network is neccessary. In this paper, we propose the algorithm of computing Betweenness centrality by reduce the similar nodes in the graph in order to reducing computing time. Our experiments with graph networks result shows that the computing time of the proposed algorithm is less than Brandes algorithm. The proposed algorithm is compared with the Brandes algorithm [3] in term of execution time.


Sign in / Sign up

Export Citation Format

Share Document