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.     

Stable exponential random graph models with non-parametric components for large dense networks

Exponential random graph models (ERGM) behave peculiar in large networks with thousand(s) of actors (nodes). Standard models containing 2-star or triangle counts as statistics are often unstable leading to completely full or empty networks. Moreover, numerical methods break down which makes it complicated to apply ERGMs to large networks. In this paper we propose two strategies to circumvent these obstacles. First, we use a subsampling scheme to obtain (conditionally) independent observations for model fitting and secondly, we show how linear statistics (like 2-stars etc.) can be replaced by smooth functional components. These two steps in combination allow to fit stable models to large network data, which is illustrated by a data example including a residual analysis.     

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.     

Connectedness in a general model for valued networks

Social networks have been closely identified with graph theoretical models, which constitute their most familiar mode of representation. There are a number of such models which may embody symmetric, directed, or valued relationships. But the study of networks with valued linkages, using the natural formalization provided by the valued graph or digraph, has been impeded by a traditional lack of analytical machinery for dealing with valued structures. In this paper, we demonstrate the development and elaboration of formalizations for the central network concepts of reachability, joining, and connectedness through graph theoretical models of increasing complexity, culminating in their expression within a general model for valued structures. This model for valued (symmetric or directed) graphs, or vigraphs, provides a unified representation and matrix methodology for dealing with qualitative and quantitative structures, incorporates many existing methods as special cases, and suggests new applications. Some of the most interesting of these follow the recognition, consistent with the model, that the “values” assigned to network linkages may be sorts of entities other than numbers.     

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.     

Neighborhood–Based Models For Social Networks

We argue that social networks can be modeled as the outcome of processes that occur in overlapping local regions of the network, termed local social neighborhoods. Each neighborhood is conceived as a possible site of interaction and corresponds to a subset of possible network ties. In this paper, we discuss hypotheses about the form of these neighborhoods, and we present two new and theoretically plausible ways in which neighborhood–based models for networks can be constructed. In the first, we introduce the notion of a setting structure, a directly hypothesized (or observed) set of exogenous constraints on possible neighborhood forms. In the second, we propose higher–order neighborhoods that are generated, in part, by the outcome of interactive network processes themselves. Applications of both approaches to model construction are presented, and the developments are considered within a general conceptual framework of locale for social networks. We show how assumptions about neighborhoods can be cast within a hierarchy of increasingly complex models; these models represent a progressively greater capacity for network processes to "reach" across a network through long cycles or semipaths. We argue that this class of models holds new promise for the development of empirically plausible models for networks and network–based processes.     

Conditionally exponential random models for individual properties and network structures: Method and application

Exponential random models have been widely adopted as a general probabilistic framework for complex networks and recently extended to embrace broader statistical settings such as dynamic networks, valued networks or two-mode networks. Our aim is to provide a further step into the generalization of this class of models by considering sample spaces which involve both families of networks and nodal properties verifying combinatorial constraints. We propose a class of probabilistic models for the joint distribution of nodal properties (demographic and behavioral characteristics) and network structures (friendship and professional partnership). It results in a general and flexible modeling framework to account for homophily in social structures. We present a Bayesian estimation method based on the full characterization of their sample spaces by systems of linear constraints. This provides an exact simulation scheme to sample from the likelihood, based on linear programming techniques. After a detailed analysis of the proposed statistical methodology, we illustrate our approach with an empirical analysis of co-authorship of journal articles in the field of neuroscience between 2009 and 2013.     

Social context,spatial structure and social network structure

Frequently, social networks are studied in their own right with analyses devoid of contextual details. Yet contextual features – both social and spatial – can have impacts on the networks formed within them. This idea is explored with five empirical networks representing different contexts and the use of distinct modeling strategies. These strategies include network visualizations, QAP regression, exponential random graph models, blockmodeling and a combination of blockmodels with exponential random graph models within a single framework. We start with two empirical examples of networks inside organizations. The familiar Bank Wiring Room data show that the social organization (social context) and spatial arrangement of the room help account for the social relations formed there. The second example comes from a police academy where two designed arrangements, one social and one spatial, powerfully determine the relational social structures formed by recruits. The next example is an inter-organizational network that emerged as part of a response to a natural disaster where features of the improvised context helped account for the relations that formed between organizations participating in the search and rescue mission. We then consider an anthropological example of signed relations among sub-tribes in the New Guinea highlands where the physical geography is fixed. This is followed by a trading network off the Dalmatian coast where geography and physical conditions matter. Through these examples, we show that context matters by shaping the structure of networks that form and that a variety of network analytic tools can be mobilized to reveal how networks are shaped, in part, by social and spatial contexts. Implications for studying social networks are suggested.     

