Partitioning signed social networks

Structural balance theory has proven useful for delineating the blockmodel structure of signed social networks. Even so, most of the observed signed networks are not perfectly balanced. One possibility for this is that in examining the dynamics underlying the generation of signed social networks, insufficient attention has been given to other processes and features of signed networks. These include: actors who have positive ties to pairs of actors linked by a negative relation or who belong to two mutually hostile subgroups; some actors that are viewed positively across the network despite the presence of negative ties and subsets of actors with negative ties towards each other. We suggest that instead viewing these situations as violations of structural balance, they can be seen as belonging to other relevant processes we call mediation, differential popularity and internal subgroup hostility. Formalizing these ideas leads to the relaxed structural balance blockmodel as a proper generalization of structural balance blockmodels. Some formal properties concerning the relation between these two models are presented along with the properties of the fitting method proposed for the new blockmodel type. The new method is applied to four empirical data sets where improved fits with more nuanced interpretations are obtained.     

Introduction to stochastic actor-based models for network dynamics

Stochastic actor-based models are models for network dynamics that can represent a wide variety of influences on network change, and allow to estimate parameters expressing such influences, and test corresponding hypotheses. The nodes in the network represent social actors, and the collection of ties represents a social relation. The assumptions posit that the network evolves as a stochastic process ‘driven by the actors’, i.e., the model lends itself especially for representing theories about how actors change their outgoing ties. The probabilities of tie changes are in part endogenously determined, i.e., as a function of the current network structure itself, and in part exogenously, as a function of characteristics of the nodes (‘actor covariates’) and of characteristics of pairs of nodes (‘dyadic covariates’). In an extended form, stochastic actor-based models can be used to analyze longitudinal data on social networks jointly with changing attributes of the actors: dynamics of networks and behavior.     

Analysis of contested reports in exchange networks based on actors’ credibility

Exchanges of information, goods, and services are an essential part of human relations. However, a significant number of reported exchange ties tend to be contested: the reports of the sender and the receiver in an exchange do not concur with each other. To accurately understand the exchange ties between actors and the properties of the associated exchange networks, it is important to address such disagreement. Common practices either eliminate the contested reports or symmetrize them. Neither of them is ideal, as both underuse valuable information in the reports. In this paper, we propose new methods for handling contested exchange ties. The key idea is to measure actors’ credibility based on their asymmetric connections. For example, an actor is less credible the more contested ties she or he has. Using the credibility scores thus calculated, we develop two methods for handling contested ties. The first method is deterministic: it takes the report of the more credible actor as a reflection of the true exchange status between two actors. The second method is stochastic: it assumes the true exchange status between two actors is a random draw from their reports with probabilities proportional to their credibility. We illustrate the above methods by analyzing contested reports in cigarette exchange networks among middle school students in China and social and economic exchange networks among rural households in South Africa. The results show that our methods provide more reasonable corrections to contested reports than previous methods.     

Missing data in networks: exponential random graph (p1) models for networks with non-respondents

Survey studies of complete social networks often involve non-respondents, whereby certain people within the “boundary” of a network do not complete a sociometric questionnaire—either by their own choice or by the design of the study—yet are still nominated by other respondents as network partners. We develop exponential random graph (p¹) models for network data with non-respondents. We model respondents and non-respondents as two different types of nodes, distinguishing ties between respondents from ties that link respondents to non-respondents. Moreover, if we assume that the non-respondents are missing at random, we invoke homogeneity across certain network configurations to infer effects as applicable to the entire set of network actors. Using an example from a well-known network dataset, we show that treating a sizeable proportion of nodes as non-respondents may still result in estimates, and inferences about structural effects, consistent with those for the entire network.If, on the other hand, the principal research focus is on the respondent-only structure, with non-respondents clearly not missing at random, we incorporate the information about ties to non-respondents as exogenous. We illustrate this model with an example of a network within and between organizational departments. Because in this second class of models the number of non-respondents may be large, values of parameter estimates may not be directly comparable to those for models that exclude non-respondents. In the context of discussing recent technical developments in exponential random graph models, we present a heuristic method based on pseudo-likelihood estimation to infer whether certain structural effects may contribute substantially to the predictive capacity of a model, thereby enabling comparisons of important effects between models with differently sized node sets.     

