This paper introduces a framework for understanding complex temporal interaction patterns in large-scale scientific collaboration networks. In particular, we investigate how two key concepts in science studies, scientific collaboration and scientific mobility, are related and possibly differ between fields. We do so by analyzing multilayer temporal motifs: small recurring configurations of nodes and edges.

Driven by the problem that many papers share the same publication year, we first provide a methodological contribution: an efficient counting algorithm for multilayer temporal motifs with concurrent edges. Next, we introduce a systematic categorization of the multilayer temporal motifs, such that each category reflects a pattern of behavior relevant to scientific collaboration and mobility. Here, a key question concerns the causal direction: does mobility lead to collaboration or vice versa? Applying this framework to scientific collaboration networks extracted from Web of Science (WoS) consisting of up to 7.7 million nodes (authors) and 94 million edges (collaborations), we find that international collaboration and international mobility reciprocally influence one another. Additionally, we find that Social sciences & Humanities (SSH) scholars co-author to a greater extent with authors at a distance, while Mathematics & Computer science (M&C) scholars tend to continue to collaborate within the established knowledge network and organization.

We propose a novel tie-oriented model for longitudinal event network data. The generating mechanism is assumed to be a multivariate Poisson process that governs the onset and repetition of yearly observed events with two separate intensity functions. We apply the model to a network obtained from the yearly dyadic number of international deliveries of combat aircraft trades between 1950 and 2017. Based on the trade gravity approach, we identify economic and political factors impeding or promoting the number of transfers. Extensive dynamics as well as country heterogeneities require the specification of semiparametric time-varying effects as well as random effects. Our findings reveal strong heterogeneous as well as time-varying effects of endogenous and exogenous covariates on the onset and repetition of aircraft trade events.

Reciprocity—the mutual provisioning of support/goods—is a pervasive feature of social life. Directed networks provide a way to examine the structure of reciprocity in a community. However, measuring social networks involves assumptions about what relationships matter and how to elicit them, which may impact observed reciprocity. In particular, the practice of aggregating multiple sources of data on the same relationship (e.g., “double-sampled” data, where both the “giver” and “receiver” are asked to report on their relationship) may have pronounced impacts on network structure. To investigate these issues, we examine concordance (ties reported by both parties) and reciprocity in a set of directed, double-sampled social support networks. We find low concordance in people’s responses. Taking either the union (including any reported ties) or the intersection (including only concordant ties) of double-sampled relationships results in dramatically higher levels of reciprocity. Using multilevel exponential random graph models of social support networks from 75 villages in India, we show that these changes cannot be fully explained by the increase in the number of ties produced by layer aggregation. Respondents’ tendency to name the same people as both givers and receivers of support plays an important role, but this tendency varies across contexts and relationships type. We argue that no single method should necessarily be seen as the “correct” choice for aggregation of multiple sources of data on a single relationship type. Methods of aggregation should depend on the research question, the context, and the relationship in question.

Decentralized coordination is one of the fundamental challenges for societies and organizations. While extensively explored from a variety of perspectives, one issue that has received limited attention is human coordination in the presence of adversarial agents. We study this problem by situating human subjects as nodes on a network, and endowing each with a role, either regular (with the goal of achieving consensus among all regular players), or adversarial (aiming to prevent consensus among regular players). We show that adversarial nodes are, indeed, quite successful in preventing consensus. However, we demonstrate that having the ability to communicate among network neighbors can considerably improve coordination success, as well as resilience to adversarial nodes. Our analysis of communication suggests that adversarial nodes attempt to exploit this capability for their ends, but do so in a somewhat limited way, perhaps to prevent regular nodes from recognizing their intent. In addition, we show that the presence of trusted nodes generally has limited value, but does help when many adversarial nodes are present, and players can communicate. Finally, we use experimental data to develop computational models of human behavior and explore additional parametric variations: features of network topologies and densities, and placement, all using the resulting data-driven agent-based (DDAB) model.