Statistical estimation of co-offending youth networks

The relevance and potential of network approaches in criminology are well known. Friendship networks and antisocial influences conveyed by them have an impact on the spread of criminal behavior. However, there are relatively few studies reporting on the use of statistical network models in the analysis of delinquency data. The purpose here is to discuss statistical network models that might be appropriate for estimating joint participation in crime and the structure of co-offending youth networks. The discussion is largely based on problems encountered in some recent exploratory studies of juvenile crime in Stockholm with register data from the police on suspected offenders. A bipartite graph model of such data is built from assumptions about crime reporting and offender detection for a specific type of crimes committed in a certain area during a certain time period. It is shown how the model parameters and the numbers of crimes of different sizes, the numbers of offenders of different activities, and the total number of offences can be estimated from data about reported crimes and police identified offenders. The illustrations also show the need for further statistical development.     

Univariate and multivariate models of positive and negative networks: Liking,disliking, and bully–victim relationships

Three relations between elementary school children were investigated: networks of general dislike and bullying were related to networks of general like. These were modeled using multivariate cross-sectional (statistical) network models. Exponential random graph models for a sample of 18 classrooms, numbering 393 students, were summarized using meta-analyses. Results showed (balanced) network structures with positive ties between those who were structurally equivalent in the negative network. Moreover, essential structural parameters for the univariate network structure of positive (general like) and negative (general dislike and bullying) tie networks were identified. Different structures emerged in positive and negative networks. The results provide a starting point for further theoretical and (multiplex) empirical research about negative ties and their interplay with positive ties.     

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.     

Action and institution,network and function: The cybernetic concept of social structure

A program of research on the formal representation and analysis of institutional structures is taken a step further by integrating it with recent developments in the formal representation of hierarchical levels of inclusion or part-whole relations. We begin by reviewing a cybernetic conception of action and show how this relates to the construction of production system models of institutional structures. Thereafter, we treat the inclusion hierarchy to show how the production rule constitutes the conceptual unit integrating social knowledge and social action upon which are built two hierarchies, involving institutional entities and social networks, respectively. We indicate some of the detailed forms of control involved in these hierarchies and then show how a form of functional analysis can be undertaken on this basis. Finally, we provide a lengthy discussion of the promise and problems of this mode of structural analysis.     

The influence of secrecy on the communication structure of covert networks

In order to be able to devise successful strategies for destabilizing covert organizations it is vital to recognize and understand their structural properties. Every covert organization faces the constant dilemma of staying secret and ensuring the necessary coordination between its members. Using elements from multi-objective optimization and bargaining game theory we analyze which communication structures are optimal in the sense of providing a balanced tradeoff between secrecy and operational efficiency. For several different secrecy and information scenarios this tradeoff is analyzed considering the set of connected graphs of given order as possible communication structures. Assuming uniform exposure probability of individuals in the network we show that the optimal communication structure corresponds to either a network with a central individual (the star graph) or an all-to-all network (the complete graph) depending on the link detection probability, which is the probability that communication between individuals will be detected. If the probability that an individual is exposed as member of the network depends on the information hierarchy determined by the structure of the graph, the optimal communication structure corresponds to a reinforced ring or wheel graph in case of an information measure based on average performance. In worst case performance with respect to information it can be seen that windmill wing graphs approximate optimal structures. Finally we give an example how optimal structures change when considering a non-balanced tradeoff between secrecy and operational efficiency.     

Dense core model for cohesive subgraph discovery

Discovery of cohesive subgraphs is an important issue in social network analysis. As representative cohesive subgraphs, pseudo cliques have been developed by relaxing the perfection of cliques. By enumerating pseudo clique subgraphs, we can find some structures of interest such as a star-like structure. However, a little more complicated structures such as a core/periphery structure is still hard to be found by them. Therefore, we propose a novel pseudo clique called ρ-dense core and show the connection with the other pseudo cliques. Moreover, we show that a set of ρ-dense core subgraphs gives an optimal solution in a graph partitioning problem. Several experiments on real-life networks demonstrated the effectiveness for cohesive subgraph discovery.     

