Students’ personal learning networks can be a valuable resource of success in higher education: they offer opportunities for academic and personal support and provide sources of information related to exams or homework. We study the determinants of learning networks using a panel study among university students in their first and second year of study. A long-standing question in social network analysis has been whether the tendency of individuals with similar characteristics to form ties is a result of preferences “choice homophily” or rather selective opportunities “induced homophily”. We expect a latent preference for homophilic learning partnerships with regard to attributes, such as gender, ability, and social origin. We estimate recently developed temporal exponential random graph models to control for previous network structure and study changes in learning ties among students. The results show that especially for males, same-gender partnerships are preferred over heterogeneous ties, while chances for tie formation decrease with the difference in academic ability among students. Social origin is a significant factor in the crosssectional exploration but does appear to be less important in the formation of new (strong) partnerships during the course of studies.

Genetic risk is particularly salient for families and testing for genetic conditions is necessarily a family-level process. Thus, risk for genetic disease represents a collective stressor shared by family members. According to communal coping theory, families may adapt to such risk vis-a-vis interpersonal exchange of support resources. We propose that communal coping is operationalized through the pattern of supportive relationships observed between family members. In this study, we take a social network perspective to map communal coping mechanisms to their underlying social interactions and include those who declined testing or were not at risk for Lynch Syndrome. Specifically, we examine the exchange of emotional support resources in families at risk of Lynch Syndrome, a dominantly inherited cancer susceptibility syndrome. Our results show that emotional support resources depend on the testing-status of individual family members and are not limited to the bounds of the family. Network members from within and outside the family system are an important coping resource in this patient population. This work illustrates how social network approaches can be used to test structural hypotheses related to communal coping within a broader system and identifies structural features that characterize coping processes in families affected by Lynch Syndrome.

Individuals filling specialized, interdependent organizational roles achieve coordinated task execution through effective communication channels. Such channels enable regular access to information, opportunities, and assistance that may enhance one’s understanding of the task environment. However, the time and effort devoted to maintaining those channels may detract from one’s duties by turning attention away from the task environment. Disrupted task environments increase information requirements, thus creating a dilemma in which individuals must sustain benefits offered by important communication channels and relieve burdens imposed by ineffective channels. Using separable temporal exponential random graph models (STERGMs), this paper examines the relationship between situational awareness (SA) and the propensity to sustain or dissolve preexisting communication channels during 10 disruptive events experienced sequentially by a large, multifaceted military organization during a 2-week training exercise. Results provide limited evidence that increased SA detracts from tie preservation; instead SA begins to predict tie preservation during the second week of the exercise. Patterns of organizational adaptation reveal that, over time, improvised coordinative roles increasingly fall upon those with elevated SA. These results suggest that over successive disruptions, the benefits of information provided by communication channels within interdependent, role-specialized organizations begin to outweigh the costs of sustaining those channels.

R-MAT (for Recursive MATrix) is a simple, widely used model for generating graphs with a power law degree distribution, a small diameter, and communitys structure. It is particularly attractive for generating very large graphs because edges can be generated independently by an arbitrary number of processors. However, current R-MAT generators need time logarithmic in the number of nodes for generating an edge— constant time for generating one bit at a time for node IDs of the connected nodes. We achieve constant time per edge by precomputing pieces of node IDs of logarithmic length. Using an alias table data structure, these pieces can then be sampled in constant time. This simple technique leads to practical improvements by an order of magnitude. This further pushes the limits of attainable graph size and makes generation overhead negligible in most situations.

Recent work studying triadic closure in undirected graphs has drawn attention to the distinction between measures that focus on the “center” node of a wedge (i.e., length-2 path) versus measures that focus on the “initiator,” a distinction with considerable consequences. Existing measures in directed graphs, meanwhile, have all been center-focused. In this work, we propose a family of eight directed closure coefficients that measure the frequency of triadic closure in directed graphs from the perspective of the node initiating closure. The eight coefficients correspond to different labeled wedges, where the initiator and center nodes are labeled, and we observe dramatic empirical variation in these coefficients on real-world networks, even in cases when the induced directed triangles are isomorphic. To understand this phenomenon, we examine the theoretical behavior of our closure coefficients under a directed configuration model. Our analysis illustrates an underlying connection between the closure coefficients and moments of the joint in- and out-degree distributions of the network, offering an explanation of the observed asymmetries. We also use our directed closure coefficients as predictors in two machine learning tasks. We find interpretable models with AUC scores above 0.92 in class-balanced binary prediction, substantially outperforming models that use traditional center-focused measures.

We present a statistical framework for generating predicted dynamic networks based on the observed evolution of social relationships in a population. The framework includes a novel and flexible procedure to sample dynamic networks given a probability distribution on evolving network properties; it permits the use of a broad class of approaches to model trends, seasonal variability, uncertainty, and changes in population composition. Current methods do not account for the variability in the observed historical networks when predicting the network structure; the proposed method provides a principled approach to incorporate uncertainty in prediction. This advance aids in the designing of network-based interventions, as development of such interventions often requires prediction of the network structure in the presence and absence of the intervention. Two simulation studies are conducted to demonstrate the usefulness of generating predicted networks when designing network-based interventions. The framework is also illustrated by investigating results of potential interventions on bill passage rates using a dynamic network that represents the sponsor/co-sponsor relationships among senators derived from bills introduced in the U.S. Senate from 2003 to 2016.

We discuss a two-week summer course on “Network Science” and “Complex Systems” that we taught for 15 German high-school pupils of ages 16–18. In this course, we covered topics in graph theory, applied network science, programming, and dynamic systems alike. We find that “Network Science” is a well-suited course for introducing students to university-level mathematics. We reflect on difficulties regarding programming exercises and the discussion of more advanced topics in dynamic systems. We make the course material available and encourage fellow network scientists to organize similar outreach events.