Thematic analysis of personal networks involves identifying regularities in network structure and content, and grouping networks into types/clusters, to allow for a holistic understanding of social complexities. We propose an inductive approach to network thematic analysis, applying the learnings from qualitative coding, fused mixed-methods analysis, and typology development. It involves framing (changing focus by magnifying, aggregating, and graphical configuration), pattern detection (identification of underlying dimensions, sorting, and clustering), labeling, and triangulating (confirmation and fine-tuning using quantitative and qualitative approaches); applied repeatedly and emergently. We describe this approach utilized in two cases of studying support networks of caregivers.

Critical cascades are found in many self-organizing systems. Here, we examine critical cascades as a design paradigm for logic and learning under the linear threshold model (LTM), and simple biologically inspired variants of it as sources of computational power, learning efficiency, and robustness. First, we show that the LTM can compute logic, and with a small modification, universal Boolean logic, examining its stability and cascade frequency. We then frame it formally as a binary classifier and remark on implications for accuracy. Second, we examine the LTM as a statistical learning model, studying benefits of spatial constraints and criticality to efficiency. We also discuss implications for robustness in information encoding. Our experiments show that spatial constraints can greatly increase efficiency. Theoretical investigation and initial experimental results also indicate that criticality can result in a sudden increase in accuracy.

Most of the current complex networks that are of interest to practitioners possess a certain community structure that plays an important role in understanding the properties of these networks. For instance, a closely connected social communities exhibit faster rate of transmission of information in comparison to loosely connected communities. Moreover, many machine learning algorithms and tools that are developed for complex networks try to take advantage of the existence of communities to improve their performance or speed. As a result, there are many competing algorithms for detecting communities in large networks. Unfortunately, these algorithms are often quite sensitive and so they cannot be fine-tuned for a given, but a constantly changing, real-world network at hand. It is therefore important to test these algorithms for various scenarios that can only be done using synthetic graphs that have built-in community structure, power law degree distribution, and other typical properties observed in complex networks. The standard and extensively used method for generating artificial networks is the LFR graph generator. Unfortunately, this model has some scalability limitations and it is challenging to analyze it theoretically. Finally, the mixing parameter μ, the main parameter of the model guiding the strength of the communities, has a non-obvious interpretation and so can lead to unnaturally defined networks. In this paper, we provide an alternative random graph model with community structure and power law distribution for both degrees and community sizes, the Artificial Benchmark for Community Detection (ABCD graph). The model generates graphs with similar properties as the LFR one, and its main parameter ξ can be tuned to mimic its counterpart in the LFR model, the mixing parameter μ. We show that the new model solves the three issues identified above and more. In particular, we test the speed of our algorithm and do a number of experiments comparing basic properties of both ABCD and LFR. The conclusion is that these models produce graphs with comparable properties but ABCD is fast, simple, and can be easily tuned to allow the user to make a smooth transition between the two extremes: pure (independent) communities and random graph with no community structure.

Measurement errors are omnipresent in network data. Most studies observe an erroneous network instead of the desired error-free network. It is well known that such errors can have a severe impact on network metrics, especially on centrality measures: a central node in the observed network might be less central in the underlying, error-free network. The robustness is a common concept to measure these effects. Studies have shown that the robustness primarily depends on the centrality measure, the type of error (e.g., missing edges or missing nodes), and the network topology (e.g., tree-like, core-periphery). Previous findings regarding the influence of network size on the robustness are, however, inconclusive. We present empirical evidence and analytical arguments indicating that there exist arbitrary large robust and non-robust networks and that the average degree is well suited to explain the robustness. We demonstrate that networks with a higher average degree are often more robust. For the degree centrality and Erdős–Rényi (ER) graphs, we present explicit formulas for the computation of the robustness, mainly based on the joint distribution of node degrees and degree changes which allow us to analyze the robustness for ER graphs with a constant average degree or increasing average degree.

