From Ties to Events in the Analysis of Interorganizational Exchange Relations.

Relational event models expand the analytical possibilities of existing statistical models for interorganizational networks by: (i) making efficient use of information contained in the sequential ordering of observed events connecting sending and receiving units; (ii) accounting for the intensity of the relation between exchange partners, and (iii) distinguishing between short- and long-term network effects. We introduce a recently developed relational event model (REM) for the analysis of continuously observed interorganizational exchange relations. The combination of efficient sampling algorithms and sender-based stratification makes the models that we present particularly useful for the analysis of very large samples of relational event data generated by interaction among heterogeneous actors. We demonstrate the empirical value of event-oriented network models in two different settings for interorganizational exchange relations-that is, high-frequency overnight transactions among European banks and patient-sharing relations within a community of Italian hospitals. We focus on patterns of direct and generalized reciprocity while accounting for more complex forms of dependence present in the data. Empirical results suggest that distinguishing between degree- and intensity-based network effects, and between short- and long-term effects is crucial to our understanding of the dynamics of interorganizational dependence and exchange relations. We discuss the general implications of these results for the analysis of social interaction data routinely collected in organizational research to examine the evolutionary dynamics of social networks within and between organizations.

Influence of Hospital Characteristics on Hospital Transfer Destinations for Patients With Stroke.

BACKGROUND: Patients with stroke are frequently transferred between hospitals. This may have implications on the quality of care received by patients; however, it is not well understood how the characteristics of sending and receiving hospitals affect the likelihood of a transfer event. Our objective was to identify hospital characteristics associated with sending and receiving patients with stroke. METHODS: Using a comprehensive statewide administrative dataset, including all 78 Massachusetts hospitals, we identified all transfers of patients with ischemic stroke between October 2007 and September 2015 for this observational study. Hospital variables included reputation (US News and World Report ranking), capability (stroke center status, annual stroke volume, and trauma center designation), and institutional affiliation. We included network variables to control for the structure of hospital-to-hospital transfers. We used relational event modeling to account for complex temporal and relational dependencies associated with transfers. This method decomposes a series of patient transfers into a sequence of decisions characterized by transfer initiations and destinations, modeling them using a discrete-choice framework. RESULTS: Among 73 114 ischemic stroke admissions there were 7189 (9.8%) transfers during the study period. After accounting for travel time between hospitals and structural network characteristics, factors associated with increased likelihood of being a receiving hospital (in descending order of relative effect size) included shared hospital affiliation (5.8× higher), teaching hospital status (4.2× higher), stroke center status (4.3× and 3.8× higher when of the same or higher status), and hospitals of the same or higher reputational ranking (1.5× higher). CONCLUSIONS: After accounting for distance and structural network characteristics, in descending order of importance, shared hospital affiliation, hospital capabilities, and hospital reputation were important factor in determining transfer destination of patients with stroke. This study provides a starting point for future research exploring how relational coordination between hospitals may ensure optimized allocation of patients with stroke for maximal patient benefit.

Testing biological network motif significance with exponential random graph models.

Analysis of the structure of biological networks often uses statistical tests to establish the over-representation of motifs, which are thought to be important building blocks of such networks, related to their biological functions. However, there is disagreement as to the statistical significance of these motifs, and there are potential problems with standard methods for estimating this significance. Exponential random graph models (ERGMs) are a class of statistical model that can overcome some of the shortcomings of commonly used methods for testing the statistical significance of motifs. ERGMs were first introduced into the bioinformatics literature over 10 years ago but have had limited application to biological networks, possibly due to the practical difficulty of estimating model parameters. Advances in estimation algorithms now afford analysis of much larger networks in practical time. We illustrate the application of ERGM to both an undirected protein-protein interaction (PPI) network and directed gene regulatory networks. ERGM models indicate over-representation of triangles in the PPI network, and confirm results from previous research as to over-representation of transitive triangles (feed-forward loop) in an E. coli and a yeast regulatory network. We also confirm, using ERGMs, previous research showing that under-representation of the cyclic triangle (feedback loop) can be explained as a consequence of other topological features. SUPPLEMENTARY INFORMATION: The online version contains supplementary material available at 10.1007/s41109-021-00434-y.

Exponential random graph model parameter estimation for very large directed networks.

Exponential random graph models (ERGMs) are widely used for modeling social networks observed at one point in time. However the computational difficulty of ERGM parameter estimation has limited the practical application of this class of models to relatively small networks, up to a few thousand nodes at most, with usually only a few hundred nodes or fewer. In the case of undirected networks, snowball sampling can be used to find ERGM parameter estimates of larger networks via network samples, and recently published improvements in ERGM network distribution sampling and ERGM estimation algorithms have allowed ERGM parameter estimates of undirected networks with over one hundred thousand nodes to be made. However the implementations of these algorithms to date have been limited in their scalability, and also restricted to undirected networks. Here we describe an implementation of the recently published Equilibrium Expectation (EE) algorithm for ERGM parameter estimation of large directed networks. We test it on some simulated networks, and demonstrate its application to an online social network with over 1.6 million nodes.