What makes a network go round? Exploring the structure of a strong component with exponential random graph models

A strong component is a subgraph in a directed network where, following the direction of ties, all nodes in the graph are reachable from one another. Mutual reachability implies that every node in the graph is theoretically able to send materials to and/or influence every other node suggesting that strong components are amongst the more egalitarian network structures. Despite this intriguing feature, they remain understudied. Using exponential random graph models (ERGM) for directed networks, we investigate the social and structural processes underlying the generation of strong components. We illustrate our argument using a network of 301 nodes and 703 personal lending ties from Renaissance Florence. ERGM shows that our strong component arises from triadic clustering alongside an absence of higher-order star structures. We contend that these processes produce a strong component with a hierarchical, rather than an egalitarian structure: while some nodes are deeply embedded in a dense network of exchange, the involvement of others is more tenuous. More generally, we argue that such tiered core-periphery strong components will predominate in networks where the social context creates conditions for an absence of preferential attachment alongside the presence of localized closure. Although disparate social processes can give rise to hierarchical strong components linked to these two structural mechanisms, in Florence they are associated with the presence of multiple dimensions of social status and the connectedness of participants across disparate network domains.     

Effects of missing data in social networks

We perform sensitivity analyses to assess the impact of missing data on the structural properties of social networks. The social network is conceived of as being generated by a bipartite graph, in which actors are linked together via multiple interaction contexts or affiliations. We discuss three principal missing data mechanisms: network boundary specification (non-inclusion of actors or affiliations), survey non-response, and censoring by vertex degree (fixed choice design), examining their impact on the scientific collaboration network from the Los Alamos E-print Archive as well as random bipartite graphs. The simulation results show that network boundary specification and fixed choice designs can dramatically alter estimates of network-level statistics. The observed clustering and assortativity coefficients are overestimated via omission of affiliations or fixed choice thereof, and underestimated via actor non-response, which results in inflated measurement error. We also find that social networks with multiple interaction contexts may have certain interesting properties due to the presence of overlapping cliques. In particular, assortativity by degree does not necessarily improve network robustness to random omission of nodes as predicted by current theory.     

Diffusion of innovations through social networks: Determinants and implications

Social scientists have long been interested in the diffusion of innovations—the process by which new ideas, behavior, and practices spread between persons, organizations, and even countries. While innovations can enter a community through various channels, ongoing spread of innovations through a community occurs through the medium of social networks—collections of interpersonal or digital relationships connecting actors to each other. Social networks are important for diffusion because relationships foster communication, trust, and flow of information. Diffusion outcomes are also shaped by the structural properties of social networks such as density, centrality, and strength of ties, as well as properties of the innovation and the actors involved in the process. The purpose of the article is twofold: (1) to take stock of the field and review ongoing debates on the role of social networks in the diffusion of innovations and (2) to summarize the sociological implications of the diffusion of innovations through social networks.     

Exponential random graph models for little networks

Statistical models for social networks have enabled researchers to study complex social phenomena that give rise to observed patterns of relationships among social actors and to gain a rich understanding of the interdependent nature of social ties and actors. Much of this research has focused on social networks within medium to large social groups. To date, these advances in statistical models for social networks, and in particular, of Exponential-Family Random Graph Models (ERGMS), have rarely been applied to the study of small networks, despite small network data in teams, families, and personal networks being common in many fields. In this paper, we revisit the estimation of ERGMs for small networks and propose using exhaustive enumeration when possible. We developed an R package that implements the estimation of pooled ERGMs for small networks using Maximum Likelihood Estimation (MLE), called “ergmito”. Based on the results of an extensive simulation study to assess the properties of the MLE estimator, we conclude that there are several benefits of direct MLE estimation compared to approximate methods and that this creates opportunities for valuable methodological innovations that can be applied to modeling social networks with ERGMs.     

Collective action and network change

Network models of collective action commonly assume fixed social networks in which ties influence participation through social rewards. This implies that only certain ties are beneficial from the view of individual actors. Accordingly, in this study we allow that actors strategically revise their relations. Moreover, in our model actors also take into account possible network consequences in their participation choices. To handle the interrelatedness of networks and participation, we introduce new equilibrium concepts. Our equilibrium analysis suggests that structures that tend to segregate contributors from free riders are stable, but costless network change only promotes all-or-nothing participation and complete networks.     

