Triadic closure in two-mode networks: Redefining the global and local clustering coefficients

As the vast majority of network measures are defined for one-mode networks, two-mode networks often have to be projected onto one-mode networks to be analyzed. A number of issues arise in this transformation process, especially when analyzing ties among nodes’ contacts. For example, the values attained by the global and local clustering coefficients on projected random two-mode networks deviate from the expected values in corresponding classical one-mode networks. Moreover, both the local clustering coefficient and constraint (structural holes) are inversely associated to nodes’ two-mode degree. To overcome these issues, this paper proposes redefinitions of the clustering coefficients for two-mode networks.     

Partitioning large signed two-mode networks: Problems and prospects

While a substantial amount of attention within social network analysis (SNA) has been given to the study of one-mode networks, there is an increasing consideration of two-mode networks. Recent research on signed networks resulted in the relaxed structural balance (RSB) approach and its subsequent extension to signed two-mode networks involving social actors and social objects. We extend this approach to large signed two-mode networks, and address the methodological issues that arise. We develop tools to partition these types of networks and compare them with other approaches using a recently collected dataset of United Nations General Assembly roll call votes. Although our primary purpose is methodological, we take the first step towards bridging Heider's structural balance theory with recent theorizing in international relations on soft balancing of power processes.     

k-means-based algorithm for blockmodeling linked networks

The paper presents a k-means-based algorithm for blockmodeling linked networks where linked networks are defined as a collection of one-mode and two-mode networks in which units from different one-mode networks are connected through two-mode networks. The reason for this is that a faster algorithm is needed for blockmodeling linked networks that can better scale to larger networks. Examples of linked networks include multilevel networks, dynamic networks, dynamic multilevel networks, and meta-networks. Generalized blockmodeling has been developed for linked/multilevel networks, yet the generalized blockmodeling approach is too slow for analyzing larger networks. Therefore, the flexibility of generalized blockmodeling is sacrificed for the speed of k-means-based approaches, thus allowing the analysis of larger networks. The presented algorithm is based on the two-mode k-means (or KL-means) algorithm for two-mode networks or matrices. As a side product, an algorithm for one-mode blockmodeling of one-mode networks is presented. The algorithm’s use on a dynamic multilevel network with more than 400 units is presented. A situation study is also conducted which shows that k-means based algorithms are superior to relocation algorithm-based methods for larger networks (e.g. larger than 800 units) and never much worse.     

Structural holes and bridging in two-mode networks

Social networks are often structured in such a way that there are gaps, or “structural holes,” between regions. Some actors are in the position to bridge or span these gaps, giving rise to individual advantages relating to brokerage, gatekeeping, access to non-redundant contacts, and control over network flows. The most widely used measures of a given actor’s bridging potential gauge the extent to which that actor is directly connected to others who are otherwise not well connected to each other. Unfortunately, the measures that have been developed to identify structural holes cannot be adapted directly to two-mode networks, like individual-to-organization networks. In two-mode networks, direct contacts cannot be directly connected to each other by definition, making the calculation of redundancy, effective size, and constraint impossible with conventional one-mode methods. We therefore describe a new framework for the measurement of bridging in two-mode networks that hinges on the mathematical concept of the intersection of sets. An actor in a given node class (“ego”) has bridging potential to the extent that s/he is connected to actors in the opposite node class that have unique profiles of connections to actors in ego’s own node class. We review the relevant literature pertaining to structural holes in two-mode networks, and we compare our primary bridging measure (effective size) to measures of bridging that result when using one-mode projections of two-mode data. We demonstrate the results of applying our approach to empirical data on the organizational affiliations of elites in a large U.S. city.     

Two-mode relational similarities