Fast Maximum Likelihood Estimation via Equilibrium Expectation for Large Network Data.

A major line of contemporary research on complex networks is based on the development of statistical models that specify the local motifs associated with macro-structural properties observed in actual networks. This statistical approach becomes increasingly problematic as network size increases. In the context of current research on efficient estimation of models for large network data sets, we propose a fast algorithm for maximum likelihood estimation (MLE) that affords a significant increase in the size of networks amenable to direct empirical analysis. The algorithm we propose in this paper relies on properties of Markov chains at equilibrium, and for this reason it is called equilibrium expectation (EE). We demonstrate the performance of the EE algorithm in the context of exponential random graph models (ERGMs) a family of statistical models commonly used in empirical research based on network data observed at a single period in time. Thus far, the lack of efficient computational strategies has limited the empirical scope of ERGMs to relatively small networks with a few thousand nodes. The approach we propose allows a dramatic increase in the size of networks that may be analyzed using ERGMs. This is illustrated in an analysis of several biological networks and one social network with 104,103 nodes.

Knowledge categorization affects popularity and quality of Wikipedia articles.

The existence of a shared classification system is essential to knowledge production, transfer, and sharing. Studies of knowledge classification, however, rarely consider the fact that knowledge categories exist within hierarchical information systems designed to facilitate knowledge search and discovery. This neglect is problematic whenever information about categorical membership is itself used to evaluate the quality of the items that the category contains. The main objective of this paper is to show that the effects of category membership depend on the position that a category occupies in the hierarchical knowledge classification system of Wikipedia-an open knowledge production and sharing platform taking the form of a freely accessible on-line encyclopedia. Using data on all English-language Wikipedia articles, we examine how the position that a category occupies in the classification hierarchy affects the attention that articles in that category attract from Wikipedia editors, and their evaluation of quality of the Wikipedia articles. Specifically, we show that Wikipedia articles assigned to coarse-grained categories (i. e., categories that occupy higher positions in the hierarchical knowledge classification system) garner more attention from Wikipedia editors (i. e., attract a higher volume of text editing activity), but receive lower evaluations (i. e., they are considered to be of lower quality). The negative relation between attention and quality implied by this result is consistent with current theories of social categorization, but it also goes beyond available results by showing that the effects of categorization on evaluation depend on the position that a category occupies in a hierarchical knowledge classification system.

Bayesian exponential random graph modelling of interhospital patient referral networks.

Using original data that we have collected on referral relations between 110 hospitals serving a large regional community, we show how recently derived Bayesian exponential random graph models may be adopted to illuminate core empirical issues in research on relational coordination among healthcare organisations. We show how a rigorous Bayesian computation approach supports a fully probabilistic analytical framework that alleviates well-known problems in the estimation of model parameters of exponential random graph models. We also show how the main structural features of interhospital patient referral networks that prior studies have described can be reproduced with accuracy by specifying the system of local dependencies that produce - but at the same time are induced by - decentralised collaborative arrangements between hospitals. Copyright © 2017 John Wiley & Sons, Ltd.

Relational event models for longitudinal network data with an application to interhospital patient transfers.

The main objective of this paper is to introduce and illustrate relational event models, a new class of statistical models for the analysis of time-stamped data with complex temporal and relational dependencies. We outline the main differences between recently proposed relational event models and more conventional network models based on the graph-theoretic formalism typically adopted in empirical studies of social networks. Our main contribution involves the definition and implementation of a marked point process extension of currently available models. According to this approach, the sequence of events of interest is decomposed into two components: (a) event time and (b) event destination. This decomposition transforms the problem of selection of event destination in relational event models into a conditional multinomial logistic regression problem. The main advantages of this formulation are the possibility of controlling for the effect of event-specific data and a significant reduction in the estimation time of currently available relational event models. We demonstrate the empirical value of the model in an analysis of interhospital patient transfers within a regional community of health care organizations. We conclude with a discussion of how the models we presented help to overcome some the limitations of statistical models for networks that are currently available. Copyright © 2017 John Wiley & Sons, Ltd.

The Third Man: hierarchy formation in Wikipedia.

