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.     

Social Networks and Social Settings: Developing a Coevolutionary View

One way to think about social context is as a sample of alters. To understand individual action, therefore, it matters greatly where these alters may be coming from, and how they are connected. According to one vision, connections among alters induce local dependencies—emergent rules of social interaction that generate endogenously the observed network structure of social settings. Social selection is the decision of interest in this perspective. According to a second vision, social settings are collections of social foci—physical or symbolic locales where actors meet. Because alters are more likely to be drawn from focused sets, shared social foci are frequently considered as the main generators of network ties, and hence of setting structure. Affiliation to social foci is the decision of central interest in this second view. In this paper we show how stochastic actor–oriented models (SAOMs) originally derived for studying the dynamics of multiple networks may be adopted to represent and examine these interconnected systems of decisions (selection and affiliation) within a unified analytical framework. We illustrate the empirical value of the model in the context of a longitudinal sample of adolescent participating in the Glasgow Teenage Friends and Lifestyle Study. Social selection decisions are examined in the context of networks of friendship relations. The analysis treats musical genres as the main social foci of interest.     

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.     

Actors and networks as objects

This paper explores the application of two contemporary computational methods to the development of sociological theory. Specifically, we combine the methods of object-orientation with discrete event simulation. This approach has several advantages for constructing and evaluating dynamic social theories.In object-oriented program design, objects combine and integrate the traditional concepts of data structures and algorithms, the building blocks of structured programming. Algorithms associated with objects are called methods or member functions. Constructing social actors as objects involves defining both their data attributes and the methods associated with these attributes. We also treat a social network as a computational object. It has data types of nodes and ties. As an object, the network must also have methods that add and delete nodes and ties. Once a network exists, we can create other data types and methods that describe and analyze the network. For example, networks have in-degree and out-degree vectors, and measures of hierarchy. In principle, we can create attributes of networks for all of the structural measures we use to describe networks.We use actor and network objects in a discrete event simulation of a process of formation of dominance structures, exploring several dynamic variations of the underlying theoretical model.     

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.     

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

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.     

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.     

Dynamics of Peer Relationships Across the First Two Years of Junior High as a Function of Gender and Changes in Classroom Composition

This article examines the dynamics of peer relationships across the first 2 grades of Dutch junior high schools (average age 13–14). Specifically, we studied how gender and compositional changes in classrooms structured the changes in peer relationships between the 2 grades. Expectations were derived from past research, and we tested whether these held when methods for data analysis were applied that control appropriately for the dependence structure of the data (more specifically, multilevel analysis and a multilevel application of actor‐oriented models for network evolution). Analyses revealed that the stability of peer acceptance was relatively low and that it was affected neither by the level of classroom stability nor by gender. Dyadic relationships were moderately stable. Tendencies toward reciprocity, network closure, and gender similarity shaped the changes in networks of peer relationships within classes. Contrary to past findings, female newcomers in classrooms were equally as well accepted as male newcomers or established class members.     

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.     

Non-response in social networks: The impact of different non-response treatments on the stability of blockmodels

Discerning the essential structure of social networks is a major task. Yet, social network data usually contain different types of errors, including missing data that can wreak havoc during data analyses. Blockmodeling is one technique for delineating network structure. While we know little about its vulnerability to missing data problems, it is reasonable to expect that it is vulnerable given its positional nature. We focus on actor non-response and treatments for this. We examine their impacts on blockmodeling results using simulated and real networks. A set of ‘known’ networks are used, errors due to actor non-response are introduced and are then treated in different ways. Blockmodels are fitted to these treated networks and compared to those for the known networks. The outcome indicators are the correspondence of both position memberships and identified blockmodel structures. Both the amount and type of non-response, and considered treatments, have an impact on delineated blockmodel structures.     

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.     

A New Model for Information Diffusion in Heterogeneous Social Networks

