Exponential random graph models for multilevel networks

Modern multilevel analysis, whereby outcomes of individuals within groups take into account group membership, has been accompanied by impressive theoretical development (e.g. Kozlowski and Klein, 2000) and sophisticated methodology (e.g. Snijders and Bosker, 2012). But typically the approach assumes that links between groups are non-existent, and interdependence among the individuals derives solely from common group membership. It is not plausible that such groups have no internal structure nor they have no links between each other. Networks provide a more complex representation of interdependence. Drawing on a small but crucial body of existing work, we present a general formulation of a multilevel network structure. We extend exponential random graph models (ERGMs) to multilevel networks, and investigate the properties of the proposed models using simulations which show that even very simple meso effects can create structure at one or both levels. We use an empirical example of a collaboration network about French cancer research elites and their affiliations (0125 and 0120) to demonstrate that a full understanding of the network structure requires the cross-level parameters. We see these as the first steps in a full elaboration for general multilevel network analysis using ERGMs.     

A comparison of email networks and off-line social networks: A study of a medium-sized bank

Recently there has been a surge in the availability of online data concerning the connections between people, and these online data are now widely used to map the social structure of communities. There has been little research, however, on how these new types of relational data correspond to classical measures of social networks. To fill this gap, we contrast the structure of an email network with the underlying friendship, communication, and advice seeking networks. Our study is an explorative case study of a bank, and our data contains emails among employees and a survey of the ego networks of the employees. Through calculating correlations with QAP standard errors and estimating exponential random graph (ERG) models, we find that although the email network is related to the survey-based social networks, email networks are also significantly different: while off-line social networks are strongly shaped by gender, tenure, and hierarchical boundaries, the role of these boundaries are much weaker in the email network.     

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.     

Measuring structural HIV stigma

Despite the progress in pharmaceutical and epidemiological tools for combating HIV spread, HIV stigma remains a significant social barrier impeding treatment and prevention efforts, potentially reducing the effectiveness of interventions to reduce HIV transmission. In this paper, we propose a novel approach to defining and estimating HIV stigmatization through the structure of sexual relations, as opposed to attitudes. We conceptualize structural stigma as arising from two mechanisms: (1) a reduced propensity towards HIV serodiscordant partnerships (exclusion); and (2) a reduced propensity towards partnerships with seroconcordant individuals who themselves have serodiscordant partnerships (ostracism). Both mechanisms can be assessed from observed partnership network data using exponential family random graph models (ERGMs). We demonstrate our approach on a sexual contact network of black men who have sex with men in the South Side of Chicago. We find a tendency for serodiscordant sexual relationships to be suppressed in the network ($\theta$ = −0.69, p $<$ .05), as well as a suppressive tendency for HIV negative YBMSM to have sex with other HIV negative people in serodiscordant relationships ($\theta$ = −0.96, p $<$ .05) suggesting that structural HIV stigma is present in this network. Potential relationships with attitudinal stigma and implications for epidemiological strategies for reducing HIV stigma are discussed.     

The local and global structure of knowledge production in an emergent research field: An exponential random graph analysis

Previous research has characterized knowledge networks by diffuse connectivity and/or clusters and the absence of centrality. In contrast, exponential random graph models used in this article demonstrate that the uncertainty and centralized influence typical of an emerging area of research leads to the creation of a densely interconnecting core that acts to cohere the network. Moreover, eclecticism and innovativeness, also characteristic of a developing area, lead to a diffusely connected structure. The data, comprising 2200 authors and 76 papers have been manually coded from articles on the feminization of the labor force in Asia.     

Exponential random graph model specifications for bipartite networks—A dependence hierarchy

In this paper, we review the development of dependence structures for exponential random graph models for bipartite networks, and propose a hierarchy of dependence structures within which different dependence assumptions may be located. Based on this hierarchy, we propose a new set of model specifications by including bipartite graph configurations involving more than four nodes. We discuss the theoretical significance of the various effects that the extended models afford, and illustrate application of this hierarchy of models to several bipartite networks related to the political mobilization in Brazil in the early 1990s (Mische, 2007).     

A comparative study of social network models: Network evolution models and nodal attribute models

This paper reviews, classifies and compares recent models for social networks that have mainly been published within the physics-oriented complex networks literature. The models fall into two categories: those in which the addition of new links is dependent on the (typically local) network structure (network evolution models, NEMs), and those in which links are generated based only on nodal attributes (nodal attribute models, NAMs). An exponential random graph model (ERGM) with structural dependencies is included for comparison. We fit models from each of these categories to two empirical acquaintance networks with respect to basic network properties. We compare higher order structures in the resulting networks with those in the data, with the aim of determining which models produce the most realistic network structure with respect to degree distributions, assortativity, clustering spectra, geodesic path distributions, and community structure (subgroups with dense internal connections). We find that the nodal attribute models successfully produce assortative networks and very clear community structure. However, they generate unrealistic clustering spectra and peaked degree distributions that do not match empirical data on large social networks. On the other hand, many of the network evolution models produce degree distributions and clustering spectra that agree more closely with data. They also generate assortative networks and community structure, although often not to the same extent as in the data. The ERGM model, which turned out to be near-degenerate in the parameter region best fitting our data, produces the weakest community structure.     