An introduction to exponential random graph (p) models for social networks

This article provides an introductory summary to the formulation and application of exponential random graph models for social networks. The possible ties among nodes of a network are regarded as random variables, and assumptions about dependencies among these random tie variables determine the general form of the exponential random graph model for the network. Examples of different dependence assumptions and their associated models are given, including Bernoulli, dyad-independent and Markov random graph models. The incorporation of actor attributes in social selection models is also reviewed. Newer, more complex dependence assumptions are briefly outlined. Estimation procedures are discussed, including new methods for Monte Carlo maximum likelihood estimation. We foreshadow the discussion taken up in other papers in this special edition: that the homogeneous Markov random graph models of Frank and Strauss [Frank, O., Strauss, D., 1986. Markov graphs. Journal of the American Statistical Association 81, 832–842] are not appropriate for many observed networks, whereas the new model specifications of Snijders et al. [Snijders, T.A.B., Pattison, P., Robins, G.L., Handock, M. New specifications for exponential random graph models. Sociological Methodology, in press] offer substantial improvement.     

A Bayesian approach for the reliability of scientific co-authorship networks with emphasis on nodes

The co-authorship among members of a research group commonly can be represented by a (co-authorship) graph in which nodes represent the researchers that make up of this group and edges represent the connections between two agents (i.e., the co-authorship between these agents). Current study measures the reliability of networks by taking into consideration unreliable nodes (researchers) and perfectly reliable edges (co-authorship between two researchers). A Bayesian approach for the reliability of a network represented by the co-authorship among members of a real research group is proposed, obtaining Bayesian estimates and credibility intervals for the individual components (nodes or researchers) and the network. Weakly informative and non-informative prior distributions are assumed for those components and the posterior summaries are obtained by Monte Carlo-Markov Chain methods. The results show the relevance of an inferential approach for the reliability of scientific co-authorship network. The results also demonstrate that the contribution of each researcher is highly relevant for the maintenance of a research group. In addition, the Bayesian methodology was a feasible and easy computational implementation.     

A model for the multiplex dynamics of two-mode and one-mode networks,with an application to employment preference,friendship, and advice

We propose a new stochastic actor-oriented model for the co-evolution of two-mode and one-mode networks. The model posits that activities of a set of actors, represented in the two-mode network, co-evolve with exchanges and interactions between the actors, as represented in the one-mode network. The model assumes that the actors, not the activities, have agency.     

Multilevel embeddedness: The case of the global fisheries governance complex

This paper explores how bilateral and multilateral clustering are embedded in a multilevel system of interdependent networks. We argue that in complex systems in which bilateral and multilateral relations are themselves interrelated, such as global fisheries governance, embeddedness cannot be reduced to unipartite or bipartite clustering but implicates multilevel closure. We elaborate expectations for ties’ multilevel embeddedness based on network theory and substantive considerations and explore them using a multilevel ERGM. We find states’ bilateral ties are embedded in their shared membership in multilateral fisheries agreements, which is itself clustered around foci represented by similar content and treaty secretariats.     

Duocentered networks

When a pair of individuals is central to a research problem (e.g., husband and wife, PhD student and supervisor) the concept of “duocentered” networks can be defined as a useful extension of egocentered networks. This new structure consists of a pair of central egos and their direct links with alters, instead of just one central ego as in the egocentered networks or multiple egos as in complete networks. The key point in this kind of network is that ties exist between the central pair of egos and between them and all alters, but the ties among alters are not considered. Duocentered networks can also be considered as a compromise between egocentered and complete networks. Complete network measurements are often costly to obtain and tend to contain a large proportion of missing data (especially for peripheral actors). Egocentered network data are less costly but a lot of information is lost with their use when a pair of individuals is the relevant unit of analysis.     

How social exclusion distorts social network perceptions