Wikipedia articles are written by teams of independent volunteers in the absence of formal hierarchical organizational structures. How is coordination achieved under such conditions of extreme decentralization? Building on studies on the organization of dominance relations in animal and human societies, we theorize that coordination in Wikipedia is made possible by an emergent hierarchical order sustained by self-organizing sequences of text editing events. We propose a new method to turn the editing history of Wikipedia pages into an evolving multiplex network resulting from three types of interaction events: dyadic undo, dyadic redo, and third-party based edit events. We develop new relational event models for signed networks that specify how the probability of observing various types of edit events depends on their embeddedness in sequences of past edit events. Using a random sample of page histories comprising 12,719 revisions produced by 7,657 unique users, we examine the relation between theoretically defined sequences of text editing events, and the emergence of linear dominance hierarchies that regulate production relations within Wikipedia. We find evidence that dyadic interaction gives rise to systematic extra-dyadic dependence structures that are partially consistent with a hierarchical interpretation of the Wikipedia editing network. We support and complement the statistical analysis of multiplex event networks with data visualizations that provide qualitative validation of our main results.

Investigating the Temporal Dynamics of Interorganizational Exchange: Patient Transfers among Italian Hospitals.

Previous research on interaction behavior among organizations (resource exchange, collaboration, communication) has typically aggregated those behaviors over time as a network of organizational relationships. The authors instead study structural-temporal patterns in organizational exchange, focusing on the dynamics of reciprocation. Applying this lens to a community of Italian hospitals during 2003-7, the authors observe two mechanisms of interorganizational reciprocation: organizational embedding and resource dependence. The authors show how these two mechanisms operate on distinct time horizons: dependence applies to contemporaneous exchange structures, whereas embedding develops through longer-term historical patterns. They also show how these processes operate differently in competitive and non-competitive contexts, operationalized in terms of market differentiation and geographic space. In noncompetitive contexts, the authors observe both logics of reciprocation, dependence in the short term and embedding over the long term, developing into population-level generalized exchange. In competitive contexts, they find no reciprocation and instead observe the microfoundations of status hierarchies.

Quality of care and interhospital collaboration: a study of patient transfers in Italy.

OBJECTIVES: We examine the dynamics of patient-sharing relations within an Italian regional community of 35 hospitals serving approximately 1,300,000 people. We test whether interorganizational relations provide individual patients access to higher quality providers of care. RESEARCH DESIGN AND METHODS: We reconstruct the complete temporal sequence of the 3461 consecutive interhospital patient-sharing events observed between each pair of hospitals in the community during 2005-2008. We distinguish between transfers occurring between and within different medical specialties. We estimate newly derived models for relational event sequences that allow us to control for the most common forms of network-like dependencies that are known to characterize collaborative relations between hospitals. We use 45-day risk-adjusted readmission rate as a proxy for hospital quality. RESULTS: After controls (eg, geographical distance, size, and the existence of prior collaborative relations), we find that patients flow from less to more capable hospitals. We show that this result holds for patient being shared both between as well as within medical specialties. Nonetheless there are strong and persistent other organizational and relational effects driving transfers. CONCLUSIONS: Decentralized patient-sharing decisions taken by the 35 hospitals give rise to a system of collaborative interorganizational arrangements that allow the patient to access hospitals delivering a higher quality of care. This result is relevant for health care policy because it suggests that collaborative relations between hospitals may produce desirable outcomes both for individual patients, and for regional health care systems.

A model for the multiplex dynamics of two-mode and one-mode networks, with an application to employment preference, friendship, and advice.

We propose a new stochastic actor-oriented model for the co-evolution of two-mode and one-mode networks. The model posits that activities of a set of actors, represented in the two-mode network, co-evolve with exchanges and interactions between the actors, as represented in the one-mode network. The model assumes that the actors, not the activities, have agency. The empirical value of the model is demonstrated by examining how employment preferences co-evolve with friendship and advice relations in a group of seventy-five MBA students. The analysis shows that activity in the two-mode network, as expressed by number of employment preferences, is related to activity in the friendship network, as expressed by outdegrees. Further, advice ties between students lead to agreement with respect to employment preferences. In addition, considering the multiplexity of advice and friendship ties yields a better understanding of the dynamics of the advice relation: tendencies to reciprocation and homophily in advice relations are mediated to an important extent by friendship relations. The discussion pays attention to the implications of this study in the broader context of current efforts to model the co-evolutionary dynamics of social networks and individual behavior.

Why Are Some More Peer Than Others? Evidence from a Longitudinal Study of Social Networks and Individual Academic Performance.

Studies of peer effects in educational settings confront two main problems. The first is the presence of endogenous sorting which confounds the effects of social influence and social selection on individual attainment. The second is how to account for the local network dependencies through which peer effects influence individual behavior. We empirically address these problems using longitudinal data on academic performance, friendship, and advice seeking relations among students in a full-time graduate academic program. We specify stochastic agent-based models that permit estimation of the interdependent contribution of social selection and social influence to individual performance. We report evidence of peer effects. Students tend to assimilate the average performance of their friends and of their advisors. At the same time, students attaining similar levels of academic performance are more likely to develop friendship and advice ties. Together, these results imply that processes of social influence and social selection are sub-components of a more general a co-evolutionary process linking network structure and individual behavior. We discuss possible points of contact between our findings and current research in the economics and sociology of education.