This paper discusses a new model for the diffusion of information through heterogeneous social networks. In earlier models, when information was given by one actor to another the transmitter did not retain the information. The new model is an improvement on earlier ones because it allows a transmitter of information to retain that information after telling it to somebody else. Consequently, the new model allows more actors to have information during the information diffusion process. The model provides predictions of diffusion times in a given network at the global, dyadic, and individual levels. This leads to straightforward generalizations of network measures, such as closeness centrality and betweenness centrality, for research problems that focus on the efficiency of information transfer in a network. We analyze in detail how information diffusion times and centrality measures depend on a series of network measures, such as degrees and bridges. One important finding is that predictions about the time actors need to spread information in the network differ considerably between the new and old models, while the predictions about the time needed to receive information hardly differ. Finally, some cautionary remarks are made about using the model in empirical research.     

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.     

Avoidance,antipathy, and aggression: A three-wave longitudinal network study on negative networks,status, and heteromisos

Our aim is to explain negative networks in Dutch high schools, using three-wave stochastic actor oriented models (SAOMs). We differentiate between avoidance, antipathy, and aggression based on how costly and visible these behaviours are. Our results show that pupils’ ethnicity does not explain negative ties. Moreover, we do not find that negative ties form archetypical social hierarchies, formed by networks that are asymmetrical and transitive. Instead, we find positive effects of reciprocity on avoidance, antipathy, and aggression, and we find no effects of transitivity. Rather than allowing themselves to be dominated by their classmates, pupils fight back and reciprocate negative behaviour. We further show that some pupils behave negatively to a lot of their classmates, and that some pupils are treated negatively by many classmates. These results require us to reconsider what status hierarchies look like. Finally, we explore the extent to which the avoidance, antipathy, and aggression networks co-evolve.     

Network knowledge and the use of power

Complementing recent work on the effects of power on network perceptions, we offer a theory specifying how knowledge of network structures and exchange processes differentially affect the use of power by advantaged and disadvantaged positions. We argue that under certain conditions, network knowledge is beneficial to occupants of low-power positions, but not to occupants of high-power positions. Any low-power actor can benefit from having superior information, but if all low-power actors have equally sound knowledge, then all are worse off—a type of social trap. We tested these arguments by manipulating power and the availability of information on network structure and exchange processes in an experimental exchange network setting. The results were supportive.     

Violence,Networks, and International Migration from Colombia

Although Colombia is a major country of emigration, little is known about its citizens' motivations for migration. Social and economic conditions have been studied as determinants of migration, but violence has received less attention. We examine how social networks and violence function to promote emigration from Colombia by linking event‐history data from the Latin American Migration Project to external data on violence and economic conditions. We show that emigration is more likely to be initiated by those with higher education, those with network connections to migrants, and during periods of greater violence and increased police presence. Although violence acts powerfully to determine when people migrate, the geographic distribution of social capital determines where they go. Not surprisingly, migrants go to locations where people in their social networks are currently living or have been earlier.     

Synesthetizing Sound Studies and the Sociology of Technology

This paper examines current issues at the intersection of the Sociology of Technology and the interdisciplinary field of Sound Studies. It begins with an overview of major social constructionist, interpretive semiotic, and actor–network theoretical sociological approaches to technology as developed within the field of Science and Technology Studies (STS). Considering the predominance of narrative visual metaphors in these approaches' treatment of socio‐technical perception, it is argued that the “turn to sound” in social studies of technology, rather than simply furnishing established analytic approaches with a fresh set of empirical cases (i.e. “sound technologies”), presents an opportunity to better sensitize STS approaches to the contingent socio‐technical shaping and distribution of embodied perceptual modalities in general. A critical review of recent social and historical studies of sound and technology, attending especially to debates surrounding the theoretical shift from acoustemological or soundscape‐based to signal‐oriented “transductive” approaches, suggests the importance for future STS and Sound Studies work of addressing how shared modes of sensory perception are produced within particular socio‐technical frames.