In two studies we investigate whether social exclusion—a well-studied, common and quite painful social experience-influences people's perceptions of novel social networks. In a first study, exclusion experiences led people to report that novel networks were more dense relative to those who had not been excluded. As predicted, this was true only for social networks; exclusion had no impact on perceptions when networks were described as geographical. In a follow-up experiment, participants watched a custom-created video, depicting avatars interacting in social scenes and they were asked to report the ties among the avatars in the video. Exclusion experiences led people to see network ties where none exist (i.e., false positives), though there was no effect for exclusion (versus inclusion) on reports of false negatives. Results indicate that common social experiences systematically shape network perceptions, leading people to seeing novel social networks as more densely connected than they are.     

Multilevel models for social networks: Hierarchical Bayesian approaches to exponential random graph modeling

In many applications, researchers may be interested in studying patterns of dyadic relationships that involve multiple groups, with a focus on modeling the systematic patterns within groups and how these structural patterns differ across groups. A number of different models – many of them potentially quite powerful – have been developed that allow for researchers to study these differences. However, as with any set of models, these are limited in ways that constrain the types of questions researchers may ask, such as those involving the variance in group-wise structural features. In this paper, we demonstrate some of the ways in which multilevel models based on a hierarchical Bayesian approach might be used to further develop and extend existing exponential random graph models to address such constraints. These include random coefficient extensions to the standard ERGM for sets of multiple unconnected or connected networks and examples of multilevel models that allow for the estimation of structural entrainment among connected groups. We demonstrate the application of these models to real-world and simulated data sets.     

The stability of exchange networks

Economic and sociological exchange theories predict divisions of exchange benefits given an assumed fixed network of exchange relations. Since network structure has been found to have a large impact on actors’ payoffs, actors have strong incentives for network change. We answer the question what happens to both the network structure and actor payoffs when myopic actors change their links in order to maximize their payoffs. We investigate the networks that are stable, the networks that are efficient or egalitarian with varying tie costs, and the occurrence of social dilemmas. Only few networks are stable over a wide range of tie costs, and all of them can be divided into two types: efficient networks consisting of only dyads and at most one isolate, and Pareto efficient and egalitarian cycles with an odd number of actors. Social dilemmas are observed in even-sized networks at low tie costs.     

Keep around,drop, or revise? exploring what becomes of difficult ties in personal networks

Previous studies increasingly recognize the presence and impact of difficult individuals within personal networks. However, current research sheds little light on the turnover, retention, and change in quality of such difficult ties. The current study addresses this gap by focusing on two distinct forms of network change. We examine how role relationships, support exchange, relational homophily, and personal characteristics are associated with these processes. Data are drawn from three waves of the University of California Social Network Study (UCNets), a project containing comprehensive longitudinal data on ego networks among two adult cohorts. Findings indicate that over time, 34% of difficult ties re-appear in people’s networks as sources of aggravation; 26% of difficult ties are removed from the network; and 40% can no longer be verified as problematic network members. Most ties no longer deemed difficult are identified as providing one or more supportive functions. Multinomial multilevel models reveal that exchanging support tends to anchor difficult ties in the network. Kinship, meanwhile, plays a large role in whether difficult ties remain or get dropped. Personal characteristics such as gender, income, and relocation also play a role in these processes. Overall, we conclude that the turnover dynamics of difficult ties are similar to other ties, and the apparent change from negative to positive suggests that many ties hold ambivalent properties that make shedding such ties less common than may be expected.     

Assessing the performance of the bootstrap in simulated assemblage networks

Archaeologists are increasingly interested in networks constructed from site assemblage data, in which weighted network ties reflect sites’ assemblage similarity. Equivalent networks would arise in other scientific fields where actors’ similarity is assessed by comparing distributions of observed counts, so the assemblages studied here can represent other kinds of distributions in other domains. One concern with such work is that sampling variability in the assemblage network and, in turn, sampling variability in measures calculated from the network must be recognized in any comprehensive analysis. In this study, we investigated the use of the bootstrap as a means of estimating sampling variability in measures of assemblage networks. We evaluated the performance of the bootstrap in simulated assemblage networks, using a probability structure based on the actual distribution of sherds of ceramic wares in a region with 25 archaeological sites. Results indicated that the bootstrap was successful in estimating the true sampling variability of eigenvector centrality for the 25 sites. This held both for centrality scores and for centrality ranks, as well as the ratio of first to second eigenvalues of the network (similarity) matrix. Findings encourage the use of the bootstrap as a tool in analyses of network data derived from counts.