Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings

Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field.     

Computational and mathematical organization theory: Perspective and directions

Computational and mathematical organization theory is an interdisciplinary scientific area whose research members focus on developing and testing organizational theory using formal models. The community shares a theoretical view of organizations as collections of processes and intelligent adaptive agents that are task oriented, socially situated, technologically bound, and continuously changing. Behavior within the organization is seen to affect and be affected by the organization's, position in the external environment. The community also shares a methodological orientation toward the use of formal models for developing and testing theory. These models are both computational (e.g., simulation, emulation, expert systems, computer-assisted numerical analysis) and mathematical (e.g., formal logic, matrix algebra, network analysis, discrete and continuous equations). Much of the research in this area falls into four areas: organizational design, organizational learning, organizations and information technology, and organizational evolution and change. Historically, much of the work in this area has been focused on the issue how should organizations be designed. The work in this subarea is cumulative and tied to other subfields within organization theory more generally. The second most developed area is organizational learning. This research, however, is more tied to the work in psychology, cognitive science, and artificial intelligence than to general organization theory. Currently there is increased activity in the subareas of organizations and information technology and organizational evolution and change. Advances in these areas may be made possible by combining network analysis techniques with an information processing approach to organizations. Formal approaches are particularly valuable to all of these areas given the complex adaptive nature of the organizational agents and the complex dynamic nature of the environment faced by these agents and the organizations.This paper was previously presented at the 1995 Informs meeting in Los Angeles, CA.     

Polynomial-time identification of robust network flows under uncertain arc failures

We propose Linear Programming (LP)-based solution methods for network flow problems subject to multiple uncertain arc failures, which allow finding robust optimal solutions in polynomial time under certain conditions. We justify this fact by proving that for the considered class of problems under uncertainty with linear loss functions, the number of entities in the corresponding LP formulations is polynomial with respect to the number of arcs in the network. The proposed formulation is efficient for sparse networks, as well as for time-critical networked systems, where quick and robust decisions play a crucial role.     

A new centrality measure of nodes in multilayer networks under the framework of tensor computation

One challenging issue in information science, biological systems and many other field is to determine the most central agents in multilayer networked systems characterized by different types of interrelationships. In this paper, using a fourth-order tensor to represent multilayer networks, we propose a new centrality measure, referred to as the Singular Vector of Tensor (SVT) centrality, which is used to quantitatively evaluate the importance of nodes connected by different types of links in multilayer networks. First, we present a novel iterative method to obtain four alternative metrics that can quantify the hub and authority scores of nodes and layers in multilayer networked systems. Moreover, we use the theory of multilinear algebra to prove that the four metrics converge to four singular vectors of the adjacency tensor of the multilayer network under reasonable conditions. Furthermore, a novel SVT centrality measure is obtained by integrating these four metrics. The experimental results demonstrate that the proposed method is a new centrality measure that significantly outperforms six other published centrality methods on two real-world multilayer networks related to complex diseases, i.e., gastric and colon cancers.     

A unified network performance measure with importance identification and the ranking of network components

In this paper, we propose the first network performance measure that can be used to assess the efficiency of a network in the case of either fixed or elastic demands. Such a measure is needed for many different applications since only when the performance of a network can be quantifiably measured can the network be appropriately managed. Moreover, as we demonstrate, the proposed performance measure, which captures flow information and behavior, allows one to determine the criticality of various nodes (as well as links) through the identification of their importance and ranking. We present specific networks for which the performance/efficiency is computed along with the importance rankings of the nodes and links. The new measure can be applied to transportation networks, supply chains, financial networks, electric power generation and distribution networks as well as to the Internet and can be used to assess the vulnerability of a network to disruptions.     

Computational organizational network modeling: Strategies and an example

This paper articulates the logic of computational organizational modeling as a strategy for theory construction and testing in the field of organizational communication networks. The paper introduces, Blanche, and objectoriented simulation environment that supports quantitative modeling and analysis of the evolution of organizational networks. Blanche relies on the conceptual primitives of attributes that describe network nodes and links that connect these nodes. Difference equations are used to model the dynamic properties of the network as it changes over time. This paper describes the design of Blanche and how it supports both the process of theory construction, model building and analysis of results. The paper concludes with an empirical example, to test the predictions of a network-based social influence model for the adoption of a new communication technology in the workplace.     