Community-based physical activity programs, such as the Recreovía, are effective in promoting healthy behaviors in Latin America. To understand Recreovías’ challenges and scalability, we characterized its social network longitudinally while studying its participants’ social cohesion and interactions. First, we constructed the Main network of the program’s Facebook profile in 2013 to determine the main stakeholders and communities of participants. Second, we studied the Temporal network growth of the Facebook profiles of three Recreovía locations from 2008 to 2016. We implemented a Time Windows in Networks algorithm to determine observation periods and a scaling model of cities’ growth to measure social cohesion over time. Our results show physical activity instructors as the main stakeholders (20.84% nodes of the network). As emerging cohesion, we found: (1) incremental growth of Facebook users (43–272 nodes), friendships (55–2565 edges), clustering coefficient (0.19–0.21), and density (0.04–0.07); (2) no preferential attachment behavior; and (3) a social cohesion super-linear growth with 1.73 new friendships per joined user. Our results underscore the physical activity instructors’ influence and the emergent cohesion in innovation periods as a co-benefit of the program. This analysis associates the social and healthy behavior dimensions of a program occurring in natural environments under a systemic approach.

This study examines changes in individual social capital during adult life within a 19-year period. Social capital theory and life course theory are combined, and it is argued that changes in social networks do not necessarily go together with changes in social capital: while personal networks are known to decline in size with age, social capital can be expected to accumulate, in particular for those who had a better starting position and therefore more resources to share. Panel data from the survey of the social networks of the Dutch (SSND) (1999–2018) at four points of measurement are employed to inquire into this argument. Social capital is measured by the position generator instrument, and three indicators, that is, resource extensity, mean prestige access, and resource range are analyzed. Results of fixed effect models show that, on average, people maintain access to social capital, and that men and higher educated gain social capital through their life as opposed to women and lower educated. Implications for the understanding of the reproduction of social inequality are discussed. The paper concludes with a reflection upon the value of ego-centered network analysis in the era of big data and data science.

This paper investigates the processes involved when newly hired employees need to simultaneously build up and mobilize personal network ties during their organizational socialization. It focuses on the quality of ties at an early formative stage, characterized by the lack of a tie history between actors. Social capital theory would suggest that such nascent ties do not offer optimal channels for the kind and volume of resources that newcomers (need to) rely on during socialization. To better understand how this apparent mismatch between tie quality and resource needs is handled from an ego-centered perspective, the paper analyzes personal network data from 24 newcomers in nine organizations, using an adapted form of Qualitative Structural Analysis. Three tie-level qualities are found to explain how the lack of tie history may be alleviated, circumvented, or compensated. They comprise (a) variants of openness experienced with stronger ties, (b) perceptions of a lowered threshold towards weaker ties, and (c) sources of legitimacy regarding latent ties. Based on these findings, the paper presents an integrated conceptual model to clarify how nascent ties offer channels for network resources during socialization and discusses the need for further research on the role of specific moderators for the investigated processes.

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.

Bipartite networks represent pairwise relationships between nodes belonging to two distinct classes. While established methods exist for analyzing unipartite networks, those for bipartite network analysis are somewhat obscure and relatively less developed. Community detection in such instances is frequently approached by first projecting the network onto a unipartite network, a method where edges between node classes are encoded as edges within one class. Here we test seven different projection schemes by assessing the performance of community detection on both: (i) a real-world dataset from social media and (ii) an ensemble of artificial networks with prescribed community structure. A number of performance and accuracy issues become apparent from the experimental findings, especially in the case of long-tailed degree distributions. Of the methods tested, the “hyperbolic” projection scheme alleviates most of these difficulties and is thus the most robust scheme of those tested. We conclude that any interpretation of community detection algorithm performance on projected networks must be done with care as certain network configurations require strong community preference for the bipartite structure to be reflected in the unipartite communities. Our results have implications for the analysis of detected community structure in projected unipartite networks.

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.