Criminal collaboration and risk: The drivers of Al Qaeda’s network structure before and after 9/11

A group’s resilience is often linked to its network structure. While decentralized network properties have been associated with resilience at the group-level, little is known about the individual-level factors that lead groups to adopt these structures. Criminal groups, consistently faced with unexpected external disruptions, provide an opportunity to examine individual decisions to collaborate across periods of increased risk. Using data on 118 terrorist offenders across six attacks we test whether individual decisions to collaborate are influenced by variation in law enforcement activity. Results from exponential random graph models demonstrate that many of the processes that drive collaboration between offenders differ when faced with greater risk. Connectivity was maximized in periods of decreased enforcement activity, with offenders more likely to collaborate in dense, local triads. Following an increase in interdictions, triad closure had no impact on co-offending.     

Obesity-related behaviors in adolescent friendship networks

This study examines obesity-related behaviors within adolescent friendship networks, because adolescent peers have been identified as being important determinants of many health behaviors. We applied ERGM selection models for single network observations to determine if close adolescent friends engage in similar behaviors and to explore associations between behavior and popularity. Same-sex friends were found to be similar on measures of organized physical activity in two out of three school-based friendship networks. Female friends were found to engage in similar screen-based behaviors, and male friends tended to be similar in their consumption of high-calorie foods. Popularity (receiving ties) was also associated with some behaviors, although these effects were gender specific and differed across networks.     

Closure,connectivity and degree distributions: Exponential random graph (p*) models for directed social networks

The new higher order specifications for exponential random graph models introduced by Snijders et al. [Snijders, T.A.B., Pattison, P.E., Robins G.L., Handcock, M., 2006. New specifications for exponential random graph models. Sociological Methodology 36, 99–153] exhibit substantial improvements in model fit compared with the commonly used Markov random graph models. Snijders et al., however, concentrated on non-directed graphs, with only limited extensions to directed graphs. In particular, they presented a transitive closure parameter based on path shortening. In this paper, we explain the theoretical and empirical advantages in generalizing to additional closure effects. We propose three new triadic-based parameters to represent different versions of triadic closure: cyclic effects; transitivity based on shared choices of partners; and transitivity based on shared popularity. We interpret the last two effects as forms of structural homophily, where ties emerge because nodes share a form of localized structural equivalence. We show that, for some datasets, the path shortening parameter is insufficient for practical modeling, whereas the structural homophily parameters can produce useful models with distinctive interpretations. We also introduce corresponding lower order effects for multiple two-path connectivity. We show by example that the in- and out-degree distributions may be better modeled when star-based parameters are supplemented with parameters for the number of isolated nodes, sources (nodes with zero in-degrees) and sinks (nodes with zero out-degrees). Inclusion of a Markov mixed star parameter may also help model the correlation between in- and out-degrees. We select some 50 graph features to be investigated in goodness of fit diagnostics, covering a variety of important network properties including density, reciprocity, geodesic distributions, degree distributions, and various forms of closure. As empirical illustrations, we develop models for two sets of organizational network data: a trust network within a training group, and a work difficulty network within a government instrumentality.     

Networks and geography: Modelling community network structures as the outcome of both spatial and network processes

This paper focuses on how to extend the exponential random graph models to take into account the geographical embeddedness of individuals in modelling social networks. We develop a hierarchical set of nested models for spatially embedded social networks, in which, following Butts (2002), an interaction function between tie probability and Euclidean distance between nodes is introduced. The models are illustrated by an empirical example from a study of the role of social networks in understanding spatial clustering in unemployment in Australia. The analysis suggests that a spatial effect cannot solely explain the emergence of organised network structure and it is necessary to include both spatial and endogenous network effects in the model.     

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.     

Recent developments in exponential random graph (p*) models for social networks

This article reviews new specifications for exponential random graph models proposed by Snijders et al. [Snijders, T.A.B., Pattison, P., Robins, G.L., Handcock, M., 2006. New specifications for exponential random graph models. Sociological Methodology] and demonstrates their improvement over homogeneous Markov random graph models in fitting empirical network data. Not only do the new specifications show improvements in goodness of fit for various data sets, but they also help to avoid the problem of near-degeneracy that often afflicts the fitting of Markov random graph models in practice, particularly to network data exhibiting high levels of transitivity. The inclusion of a new higher order transitivity statistic allows estimation of parameters of exponential graph models for many (but not all) cases where it is impossible to estimate parameters of homogeneous Markov graph models. The new specifications were used to model a large number of classical small-scale network data sets and showed a dramatically better performance than Markov graph models. We also review three current programs for obtaining maximum likelihood estimates of model parameters and we compare these Monte Carlo maximum likelihood estimates with less accurate pseudo-likelihood estimates. Finally, we discuss whether homogeneous Markov random graph models may be superseded by the new specifications, and how additional elaborations may further improve model performance.     