The evolution of cooperation in spatial groups

Much of human cooperation remains an evolutionary riddle. There is evidence that individuals are often organized into groups in many social situations. Inspired by this observation, we propose a simple model of evolutionary public goods games in which individuals are organized into networked groups. Here, nodes in the network represent groups; the edges, connecting the nodes, refer to the interactions between the groups. Individuals establish public goods games with partners in the same group and migrate among neighboring groups depending on their payoffs and expectations. We show that the paradigmatic public goods social dilemma can be resolved and high cooperation levels are attained in structured groups, even in relatively harsh conditions for cooperation. Further, by means of numerical simulations and mean-field analysis, we arrive at the result: larger average group size and milder cooperation environment would lead to lower cooperation level but higher average payoffs of the entire population. Altogether, these results emphasize that our understanding of cooperation can be enhanced by investigations of how spatial groups of individuals affect the evolution dynamics, which might help in explaining the emergence and evolution of cooperation.     

Modeling networked systems using the topologically distributed bounded rationality framework

In networked systems research, game theory is increasingly used to model a number of scenarios where distributed decision making takes place in a competitive environment. These scenarios include peer‐to‐peer network formation and routing, computer security level allocation, and TCP congestion control. It has been shown, however, that such modeling has met with limited success in capturing the real‐world behavior of computing systems. One of the main reasons for this drawback is that, whereas classical game theory assumes perfect rationality of players, real world entities in such settings have limited information, and cognitive ability which hinders their decision making. Meanwhile, new bounded rationality models have been proposed in networked game theory which take into account the topology of the network. In this article, we demonstrate that game‐theoretic modeling of computing systems would be much more accurate if a topologically distributed bounded rationality model is used. In particular, we consider (a) link formation on peer‐to‐peer overlay networks (b) assigning security levels to computers in computer networks (c) routing in peer‐to‐peer overlay networks, and show that in each of these scenarios, the accuracy of the modeling improves very significantly when topological models of bounded rationality are applied in the modeling process. Our results indicate that it is possible to use game theory to model competitive scenarios in networked systems in a way that closely reflects real world behavior, topology, and dynamics of such systems. © 2016 Wiley Periodicals, Inc. Complexity 21: 123–137, 2016     

The Other Side of the Network Coin: Cost Considerations of Network Structure

The purpose of this study is to investigate the differential impact that inter-organizational network connections have on organizational level change. Drawing from the strategic leaning perspective on adaptation, this study investigates how the nature of inter-organizational ties among top management impact the cost and the effectiveness of an organizational level change process. To build on the existing empirical work in this area, this study employs a virtual experiment to create a controlled laboratory investigation of the hypothesized relationships among the strength, formalization, and functional equivalence of network ties; and the cost and effectiveness of an organizational change process. The findings of this study provide support for the strength of weak ties argument and structural hole theory, in addition to suggesting a caveat to Galbraith's information processing model. Furthermore, the results reveal that the tradeoff between increasing effectiveness and decreasing costs is not universally applicable across all decisions regarding network structure.     

Uncertain models for single facility location problems on networks

In practical location problems on networks, the vertex demand is usually non-deterministic. This paper employs uncertainty theory to deal with this non-deterministic factor in single facility location problems. We first propose the concepts of satisfaction degree for both vertices and the whole network, which are used to evaluate products assignment. Based on different network satisfaction degree, two models are constructed. The solution to these models is based on Hakimi’s results, and some examples are given to illustrate these models.     

An analysis of the structural complexity of supply chain networks

Each enterprise in a supply chain network needs quantitative indicators to analyze and manage its interactions with different business partners in the network. Supply chains exhibit the characteristics of complex systems. In a supply chain network, a large number of firms cooperate simultaneously with many suppliers and customers, and interact through a variety of information and material flows to achieve a balance between supply and demand. However, the complexity of a supply chain is not a simple linear structure where a small change often results in a chain reaction. When supply chain complexity increases, monitoring and managing the interaction between different elements of the chain becomes more difficult. An entropy model based on information theory provides an appropriate means of quantifying the complexity of a supply chain system by delivering information required to describe the state of the system. The entropy measure links uncertainty and complexity so that, as a system grows in uncertainty, it becomes more complex and more information is required to describe and monitor it. In this paper, we propose an entropy-based measure for analyzing the structural complexity in relation to the structure and system uncertainty. The method provides guidelines for estimating the complexity throughout the supply chain structure.     