When collecting egocentric network data, visual representations of networks can function as a cognitive aid for depicting relationships, helping to maintain an overview of the relationships, and keeping the attention of the interviewees. Additionally, network maps can serve as a narration generator in qualitative and in mixed-methods studies. While varying visual instruments are used for collecting egocentric network data, little is known about differences among visual tools concerning the influence on the resulting network data, the usability for interviewees, and data validity. The article provides an overview of existing visually oriented tools that are used to collect egocentric networks and discusses their functions, advantages, and limitations. Then, we present results of an experimental study where we compare four different visual tools with regard to networks elicited, manageability, and the impact of follow-up questions. In order to assess the manageability of the four tools, we used the thinking aloud method. The results provide evidence that the decision in favor of a specific visual tool (structured vs. unstructured) can affect the size and composition of the elicited networks. Follow-up questions greatly affect the elicited networks and follow-up cues can level out differences among tools. Respondents tend to prefer the concentric circles tool, with some differences in preferences and manageability of tools between participants with low and those with high socioeconomic status. Finally, assets and drawbacks of the four instruments are discussed with regard to data quality and crucial aspects of the data collection process when using visual tools.

Similar peers are more likely to become friends, but it remains unclear how the combination of multiple characteristics, known as multidimensional similarity, influences friendships. This study aimed to investigate whether similarity in gender (attribute) and bullying or victimization (network position) contributes to friendships. The school-level networks of friendships and victim-bully relationships in 17 Dutch elementary schools (2,130 students) were examined using multiplex longitudinal social network models (RSiena). The results showed that friendships were more likely to occur between same-gender peers and between bullies sharing their targets of victimization. Multidimensional similarity (similarities in gender as well as bullying) increased the likelihood of friendships for same-gender bullies targeting the same victims, but not for same-gender victims sharing bullies. The findings underline the importance of unraveling the interplay between different dimensions of similarity for children’s relationships and surpass unidimensional similarity based on single attributes.

We introduce a weighted configuration model graph, where edge weights correspond to the probability of infection in an epidemic on the graph. On these graphs, we study the development of a Susceptible–Infectious–Recovered epidemic using both Reed–Frost and Markovian settings. For the special case of having two different edge types, we determine the basic reproduction numberR0, the probability of a major outbreak, and the relative final size of a major outbreak. Results are compared with those for a calibrated unweighted graph. The degree distributions are based on both theoretical constructs and empirical network data. In addition, bivariate standard normal copulas are used to model the dependence between the degrees of the two edge types, allowing for modeling the correlation between edge types over a wide range. Among the results are that the weighted graph produces much richer results than the unweighted graph. Also, while R0 always increases with increasing correlation between the two degrees, this is not necessarily true for the probability of a major outbreak nor for the relative final size of a major outbreak. When using copulas we see that these can produce results that are similar to those of the empirical degree distributions, indicating that in some cases a copula is a viable alternative to using the full empirical data.

We assess the reliability of relational event model (REM) parameters estimated under two sampling schemes: (1) uniform sampling from the observed events and (2) case–control sampling which samples nonevents, or null dyads (“controls”), from a suitably defined risk set. We experimentally determine the variability of estimated parameters as a function of the number of sampled events and controls per event, respectively. Results suggest that REMs can be reliably fitted to networks with more than 12 million nodes connected by more than 360 million dyadic events by analyzing a sample of some tens of thousands of events and a small number of controls per event. Using the data that we collected on the Wikipedia editing network, we illustrate how network effects commonly included in empirical studies based on REMs need widely different sample sizes to be reliably estimated. For our analysis we use an open-source software which implements the two sampling schemes, allowing analysts to fit and analyze REMs to the same or other data that may be collected in different empirical settings, varying sample parameters or model specification.

We investigate the implications of different forms of multigroup connectivity. Four multigroup connectivity modalities are considered: co-memberships, edge bundles, bridges, and liaison hierarchies. We propose generative models to generate these four modalities. Our models are variants of planted partition or stochastic block models conditioned under certain topological constraints. We report findings of a comparative analysis in which we evaluate these structures, controlling for their edge densities and sizes, on mean rates of information propagation, convergence times to consensus, and steady-state deviations from the consensus value in the presence of noise as network size increases.