Dynamics of technology emergence in innovation networks.

To create the next innovative product, participants in science need to understand which existing technologies can be combined, what new science must be discovered, and what new technologies must be invented. Knowledge of these often arrives by means of expert consensus or popularity metrics, masking key information on how intellectual efforts accumulate into technological progress. To address this shortcoming, we first present a method to establish a mathematical link between technological evolution and complex networks: a path of events that narrates innovation bottlenecks. Next, we quantify the position and proximity of documents to these innovation paths. The result is an innovation network that more exhaustively captures deterministic knowledge flows with respect to a marketed innovative product. Our dataset, containing over three million biomedical citations, demonstrates the possibility of quantifying the accumulation, speed, and division of labour in innovation over a sixty-year time horizon. The significance of this study includes the (i) use of a purpose-generated dataset showing causal paths from research to development to product; (ii) analysis of the innovation process as a directed acyclic graph; (iii) comparison between calendar time and network time; (iv) ordering of science funders along technology lifecycles; (v) quantification of innovative activities' importance to an innovative outcome; and (vi) integration of publication, patent, clinical trial, regulatory data to study innovation holistically.

Higher-order temporal network effects through triplet evolution.

We study the evolution of networks through 'triplets'-three-node graphlets. We develop a method to compute a transition matrix to describe the evolution of triplets in temporal networks. To identify the importance of higher-order interactions in the evolution of networks, we compare both artificial and real-world data to a model based on pairwise interactions only. The significant differences between the computed matrix and the calculated matrix from the fitted parameters demonstrate that non-pairwise interactions exist for various real-world systems in space and time, such as our data sets. Furthermore, this also reveals that different patterns of higher-order interaction are involved in different real-world situations. To test our approach, we then use these transition matrices as the basis of a link prediction algorithm. We investigate our algorithm's performance on four temporal networks, comparing our approach against ten other link prediction methods. Our results show that higher-order interactions in both space and time play a crucial role in the evolution of networks as we find our method, along with two other methods based on non-local interactions, give the best overall performance. The results also confirm the concept that the higher-order interaction patterns, i.e., triplet dynamics, can help us understand and predict the evolution of different real-world systems.

Understanding the transition from paroxysmal to persistent atrial fibrillation.

Atrial fibrillation (AF) is the most common cardiac arrhytmia, characterized by the chaotic motion of electrical wavefronts in the atria. In clinical practice, AF is classified under two primary categories: paroxysmal AF, short intermittent episodes separated by periods of normal electrical activity; and persistent AF, longer uninterrupted episodes of chaotic electrical activity. However, the precise reasons why AF in a given patient is paroxysmal or persistent is poorly understood. Recently, we have introduced the percolation-based Christensen-Manani-Peters (CMP) model of AF which naturally exhibits both paroxysmal and persistent AF, but precisely how these differences emerge in the model is unclear. In this paper, we dissect the CMP model to identify the cause of these different AF classifications. Starting from a mean-field model where we describe AF as a simple birth-death process, we add layers of complexity to the model and show that persistent AF arises from reentrant circuits which exhibit an asymmetry in their probability of activation relative to deactivation. As a result, different simulations generated at identical model parameters can exhibit fibrillatory episodes spanning several orders of magnitude from a few seconds to months. These findings demonstrate that diverse, complex fibrillatory dynamics can emerge from very simple dynamics in models of AF.

The longest path in the Price model.

The Price model, the directed version of the Barabási-Albert model, produces a growing directed acyclic graph. We look at variants of the model in which directed edges are added to the new vertex in one of two ways: using cumulative advantage (preferential attachment) choosing vertices in proportion to their degree, or with random attachment in which vertices are chosen uniformly at random. In such networks, the longest path is well defined and in some cases is known to be a better approximation to geodesics than the shortest path. We define a reverse greedy path and show both analytically and numerically that this scales with the logarithm of the size of the network with a coefficient given by the number of edges added using random attachment. This is a lower bound on the length of the longest path to any given vertex and we show numerically that the longest path also scales with the logarithm of the size of the network but with a larger coefficient that has some weak dependence on the parameters of the model.

How the network properties of shareholders vary with investor type and country.