随机连接广义合作网络模型

本文提出了一个项目参与者数T是随机变量的广义合作网络模型,新节点与随机选择的节点合作,通过节点度演化所满足的马尔可夫性,利用马．尔可夫链的方法和技巧得到了度分布的精确解析表达式．并说,明了此广义合作网络不是无标度网络．     

Stable network topologies using the notion of covering

An alternative perspective to evaluate networks and network evolution is introduced, based on the notion of covering. For a particular node in a network covering captures the idea of being outperformed by another node in terms of, for example, visibility and possibility of information gathering. In this paper, we focus on networks where these subdued network positions do not exist. We call these networks stable. Within this set we identify the minimal stable networks, which frequently have a ‘bubble-like’ structure. Severing a link in such a network results in at least one of the nodes being covered. In a minimal stable network therefore all nodes cooperate to avoid that one of the nodes ends up in a subdued position. Our results can be applied to, for example, the design of (covert) communication networks and the dynamics of social and information networks.     

PLS-DEMATEL方法及其应用研究——以组织敏捷性的IT影响因素分析为例

DEMATEL(决策试验与评价实验室)方法是一种在影响因素关联关系评估的基础上,进行影响因素识别与区分的方法。但现实中的管理问题影响因素众多,通过专家打分准确评估影响因素关联关系难度较大,这限制了DEMATEL方法的应用。基于此,本文先采用基于偏最小二乘(PLS)的结构方程方法计算的路径系数来得到影响因素直接关联矩阵,降低了获取直接关联矩阵的难度,再运用传统的DEMATEL方法进行影响因素分析,从而提出了PLS-DEMATEL方法。然后把PLS-DEMATEL方法运用于组织敏捷性的IT影响因素分析的案例研究中,在为增强组织敏捷性提供IT战略支持的同时,也对PLS-DEMATEL方法的实效性进行了验证。     

Effect of local information within network layers on the evolution of cooperation in duplex public goods games

Traditional works of public goods game (PGG) are often studied in simplex networks where agents play games through the same type of social interactions. In order to promote cooperation against the defection in PGGs in simplex network environment, many mechanisms have been proposed from different perspectives, such as the volunteering mechanisms, and the punishment and reward approaches. However, due to diverse types of interactions between agents in reality, the study of PGG should also consider the characteristic of multiplexity of networks. Hence, we firstly model the public goods game in the duplex network (for simplification of analysis, the duplex network is considered), in which agents have two types of social interactions, and thus the network is modeled as two network layers. This type of PGG is naturally named as duplex public goods game (D-PGG), in which agents can select one of the network layers to allocate their limited resources. Then for the new game environment (D-PGG), we propose a novel perspective to promote cooperation: degrading the information integrity, i.e., agents get information just from one network layer (local information) rather than from the whole duplex network (global information) in the evolution process. Finally, through theoretical analyses and simulations, we find that if agents imitate based on the local information of the payoff in the evolution, cooperation can be generally promoted; and the extent of promotion depends on both the network structure and the similarity of the network layers.     

Can tools help unify organization theory? Perspectives on the state of computational modeling

