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.     

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.     

Analysing networks of networks

We consider data with multiple observations or reports on a network in the case when these networks themselves are connected through some form of network ties. We could take the example of a cognitive social structure where there is another type of tie connecting the actors that provide the reports; or the study of interpersonal spillover effects from one cultural domain to another facilitated by the social ties. Another example is when the individual semantic structures are represented as semantic networks of a group of actors and connected through these actors’ social ties to constitute knowledge of a social group. How to jointly represent the two types of networks is not trivial as the layers and not the nodes of the layers of the reported networks are coupled through a network on the reports. We propose to transform the different multiple networks using line graphs, where actors are affiliated with ties represented as nodes, and represent the totality of the different types of ties as a multilevel network. This affords studying the associations between the social network and the reports as well as the alignment of the reports to a criterion graph. We illustrate how the procedure can be applied to studying the social construction of knowledge in local flood management groups. Here we use multilevel exponential random graph models but the representation also lends itself to stochastic actor-oriented models, multilevel blockmodels, and any model capable of handling multilevel networks.     

Networks of action and events over time. A multilevel discrete-time event history model for longitudinal network data

Longitudinal network data recording the moment at which ties appear, change, or disappear are increasingly available. Event history models can be used to analyze the dynamics of time-stamped network data. This paper adapts the discrete-time event history model to social network data. A discrete-time event history model can easily incorporate a multilevel design and time-varying covariates. A multilevel design is needed to account for dependencies among ties and vertices, which should not be ignored in a small longitudinal network. Time-varying covariates are required to analyze network effects, that is, the impact of previous ties. In addition, a discrete-time event history model handles constraints on who can act or who can be acted upon in a straightforward way. The model can be estimated with multilevel logistic regression analysis, which is illustrated by an application to book reviews, so network evolution can be analyzed with a fairly standard statistical tool.     

Addressing self-selection effects in evaluations of mutual help groups and professional mental health services: An introduction to two-stage sample selection models

Because random assignment to conditions is often neither possible nor desirable in longitudinal evaluations of mutual help organizations, the influence of self-selection effects must be assessed in order to accurately interpret outcome data. One approach to adjusting for self-selection effects is to control for covariates that predict outcome using statistical procedures such as analysis of covariance (ANCOVA), partial correlations, and hierarchical regression. This approach has considerable power, but is less useful when an evaluator is interested in directly modeling the process of entry into a program and incorporating information on the factors affecting self-selection into estimation of program effects. Two-stage sample selection models are designed to address such situations. These models rely on regression procedures in which program participation is modeled in an initial equation, which yields a sample selection correction factor. The correction factor is included with participation in a second equation that predicts outcome. This two-stage procedure allows the evaluator to interpret the observed effects of a professional service or a self-help group in the context of the magnitude and direction of selection effects. We compare and contrast the covariate control and sample selection models in a longitudinal study of the effects of participation in Alcoholics Anonymous on drinking behavior.     

Research note: The consequences of different methods for handling missing network data in stochastic actor based models

Although stochastic actor-based models (e.g., as implemented in the SIENA software program) are growing in popularity as a technique for estimating longitudinal network data, a relatively understudied issue is the consequence of missing network data for longitudinal analysis. We explore this issue in our research note by utilizing data from four schools in an existing dataset (the AddHealth dataset) over three time points, assessing the substantive consequences of using four different strategies for addressing missing network data. The results indicate that whereas some measures in such models are estimated relatively robustly regardless of the strategy chosen for addressing missing network data, some of the substantive conclusions will differ based on the missing data strategy chosen. These results have important implications for this burgeoning applied research area, implying that researchers should more carefully consider how they address missing data when estimating such models.     

Exploring the joint dynamics of intercity internet and corporate networks: a stochastic actor‐based modelling approach

In this article, I show one possible solution to synthesis dynamics in multiple intercity networks. I adopt a stochastic actor‐based modelling approach to explore the co‐evolution of an intercity corporate network of 57 globalized advanced producer service firms across 93 cities, and another intercity internet network between these 93 cities, for the period 2004–2010. Stochastic actor‐based models (SABMs) help to connect interactions among cities and firms on the local scale with empirically observed networks on the global scale. My analysis accounts for the co‐evolution/interdependence among multiple world city networks (WCNs) and associated network changes in individual WCNs with exogenous city‐related covariates and endogenous local network structures.     

Stochastic blockmodels: First steps