We construct two examples of shareholder networks in which shareholders are connected if they have shares in the same company. We do this for the shareholders in Turkish companies and we compare this against the network formed from the shareholdings in Dutch companies. We analyse the properties of these two networks in terms of the different types of shareholder. We create a suitable randomised version of these networks to enable us to find significant features in our networks. For that we find the roles played by different types of shareholder in these networks, and also show how these roles differ in the two countries we study.

Social success of perfumes.

We study data on perfumes and their odour descriptors-notes-to understand how note compositions, called accords, influence successful fragrance formulas. We obtain accords which tend to be present in perfumes that receive significantly more customer ratings. Our findings show that the most popular notes and the most over-represented accords are different to those that have the strongest effect to the perfume ratings. We also used network centrality to understand which notes have the highest potential to enhance note compositions. We find that large degree notes, such as musk and vanilla as well as generically-named notes, e.g. floral notes, are amongst the notes that enhance accords the most. This work presents a framework which would be a timely tool for perfumers to explore a multidimensional space of scent compositions.

Collaborative patterns, authorship practices and scientific success in biomedical research: a network analysis.

OBJECTIVE: To investigate the relationship between biomedical researchers' collaborative and authorship practices and scientific success. DESIGN: Longitudinal quantitative analysis of individual researchers' careers over a nine-year period. SETTING: A leading biomedical research institution in the United Kingdom. PARTICIPANTS: Five hundred and twenty-five biomedical researchers who were in employment on 31 December 2009. MAIN OUTCOME MEASURES: We constructed the co-authorship network in which nodes are the researchers, and links are established between any two researchers if they co-authored one or more articles. For each researcher, we recorded the position held in the co-authorship network and in the bylines of all articles published in each three-year interval and calculated the number of citations these articles accrued until January 2013. We estimated maximum likelihood negative binomial panel regression models. RESULTS: Our analysis suggests that collaboration sustained success, yet excessive co-authorship did not. Last positions in non-alphabetised bylines were beneficial for higher academic ranks but not for junior ones. A professor could witness a 20.57% increase in the expected citation count if last-listed non-alphabetically in one additional publication; yet, a lecturer suffered from a 13.04% reduction. First positions in alphabetised bylines were positively associated with performance for junior academics only. A lecturer could experience a 8.78% increase in the expected citation count if first-listed alphabetically in one additional publication. While junior researchers amplified success when brokering among otherwise disconnected collaborators, senior researchers prospered from socially cohesive networks, rich in third-party relationships. CONCLUSIONS: These results help biomedical scientists shape successful careers and research institutions develop effective assessment and recruitment policies that will ultimately sustain the quality of biomedical research and patient care.

Embedding graphs in Lorentzian spacetime.

Geometric approaches to network analysis combine simply defined models with great descriptive power. In this work we provide a method for embedding directed acyclic graphs (DAG) into Minkowski spacetime using Multidimensional scaling (MDS). First we generalise the classical MDS algorithm, defined only for metrics with a Riemannian signature, to manifolds of any metric signature. We then use this general method to develop an algorithm which exploits the causal structure of a DAG to assign space and time coordinates in a Minkowski spacetime to each vertex. As in the causal set approach to quantum gravity, causal connections in the discrete graph correspond to timelike separation in the continuous spacetime. The method is demonstrated by calculating embeddings for simple models of causal sets and random DAGs, as well as real citation networks. We find that the citation networks we test yield significantly more accurate embeddings that random DAGs of the same size. Finally we suggest a number of applications in citation analysis such as paper recommendation, identifying missing citations and fitting citation models to data using this geometric approach.

Uncovering space-independent communities in spatial networks.

Many complex systems are organized in the form of a network embedded in space. Important examples include the physical Internet infrastructure, road networks, flight connections, brain functional networks, and social networks. The effect of space on network topology has recently come under the spotlight because of the emergence of pervasive technologies based on geolocalization, which constantly fill databases with people's movements and thus reveal their trajectories and spatial behavior. Extracting patterns and regularities from the resulting massive amount of human mobility data requires the development of appropriate tools for uncovering information in spatially embedded networks. In contrast with most works that tend to apply standard network metrics to any type of network, we argue in this paper for a careful treatment of the constraints imposed by space on network topology. In particular, we focus on the problem of community detection and propose a modularity function adapted to spatial networks. We show that it is possible to factor out the effect of space in order to reveal more clearly hidden structural similarities between the nodes. Methods are tested on a large mobile phone network and computer-generated benchmarks where the effect of space has been incorporated.