In a previous paper, Kovacs (2010) proposed a generalized relational similarity measure based on iterated correlations of entities in a network calibrated by their relational similarity to other entities. Here I show that, in the case of two-mode network data, Kovacs’s approach can be simplified and generalized similarities calculated non-iteratively. The basic idea is to rely on initial similarities calculated from transforming the two-mode data into one-mode projections using the familiar duality approach due to Breiger (1974). I refer to this as two-mode relational similarities and show, using the Southern Women’s data and data from Senate voting in the 112th U.S. Congress, that it yields results substantively indistinguishable from Kovacs’s iterative strategy.     

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).     

The dual-projection approach for two-mode networks

There have been two distinct approaches to two-mode data. The first approach is to project the data to one-mode and then analyze the projected network using standard single-mode techniques, also called the conversion method. The second approach has been to extend methods and concepts to the two-mode case and analyze the network directly with the two modes considered jointly. The direct approach in recent years has been the preferred method since it is assumed that the conversion method loses important structural information. Here we argue that this is not the case, provided both projections are used together in any analysis. We illustrate how this approach works using core/periphery, structural equivalence and centrality as examples.     

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.     

Measuring knowledge and experience in two mode temporal networks

Two mode social network data consisting of actors attending events is a common type of social network data. For these kinds of data it is also common to have additional information about the timing or sequence of the events. We call data of this type two-mode temporal data. We explore the idea that actors attending events gain information from the event in two ways. Firstly the event itself may provide information or training; secondly, as co-attendees interact, they may pass on skills or information they have gleaned from other events. We propose a method of measuring these gains and demonstrate its usefulness using the classic Southern Women Data and a covert network dataset.     

Basic notions for the analysis of large two-mode networks

Many large real-world networks actually have a two-mode nature: their nodes may be separated into two classes, the links being between nodes of different classes only. Despite this, and despite the fact that many ad hoc tools have been designed for the study of special cases, very few exist to analyse (describe, extract relevant information) such networks in a systematic way. We propose here an extension of the most basic notions used nowadays to analyse large one-mode networks (the classical case) to the two-mode case. To achieve this, we introduce a set of simple statistics, which we discuss by comparing their values on a representative set of real-world networks and on their random versions. This makes it possible to evaluate their relevance in capturing properties of interest in two-mode 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.     

The Network Autocorrelation Model using Two-mode Data: Affiliation Exposure and Potential Bias in the Autocorrelation Parameter

The network autocorrelation model has been a workhorse for modeling network influences on individual behavior. The standard network approaches to mapping social influence using network measures, however, are limited to specifying an influence weight matrix (W) based on a single mode network. Additionally, it has been demonstrated that the estimate of the autocorrelation parameter ρ of the network effect tends to be negatively biased as the density in W matrix increases. The current study introduces a two-mode version of the network autocorrelation model. We then conduct simulations to examine conditions under which bias might exist. We show that the estimate for the affiliation autocorrelation parameter (ρ) tends to be negatively biased as density increases, as in the one-mode case. Inclusion of the diagonal of W, the count of the number of events participated in, as one of the variables in the regression model helps to attenuate such bias, however. We discuss the implications of these results.     

Network centrality and social movement media coverage: A two-mode network analytic approach

This article examines the relationship between structural location (namely, degree centrality) and news media coverage. Our central hypothesis is that the network centrality of social movement actors is positively associated with the prevalence of actors being cited in the print news media. This paper uses two-mode data from a communication network of environmentalists in British Columbia, and examines the relationship between their structural location and the frequency by which they are cited in newsprint media with regard to particular frames (about forest conservation, environmental protest, and related issues). We asked a sample of social movement participants about their ties to a target list of relatively high profile actors (environmental activists). We turned the resulting network matrix into a bipartite graph that examined the relationships amongst the target actors vis a vis the respondents. Next we calculated point in-degree for the target actors. For the target actors we also have data from a representative sample of 957 print news articles about forestry and conservation of old growth forests in British Columbia. We compare the effects of network centrality of the target actor versus several attributes of the target actors (gender, level of radicalism, leadership status) on the amount of media coverage that each of the target actors receives. We find that network centrality is associated with media coverage controlling for actor attributes. We discuss theoretical implications of this research. Finally, we also discuss the methodological pros and cons of using a “target name roster” to construct two-mode data on social movement activists.     