A stochastic model is proposed for social networks in which the actors in a network are partitioned into subgroups called blocks. The model provides a stochastic generalization of the blockmodel. Estimation techniques are developed for the special case of a single relation social network, with blocks specified a priori. An extension of the model allows for tendencies toward reciprocation of ties beyond those explained by the partition. The extended model provides a one degree-of-freedom test of the model. A numerical example from the social network literature is used to illustrate the methods.     

Network autocorrelation models with egocentric data

Network autocorrelation models have been widely used for decades to model the joint distribution of the attributes of a network's actors. This class of models can estimate both the effect of individual characteristics as well as the network effect, or social influence, on some actor attribute of interest. Collecting data on the entire network, however, is very often infeasible or impossible if the network boundary is unknown or difficult to define. Obtaining egocentric network data overcomes these obstacles, but as of yet there has been no clear way to model this type of data and still appropriately capture the network effect on the actor attributes in a way that is compatible with a joint distribution on the full network data. This paper adapts the class of network autocorrelation models to handle egocentric data. The proposed methods thus incorporate the complex dependence structure of the data induced by the network rather than simply using ad hoc measures of the egos’ networks to model the mean structure, and can estimate the network effect on the actor attribute of interest. The vast quantities of unknown information about the network can be succinctly represented in such a way that only depends on the number of alters in the egocentric network data and not on the total number of actors in the network. Estimation is done within a Bayesian framework. A simulation study is performed to evaluate the estimation performance, and an egocentric data set is analyzed where the aim is to determine if there is a network effect on environmental mastery, an important aspect of psychological well-being.     

Does proximity matter? Distance dependence of adolescent friendships

Geographic proximity is a determinant factor of friendship. Friendship datasets that include detailed geographic information are scarce, and when this information is available, the dependence of friendship on distance is often modelled by pre-specified parametric functions or derived from theory without further empirical assessment. This paper aims to give a detailed representation of the association between distance and the likelihood of friendship existence and friendship dynamics, and how this is modified by a few basic social and individual factors. The data employed is a three-wave network of 336 adolescents living in a small Swedish town, for whom information has been collected on their household locations. The analysis is a three-step process that combines (1) nonparametric logistic regressions to unravel the overall functional form of the dependence of friendship on distance, without assuming it has a particular strength or shape; (2) parametric logistic regressions to construct suitable transformations of distance that can be employed in (3) stochastic models for longitudinal network data, to assess how distance, individual covariates, and network structure shape adolescent friendship dynamics. It was found that the log-odds of friendship existence and friendship dynamics decrease smoothly with the logarithm of distance. For adolescents in different schools the dependence is linear, and stronger than for adolescents in the same school. Living nearby accounts, in this dataset, for an aspect of friendship dynamics that is not explicitly modelled by network structure or by individual covariates. In particular, the estimated distance effect is not correlated with reciprocity or transitivity effects.     

Modelling the evolution of a bipartite network—Peer referral in interlocking directorates

A central part of relational ties between social actors is constituted by shared affiliations and events. The action of joint participation reinforces personal ties between social actors as well as mutually shared values and norms that in turn perpetuate the patterns of social action that define groups. Therefore the study of bipartite networks is central to social science. Furthermore, the dynamics of these processes suggests that bipartite networks should not be considered static structures but rather be studied over time. In order to model the evolution of bipartite networks empirically we introduce a class of models and a Bayesian inference scheme that extends previous stochastic actor-oriented models for unimodal graphs. Contemporary research on interlocking directorates provides an area of research in which it seems reasonable to apply the model. Specifically, we address the question of how tie formation, i.e. director recruitment, contributes to the structural properties of the interlocking directorate network. For boards of directors on the Stockholm stock exchange we propose that a prolific mechanism in tie formation is that of peer referral. The results indicate that such a mechanism is present, generating multiple interlocks between boards.     

Analyzing event stream dynamics in two-mode networks: An exploratory analysis of private communication in a question and answer community

Information about social networks can often be collected as event stream data. However, most methods in social network analysis are defined for static network snapshots or for panel data. We propose an actor oriented Markov process framework to analyze the structural dynamics in event streams. Estimated parameters are similar to what is known from exponential random graph models or stochastic actor oriented models as implemented in SIENA. We apply the methodology on a question and answer web community and show how the relevance of different kinds of one- and two-mode network structures can be tested using a new software.     

Actor and event orderings across time: Lattice representation and Boolean analysis of the political disputes in Chen Village,China