Parameter estimation procedures for exponential-family random graph models on count-valued networks: A comparative simulation study

The exponential-family random graph models (ERGMs) have emerged as an important framework for modeling social networks for a wide variety of relational types. ERGMs for valued networks are less well-developed than their unvalued counterparts, and pose particular computational challenges. Network data with edge values on the non-negative integers (count-valued networks) is an important such case, with examples ranging from the magnitude of migration and trade flows between places to the frequency of interactions and encounters between individuals. Here, we propose an efficient parallelizable subsampled maximum pseudo-likelihood estimation (MPLE) scheme for count-valued ERGMs, and compare its performance with existing Contrastive Divergence (CD) and Monte Carlo Maximum Likelihood Estimation (MCMLE) approaches via a simulation study based on migration flow networks in two U.S. states. Our results suggest that edge value variance is a key factor in method performance, while network size mainly influences their relative merits in computational time. For small-variance networks, all methods perform well in point estimations while CD greatly overestimates uncertainties, and MPLE underestimates them for dependence terms; all methods have fast estimation for small networks, but CD and subsampled multi-core MPLE provides speed advantages as network size increases. For large-variance networks, both MPLE and MCMLE offer high-quality estimates of coefficients and their uncertainty, but MPLE is significantly faster than MCMLE; MPLE is also a better seeding method for MCMLE than CD, as the latter makes MCMLE more prone to convergence failure. The study suggests that MCMLE and MPLE should be the default approach to estimate ERGMs for small-variance and large-variance valued networks, respectively. We also offer further suggestions regarding choice of computational method for valued ERGMs based on data structure, available computational resources and analytical goals.     

Network models for social selection processes

We present network models for social selection processes, based on the p¹ class of models. Social selection occurs when individuals form social relationships on the basis of certain characteristics they possess. Similarity is a common hypothesis for selection processes, but one that is usually framed dyadically. Structural balance approaches move beyond dyadic conceptualizations and require more sophisticated modeling. The two-block chain graph approach of p¹ social influence models is adapted to allow individual attribute variables to be predictors of network ties. Using a range of dependence assumptions, we present a hierarchy of increasingly complex selection models, including models for continuous attribute measures, which in their simplest form may be assumed to be linear. The models have scope, however, for more complex functional formulations so that more specific hypotheses may be investigated by postulating a particular functional form. Our empirical examples illustrate how dyadic selection may be transmuted into structural effects, and how the absence of dyadic selection may still mask a subtle higher order selection effect as individuals “position” themselves within a wider social environment. In conclusion, we discuss the links between social influence and social selection models.     

The backbone of bipartite projections: Inferring relationships from co-authorship,co-sponsorship,co-attendance and other co-behaviors

The analysis and visualization of weighted networks pose many challenges, which have led to the development of techniques for extracting the network's backbone, a subgraph composed of only the most significant edges. Weighted edges are particularly common in bipartite projections (e.g. networks of co-authorship, co-attendance, co-sponsorship), which are often used as proxies for one-mode networks where direct measurement is impractical or impossible (e.g. networks of collaboration, friendship, alliance). However, extracting the backbone of bipartite projections requires special care. This paper reviews existing methods for extracting the backbone from bipartite projections, and proposes a new method that aims to overcome their limitations. The stochastic degree sequence model (SDSM) involves the construction of empirical edge weight distributions from random bipartite networks with stochastic marginals, and is demonstrated using data on bill sponsorship in the 108th U.S. Senate. The extracted backbone's validity as a network reflecting political alliances and antagonisms is established through comparisons with data on political party affiliations and political ideologies, which offer an empirical ground-truth. The projection and backbone extraction methods discussed in this paper can be performed using the -onemode- command in Stata.     

Balance in stochastic signed graphs

Signed graphs provide models for investigating balance in connection with various kinds of social relations. Since empirical social networks always involve uncertainty because of errors due to measurement, imperfect observation or sampling, it is desirable to incorporate uncertainty into signed graph models. We introduce a stochastic signed graph and investigate the properties of some indices of balance involving triads. In particular we consider the balance properties of a graph which is randomly signed and of one which has been randomly sampled from a large population graph.     

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.