One-mode projection analysis and design of covert affiliation networks

Within the field of national security and counterterrorism a great need exists to understand covert organizations. To better understand these cellular structures we model and analyze these cells as a collection of subsets of all participants in the covert organization, i.e., as hypergraphs or affiliation networks. Such a covert affiliation network structure is analyzed by evaluating the one-mode projection of the corresponding hypergraph. First we provide a characterization of the total distance in the one-mode projection using its corresponding cell-shrunken version. Secondly we evaluate the one-mode projection with respect to the secrecy versus information tradeoff dilemma every covert organization has to solve. We present and analyze affiliation networks representing common covert organizational forms: star, path and semi-complete hypergraphs. In addition we evaluate an example of a covert organization wishing to conduct an attack and compare its performance to that of the common covert organizational forms. Finally we investigate affiliation networks that are optimal in the sense of balancing secrecy and information. We show how any affiliation tree can be improved by altering its structure. Finally we prove that among covert organizational forms in the class of hypertrees with the same number of cells uniform star affiliation networks are optimal.     

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.     

Micro-structural foundations of network inequality: Evidence from a field experiment in professional networking

Sociological accounts of network inequality typically rely on the logic of preferential attachment, holding that individuals in a social network prefer to form ties with central rather than peripheral actors. We develop an alternative explanation for the growth of network inequality that does not require actors to have knowledge about the social position of others or to hold explicit preferences for partners based on such knowledge. Instead, we theorize that central actors benefit from being exposed to more opportunities for triadic closure, which confounds a quality- or popularity-based signal that their greater connectedness might also send. We test this prediction an observational study and a field experiment across multiple professional conferences. In the field experiment, we test whether network centrality is predictive of tie formation if the benefits that central actors receive through their disproportional exposure to second-order network neighbors are randomly suppressed. The findings demonstrate that for the same level of exposure to opportunities for triadic closure, central actors and less central actors are equally likely to be selected as network partners. We discuss how the proposed mechanism may be used to rectify social capital disadvantages among disadvantaged groups.     

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.     

The Statistical Evaluation of Social Network Dynamics

A class of statistical models is proposed for longitudinal network data. The dependent variable is the changing (or evolving) relation network, represented by two or more observations of a directed graph with a fixed set of actors. The network evolution is modeled as the consequence of the actors making new choices, or withdrawing existing choices, on the basis of functions, with fixed and random components, that the actors try to maximize. Individual and dyadic exogenous variables can be used as covariates. The change in the network is modeled as the stochastic result of network effects (reciprocity, transitivity, etc.) and these covariates. The existing network structure is a dynamic constraint for the evolution of the structure itself. The models are continuous-time Markov chain models that can be implemented as simulation models. The model parameters are estimated from observed data. For estimating and testing these models, statistical procedures are proposed that are based on the method of moments. The statistical procedures are implemented using a stochastic approximation algorithm based on computer simulations of the network evolution process.     

Dynamic exchange networks

Considering the theoretical and empirical untenability of static exchange networks, researchers have asked how exchange outcomes change when links are added or deleted. The present paper assesses the validity of seemingly sensible propositions concerning the effects of adding and deleting a link on (i) the payoffs of the actors in the link, (ii) the payoffs of actors in neighboring links and (iii) the variance of payoffs in the exchange network. The propositions were examined by applying expected value theory (EVT) to all 13,597 networks up to size 8. All propositions were falsified. Some falsifications of propositions could be attributed to EVTs prediction that actors use sub-optimal exchange relations. Since other well-known theories of exchange, like power-dependence theory and network exchange theory, also predict that actors use sub-optimal relations, these results are robust to selection of the theory of exchange.