So far qualitative data on political disputes in a Chinese community, 1950–1980, have been presented in a narrative historical account (Chan, Madsen and Unger, 1984, Chen Village. The Recent History of a Peasant Community in Mao's China, University of California Press) and analyzed with statistical network tools (Schweizer, 1991, Journal of Quantitative Anthropology, 3, 19–44). In this paper, lattice and Boolean analyses are applied as new procedures. First, lattice analysis is used to explore the dual order structure among actors and events in different periods. This gives a systematic understanding of the power struggle across time. Second, Boolean algebra is applied to specify and test explanatory hypotheses trying to account for the success or failure of actors in the disputes. In this application Boolean analysis detects multivariate causal order patterns in a small and qualitative data set.     

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.     

Dynamic network analysis of contact diaries

Analyzing two-mode networks linking actors to events they attend may help to uncover the structure and evolution of social networks. This classic social network insight is particularly valuable in the analysis of data extracted from contact diaries where contact events produce — and at the same time are the product of relations among participants. Contact events may comprise any number of actors meeting at a specific point in time. In this paper we recall the correspondence between two-mode actor–event networks and hypergraphs, and propose relational hyperevent models (RHEM) as a general modeling framework for networks of time-stamped multi-actor events in which the diarist (“ego”) simultaneously meets several of her alters. RHEM can estimate event intensities associated with each possible subset of actors that may jointly participate in events, and test network effects that may be of theoretical or empirical interest. Examples of such effects include preferential attachment, prior shared activity (familiarity), closure, and covariate effects explaining the propensity of actors to co-attend events. Statistical tests of these effects can uncover processes that govern the formation and evolution of informal groups among the diarist’s alters. We illustrate the empirical value of RHEM using data comprising almost 2000 meeting events of former British Prime Minister Margaret Thatcher with her cabinet ministers, transcribed from contact diaries covering her first term in office (1979–1983).     

Learning in social networks: Selecting profitable choices among alternatives of uncertain profitability in various networks

Social capital theory assumes that information is valuable. However, only rarely is this value explicitly modeled, and there are few examples of empirical tests of mechanisms that connect social network structure to valuable information. We model an individual decision problem in which individuals make choices that yield uncertain outcomes. The individuals can learn about the profitability of options from their own choices and from the network. We generate computer-simulated data to derive hypotheses about the effect of network characteristics on making profitable choices. We conduct a laboratory experiment to empirically test these hypotheses and find that, at the individual level, degree centrality has a positive effect on making profitable choices whereas betweenness centrality has no effect. At the network level, density has a positive effect on making profitable choices, whereas centralization does not have an effect.     

NEW SPECIFICATIONS FOR EXPONENTIAL RANDOM GRAPH MODELS

The most promising class of statistical models for expressing structural properties of social networks observed at one moment in time is the class of exponential random graph models (ERGMs), also known as p * models. The strong point of these models is that they can represent a variety of structural tendencies, such as transitivity, that define complicated dependence patterns not easily modeled by more basic probability models. Recently, Markov chain Monte Carlo (MCMC) algorithms have been developed that produce approximate maximum likelihood estimators. Applying these models in their traditional specification to observed network data often has led to problems, however, which can be traced back to the fact that important parts of the parameter space correspond to nearly degenerate distributions, which may lead to convergence problems of estimation algorithms, and a poor fit to empirical data.
This paper proposes new specifications of exponential random graph models. These specifications represent structural properties such as transitivity and heterogeneity of degrees by more complicated graph statistics than the traditional star and triangle counts. Three kinds of statistics are proposed: geometrically weighted degree distributions, alternating k -triangles, and alternating independent two-paths. Examples are presented both of modeling graphs and digraphs, in which the new specifications lead to much better results than the earlier existing specifications of the ERGM. It is concluded that the new specifications increase the range and applicability of the ERGM as a tool for the statistical analysis of social networks.     

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.     

Logit Models for Affiliation Networks

Once confined to networks in which dyads could be reasonably assumed to be independent, the statistical analysis of network data has blossomed in recent years. New modeling and estimation strategies have made it possible to propose and evaluate very complex structures of dependency between and among ties in social networks. These advances have focused exclusively on one-mode networks—that is, networks of direct ties between actors. We generalize these models to affiliation networks, networks in which actors are tied to each other only indirectly through belonging to some group or event. We formulate models that allow us to study the (log) odds of an actor's belonging to an event (or an event including an actor) as a function of properties of the two-mode network of actors' memberships in events. We also provide illustrative analysis of some classic data sets on affiliation networks.     

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.