Scholars engaged in the study of work group and organizational behavior are increasingly calling for the use of integrated methods in conducting research, including the wider adoption of computational models for generating and testing new theory. Our review of the state of modern computational modeling incorporating social structures reveals steady increases in the incorporation of dynamic, adaptive, and realistic behaviors of agents in network settings, yet exposes gaps that must be addressed in the next generation of organizational simulation systems. We compare 28 models according to more than two hundred evaluation criteria, ranging from simple representations of agent demographic and performance characteristics, to more richly defined instantiations of behavioral attributes, interaction with non-agent entities, model flexibility, communication channels, simulation types, knowledge, transactive memory, task complexity, and resource networks. Our survey assesses trends across the wide set of criteria, discusses practical applications, and proposes an agenda for future research and development. Michael J. Ashworth is a doctoral candidate in computational organization science at Carnegie Mellon University, where he conducts research on social, knowledge, and transactive memory networks along with their effects on group and organizational learning and performance. Practical outcomes of his work include improved understanding of the impact of technology, offshoring, and turnover on organizational performance. Mr. Ashworth has won several prestigious grants from the Sloan Foundation and the National Science Foundation to pursue his research on transactive memory networks. Journals in which his research has appeared include Journal of Mathematical Sociology, International Journal of Human Resource Management, and Proceedings of the International Conference on Information Systems. His recent work on managing human resource challenges in the electric power industry has been featured in the Wall Street Journal and on National Public Radio's ``Morning Edition.' Mr. Ashworth received his undergraduate degree in systems engineering from the Georgia Institute of Technology. Kathleen M. Carley is a professor at the Institute for Software Research International in the School of Computer Science at Carnegie Mellon University. She is the director of the center for Computational Analysis of Social and Organizational Systems (CASOS), a university-wide interdisciplinary center that brings together network analysis, computer science and organization science (www.casos.ece.cmu.edu). Prof. Carley carries out research that combines cognitive science, dynamic social networks, text processing, organizations, social and computer science in a variety of theoretical and applied venues. Her specific research areas are computational social and organization theory; dynamic social networks; multi-agent network models; group, organizational, and social adaptation, and evolution; statistical models for dynamic network analysis and evolution, computational text analysis, and the impact of telecommunication technologies on communication and information diffusion within and among groups. Prof. Carley has undergraduate degrees in economics and political science from MIT and a doctorate in sociology from Harvard University.     

Quantized control for networked switched systems under denial-of-service attacks via a barrier event-triggered mechanism

This paper studies the quantized control problem for networked switched systems (NSSs) under denial-of-service (DoS) attacks. The quantized state information, together with the switching signal, is transmitted to the controller through a network. In order to reduce communication consumption and controller update frequency, a barrier event-triggered mechanism is utilized to monitor the state at discrete time. Because of the event-triggered mechanism and the DoS attacks on the network, the mismatch between the system mode and the controller mode is thus frequently encountered, which may lead to quantization saturation and system instability. To solve the problem, an update rule is presented for the dynamic quantizer by switching between zooming in and zooming out of the zooming variable, and a feedback controller is proposed with a jointly designed event-triggered mechanism and a dynamic quantizer. Sufficient conditions on the constraints of DoS frequency and duration are obtained to ensure the exponential stability of the switched system. The effectiveness of the obtained results is illustrated by simulation examples and comparative studies.     

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     

Communication and organizational social networks: a simulation model

Recent management research has evidenced the significance of organizational social networks, and communication is believed to impact the interpersonal relationships. However, we have little knowledge on how communication affects organizational social networks. This paper studies the dynamics between organizational communication patterns and the growth of organizational social networks. We propose an organizational social network growth model, and then collect empirical data to test model validity. The simulation results agree well with the empirical data. The results of simulation experiments enrich our knowledge on communication with the findings that organizational management practices that discourage employees from communicating within and across group boundaries have disparate and significant negative effect on the social network’s density, scalar assortativity and discrete assortativity, each of which correlates with the organization’s performance. These findings also suggest concrete measures for management to construct and develop the organizational social network.     

Some Simple Algorithms for Structural Comparison

Structural comparison (i.e., the simultaneous analysis of multiple structures) is a problem which arises frequently in such diverse arenas as the study of organizational forms, social network analysis, and automated text analysis. Prior work has demonstrated the applicability of a range of standard multivariate analysis procedures to the structural comparison problem. Here, some simple algorithms are provided which elucidate several of these methods in an easily implemented form. Carter T. Butts is Assistant Professor at the University of California-Irvine in the Department of Sociology, and is a member of the Institute for Mathematical Behavioral Sciences and the California Institute for Telecommunications and Information Technology. His current research focuses on communication during disasters, Bayesian inference for network data, network comparison, and the structure of spatially embedded interpersonal networks. Kathleen M. Carley is Professor at Carnegie Mellon University, with appointments in the Institute for Software Research International, the H.J. Heinz III School of Public Policy and Management, and the Department of Engineering and Public Policy. Her research centers around areas of social, organizational, knowledge and information networks, organizational design, change, adaptivity and and performance, computational organization theory, crisis management, social theory, impacts on information diffusion of changes in social policy and changes in communication technology, and mapping experts' and executives' knowledge networks using textual analysis techniques.