Social networks and spatial configuration—How office layouts drive social interaction

This paper analyzes the spatial dimensions of office layouts in diverse knowledge-intensive workplace environments based on the theoretical and methodological propositions of Space Syntax, and brings this together with the analysis of intra-organizational interaction networks. Physical distances between agents are modeled in different ways and used as explanatory variables in exponential random graph modeling. The paper shows that spatial configuration in offices can be considered an important but not sole rationale for tie formation. Furthermore, it is shown that spatial distance measures based on detailed configurational analysis outperform simple Euclidean distance metrics in predicting social ties.     

A model for collaboration networks giving rise to a power-law distribution with an exponential cutoff

Recently several authors have proposed stochastic evolutionary models for the growth of complex networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the “rich get richer” phenomenon. Despite the generality of the proposed stochastic models, there are still some unexplained phenomena, which may arise due to the limited size of networks such as protein, e-mail, actor and collaboration networks. Such networks may in fact exhibit an exponential cutoff in the power-law scaling, although this cutoff may only be observable in the tail of the distribution for extremely large networks. We propose a modification of the basic stochastic evolutionary model, so that after a node is chosen preferentially, say according to the number of its inlinks, there is a small probability that this node will become inactive. We show that as a result of this modification, by viewing the stochastic process in terms of an urn transfer model, we obtain a power-law distribution with an exponential cutoff. Unlike many other models, the current model can capture instances where the exponent of the distribution is less than or equal to two. As a proof of concept, we demonstrate the consistency of our model empirically by analysing the Mathematical Research collaboration network, the distribution of which has been shown to be compatible with a power law with an exponential cutoff.     

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.     

Efficient Bayesian inference for exponential random graph models by correcting the pseudo-posterior distribution

Exponential random graph models are an important tool in the statistical analysis of data. However, Bayesian parameter estimation for these models is extremely challenging, since evaluation of the posterior distribution typically involves the calculation of an intractable normalizing constant. This barrier motivates the consideration of tractable approximations to the likelihood function, such as the pseudolikelihood function, which offers an approach to constructing such an approximation. Naive implementation of what we term a pseudo-posterior resulting from replacing the likelihood function in the posterior distribution by the pseudolikelihood is likely to give misleading inferences. We provide practical guidelines to correct a sample from such a pseudo-posterior distribution so that it is approximately distributed from the target posterior distribution and discuss the computational and statistical efficiency that result from this approach. We illustrate our methodology through the analysis of real-world graphs. Comparisons against the approximate exchange algorithm of Caimo and Friel (2011) are provided, followed by concluding remarks.     

Bayesian exponential random graph models with nodal random effects

We extend the well-known and widely used exponential random graph model (ERGM) by including nodal random effects to compensate for heterogeneity in the nodes of a network. The Bayesian framework for ERGMs proposed by Caimo and Friel (2011) yields the basis of our modelling algorithm. A central question in network models is the question of model selection and following the Bayesian paradigm we focus on estimating Bayes factors. To do so we develop an approximate but feasible calculation of the Bayes factor which allows one to pursue model selection. Three data examples and a small simulation study illustrate our mixed model approach and the corresponding model selection.     

Advances in Exponential Random Graph (p*) Models Applied to a Large Social Network

Recent advances in statistical network analysis based on the family of exponential random graph (ERG) models have greatly improved our ability to conduct inference on dependence in large social networks (Snijders 2002, Pattison and Robins 2002, Handcock 2002, Handcock 2003, Snijders et al. 2006, Hunter et al. 2005, Goodreau et al. 2005, previous papers this issue). This paper applies advances in both model parameterizations and computational algorithms to an examination of the structure observed in an adolescent friendship network of 1,681 actors from the National Longitudinal Study of Adolescent Health (AddHealth). ERG models of social network structure are fit using the R package statnet, and their adequacy assessed through comparison of model predictions with the observed data for higher-order network statistics.For this friendship network, the commonly used model of Markov dependence leads to the problems of degeneracy discussed by Handcock (2002, 2003). On the other hand, model parameterizations introduced by Snijders et al (2006) and Hunter and Handcock (2006) avoid degeneracy and provide reasonable fit to the data. Degree-only models did a poor job of capturing observed network structure; those that did best included terms both for heterogeneous mixing on exogenous attributes (grade and self-reported race) as well as endogenous clustering. Networks simulated from this model were largely consistent with the observed network on multiple higher-order network statistics, including the number of triangles, the size of the largest component, the overall reachability, the distribution of geodesic distances, the degree distribution, and the shared partner distribution. The ability to fit such models to large datasets and to make inference about the underling processes generating the network represents a major advance in the field of statistical network analysis.