Search

The breakthrough potentials of research papers can be explained by their boundary-spanning qualities. Here, for the first time, we apply the structural variation analysis (SVA) model and its affiliated metrics to investigate the extent to which such qualities characterize a group of Nobel Prize winning papers. We find that these papers share remarkable boundary-spanning traits, marked by exceptional abilities to connect disparate and topically-diverse clusters of research papers. Further, their publications exert structural variations on a scale that significantly alters the betweenness centrality distributions in existing intellectual space. Overall, SVA not only provides a set of leading indicators for describing future Nobel Prize winning papers, but also broadens our understanding of similar prize-winning properties that may have been overlooked among other regular publications. [ABSTRACT FROM AUTHOR]

The Panama Papers comprise one of the most recent influential leaks containing detailed information on intermediary companies (such as law firms), offshore entities and company officers, and serve as a valuable source of insight into the operations of (approximately) 214,000 shell companies incorporated in tax havens around the globe over the past half century. Entities and relations in the papers can be used to construct a network that permits, in principle, a systematic and scientific study at scale using techniques developed in the computational social science and network science communities. In this paper, we propose such a study by attempting to quantify and profile the importance of entities. In particular, our research explores whether intermediaries are significantly more influential than offshore entities, and whether different centrality measures lead to varying, or even incompatible, conclusions. Some findings yield conclusions that resemble Simpson's paradox. We also explore the role that jurisdictions play in determining entity importance. [ABSTRACT FROM AUTHOR]

Moderate-to-severe psoriasis is associated with significant comorbidity, an impaired quality of life, and increased medical costs, including those associated with treatments. Systematic reviews (SRs) and meta-analyses (MAs) of randomized clinical trials are considered two of the best approaches to the summarization of high-quality evidence. However, methodological bias can reduce the validity of conclusions from these types of studies and subsequently impair the quality of decision making. As co-authorship is among the most well-documented forms of research collaboration, the present study aimed to explore whether authors’ collaboration methods might influence the methodological quality of SRs and MAs of psoriasis. Methodological quality was assessed by two raters who extracted information from full articles. After calculating total and per-item Assessment of Multiple Systematic Reviews (AMSTAR) scores, reviews were classified as low (0-4), medium (5-8), or high (9-11) quality. Article metadata and journal-related bibliometric indices were also obtained. A total of 741 authors from 520 different institutions and 32 countries published 220 reviews that were classified as high (17.2%), moderate (55%), or low (27.7%) methodological quality. The high methodological quality subnetwork was larger but had a lower connection density than the low and moderate methodological quality subnetworks; specifically, the former contained relatively fewer nodes (authors and reviews), reviews by authors, and collaborators per author. Furthermore, the high methodological quality subnetwork was highly compartmentalized, with several modules representing few poorly interconnected communities. In conclusion, structural differences in author-paper affiliation network may influence the methodological quality of SRs and MAs on psoriasis. As the author-paper affiliation network structure affects study quality in this research field, authors who maintain an appropriate balance between scientific quality and productivity are more likely to develop higher quality reviews. [ABSTRACT FROM AUTHOR]

Several network features and information retrieval methods have been proposed to elucidate the structure of citation networks and to detect important nodes. However, it is difficult to retrieve information related to trends in an academic field and to detect cutting-edge areas from the citation network. In this paper, we propose a novel framework that detects the trend as the growth direction of a citation network using network representation learning(NRL). We presume that the linear growth of citation network in latent space obtained by NRL is the result of the iterative edge additional process of a citation network. On APS datasets and papers of some domains of the Web of Science, we confirm the existence of trends by observing that an academic field grows in a specific direction linearly in latent space. Next, we calculate each node’s degree of trend-following as an indicator called the intrinsic publication year (IPY). As a result, there is a correlation between the indicator and the number of future citations. Furthermore, a word frequently used in the abstracts of cutting-edge papers (high-IPY paper) is likely to be used often in future publications. These results confirm the validity of the detected trend for predicting citation network growth. [ABSTRACT FROM AUTHOR]

The literature on social learning examines how people learn from their neighbors and reach a consensus. The DeGroot social learning model describes the social learning process as one in which people form their opinions by taking a weighted average of their neighbors' opinions. In the model, the influence structure is represented by a single matrix. In this paper, we empirically identify the role of the hub and authority centralities based on this matrix using data on microfinance adoption in rural Indian villages. Controlling for other well-known centrality measures, authority centrality is positively associated with final adoption rates in the villages, but hub centrality is not. Furthermore, we find that authority centrality is the most informative variable predicting microfinance diffusion success from LASSO regressions. [ABSTRACT FROM AUTHOR]

Bibliometric indicators are increasingly used to evaluate individual scientists–as is exemplified by the popularity of the many other publication and citation-based indicators used in evaluation. These indicators, however, cover at best some of the quality dimensions relevant for assessing a researcher: productivity and impact. At the same time, research quality has more dimensions than productivity and impact alone. As current bibliometric indicators are not covering various important quality dimensions, we here contribute to developing better indicators for those quality dimensions not yet addressed. One of the quality dimensions lacking valid indicators is an individual researcher’s independence. We propose indicators to measure different aspects of independence: two assessing whether a researcher has developed an own collaboration network and two others assessing the level of thematic independence. Taken together they form an independence indicator. We illustrate how these indicators distinguish between researchers that are equally productive and have a considerable impact. The independence indicator is a step forward in evaluating individual scholarly quality. [ABSTRACT FROM AUTHOR]

This paper describes how Atomic Layer Deposition (ALD) has evolved over time using a combination of bibliometric, social network, and text analysis. We examined the rate of knowledge production as well as changes in authors, journals, and collaborators, showing a steady growth of ALD research. The study of the collaboration network of ALD scientists over time points out that the ALD research community is becoming larger and more interconnected, with a largest connected component that spans 90% of the authors in 2015. In addition, the evolution of network centrality measures (degree and betweenness centrality) and author productivity revealed the central figures in ALD over time, including new “stars” appearing in the last decade. Finally, the study of the title words in our dataset is consistent with a shift in focus on research topics towards energy applications and nanotechnology. [ABSTRACT FROM AUTHOR]

This paper focuses on evaluating the systemic risk in interbank networks, proposing a series of measurements: risk distance, risk degree and m-order risk degree. The proposed measurements are formally proven to have good basic and extended properties that are able to reflect the effect of bank size, liability size, liability distribution, and the discount factor on the default risk, not only of a single bank, but also of the entire system. Additionally, the abovementioned properties and the relationship between risk distance and financial contagion indicate the rationality embodied in the proposed measurements. This paper also provides some implications on how to decrease or prevent the systemic risk in an interbank system. [ABSTRACT FROM AUTHOR]

This paper examines research on peer review between 1969 and 2015 by looking at records indexed from the Scopus database. Although it is often argued that peer review has been poorly investigated, we found that the number of publications in this field doubled from 2005. A half of this work was indexed as research articles, a third as editorial notes and literature reviews and the rest were book chapters or letters. We identified the most prolific and influential scholars, the most cited publications and the most important journals in the field. Co-authorship network analysis showed that research on peer review is fragmented, with the largest group of co-authors including only 2.1% of the whole community. Co-citation network analysis indicated a fragmented structure also in terms of knowledge. This shows that despite its central role in research, peer review has been examined only through small-scale research projects. Our findings would suggest that there is need to encourage collaboration and knowledge sharing across different research communities. [ABSTRACT FROM AUTHOR]

Networks science techniques are frequently used to provide meaningful insights into the populations underlying medical and social data. This paper examines SATHCAP, a dataset related to HIV and drug use in three US cities. In particular, we use network measures such as betweenness centrality, closeness centrality, and eigenvector centrality to find central, important nodes in a network derived from SATHCAP data. We evaluate the attributes of these important nodes and create an exceptionality score based on the number of nodes that share a particular attribute. This score, along with the underlying network itself, is used to reveal insight into the attributes of groups that can be effectively targeted to slow the spread of disease. Our research confirms a known connection between homelessness and HIV, as well as drug abuse and HIV, and shows support for the theory that individuals without easy access to transportation are more likely to be central to the spread of HIV in urban, high risk populations. [ABSTRACT FROM AUTHOR]

Aiming at serving the interdisciplinary demand in network science, this paper introduces a new concept for complex networks, named network stiffness, which is extracted from structural engineering by assuming that a complex network behaves similarly with a structured framework. This analogy allows interpreting that a complex network can resist against any cause attempting to induce deformation changes to the network’s structure, regardless of whether the network is material or not. Within this framework, this paper examines the context of applying the conceptual analogy of stiffness from the field of structural engineering to network science and then it develops computational approaches capturing different aspects of network stiffness so that to be used in complex network analysis. The implementation of these approaches to a real-world network (global inbound tourism network) shows that stiffness can produce interesting insights to complex network analysis about the factors related to changes caused to the structure and the status of a complex network. [ABSTRACT FROM AUTHOR]

In biomedicine, scientific literature is a valuable source for knowledge discovery. Mining knowledge from textual data has become an ever important task as the volume of scientific literature is growing unprecedentedly. In this paper, we propose a framework for examining a certain disease based on existing information provided by scientific literature. Disease-related entities that include diseases, drugs, and genes are systematically extracted and analyzed using a three-level network-based approach. A paper-entity network and an entity co-occurrence network (macro-level) are explored and used to construct six entity specific networks (meso-level). Important diseases, drugs, and genes as well as salient entity relations (micro-level) are identified from these networks. Results obtained from the literature-based literature mining can serve to assist clinical applications. [ABSTRACT FROM AUTHOR]

Quantifying a node's importance is decisive for developing efficient strategies to curb or accelerate any spreading phenomena. Centrality measures are well-known methods used to quantify the influence of nodes by extracting information from the network's structure. The pitfall of these measures is to pinpoint nodes located in the vicinity of each other, saturating their shared zone of influence. In this paper, we propose a ranking strategy exploiting the ubiquity of the community structure in real-world networks. The proposed community-aware ranking strategy naturally selects a set of distant spreaders with the most significant influence in the networks. One can use it with any centrality measure. We investigate its effectiveness using real-world and synthetic networks with controlled parameters in a Susceptible-Infected-Recovered (SIR) diffusion model scenario. Experimental results indicate the superiority of the proposed ranking strategy over all its counterparts agnostic about the community structure. Additionally, results show that it performs better in networks with a strong community structure and a high number of communities of heterogeneous sizes. [ABSTRACT FROM AUTHOR]

Extractive document summarization (EDS) is usually seen as a sequence labeling task, which extracts sentences from a document one by one to form a summary. However, extracting sentences separately ignores the relationship between the sentences and documents. One solution is to use sentence position information to enhance sentence representation, but this will cause the sentence-leading bias problem, especially in news datasets. In this paper, we propose a novel sentence centrality for the EDS task to address these two problems. The sentence centrality is based on directed graphs, while reflecting the sentence-document relationship, it also reflects the sentence position information in the document. We implicitly strengthen the relevance of sentences and documents by using sentence centrality to enhance sentence representation. Notably, we replaced the sentence position information with sentence centrality to reduce sentence-leading bias without causing model performance degradation. Experiments on the CNN/Daily Mail dataset showed that EDS models with sentence centrality significantly improved compared with baseline models. [ABSTRACT FROM AUTHOR]

Industrial robots are a strategic future technology and an important part of the development of artificial intelligence, and they are a necessary means for the intelligent transformation of manufacturing industry. Based on global industrial robot trade data from 1998 to 2017, this paper applies the dynamic complex network analysis method to reveal the spatial and temporal variation characteristics and trade status evolution of the global industrial robot trade network. The results show that the global industrial robot network density has steadily increased, and the industrial robot trade has been characterized by ‘diversification’. The number of major industrial robot exporters in the world is increasing, and the import market is increasingly diversified. The export market structure is relatively tight, the centrality of the global industrial robot trade network shows a downward trend, and the dissimilarity of the ‘core-edge’ clusters decreases year by year. The trade status of ‘catch-up’ countries represented by China has rapidly increased. However, Japan, Germany, and Italy are still in the central position of the industrial robot trade. Moreover, trade of the ‘catch-up’ countries’ is dominated by imports, and exports of industrial robot products are insufficient. Finally, policy suggestions are provided according to the results. [ABSTRACT FROM AUTHOR]

Modern infrastructure networks are often coupled together and thus could be modeled as interdependent networks. Overload and interdependent effect make interdependent networks more fragile when suffering from attacks. Existing research has primarily concentrated on the cascading failure process of interdependent networks without load, or the robustness of isolated network with load. Only limited research has been done on the cascading failure process caused by overload in interdependent networks. Redundant design is a primary approach to enhance the reliability and robustness of the system. In this paper, we propose two redundant methods, node back-up and dependency redundancy, and the experiment results indicate that two measures are effective and costless. Two detailed models about redundant design are introduced based on the non-linear load-capacity model. Based on the attributes and historical failure distribution of nodes, we introduce three static selecting strategies-Random-based, Degree-based, Initial load-based and a dynamic strategy-HFD (historical failure distribution) to identify which nodes could have a back-up with priority. In addition, we consider the cost and efficiency of different redundant proportions to determine the best proportion with maximal enhancement and minimal cost. Experiments on interdependent networks demonstrate that the combination of HFD and dependency redundancy is an effective and preferred measure to implement redundant design on interdependent networks. The results suggest that the redundant design proposed in this paper can permit construction of highly robust interactive networked systems. [ABSTRACT FROM AUTHOR]

In this paper, we apply an original scientometric analyses to a corpus comprising synthetic biology (SynBio) publications in Thomson Reuters Web of Science to characterize the emergence of this new scientific field. Three results were drawn from this empirical investigation. First, despite the exponential growth of publications, the study of population level statistics (newcomers proportion, collaboration network structure) shows that SynBio has entered a stabilization process since 2010. Second, the mapping of textual and citational networks shows that SynBio is characterized by high heterogeneity and four different approaches: the central approach, where biobrick engineering is the most widespread; genome engineering; protocell creation; and metabolic engineering. We suggest that synthetic biology acts as an umbrella term allowing for the mobilization of resources, and also serves to relate scientific content and promises of applications. Third, we observed a strong intertwinement between epistemic and socio-economic dynamics. Measuring scientific production and impact and using structural analysis data, we identified a core set of mostly American scientists. Biographical analysis shows that these central and influential scientists act as “boundary spanners,” meaning that their importance to the field lies not only in their academic contributions, but also in their capacity to interact with other social spaces that are outside the academic sphere. [ABSTRACT FROM AUTHOR]

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability. [ABSTRACT FROM AUTHOR]

Social networks influence health-related behavior, such as obesity and smoking. While researchers have studied social networks as a driver for diffusion of influences and behavior, it is less understood how the structure or topology of the network, in itself, impacts an individual's health behavior and wellness state. In this paper, we investigate whether the structure or topology of a social network offers additional insight and predictability on an individual's health and wellness. We develop a method called the Network-Driven health predictor (NetCARE) that leverages features representative of social network structure. Using a large longitudinal data set of students enrolled in the NetHealth study at the University of Notre Dame, we show that the NetCARE method improves the overall prediction performance over the baseline models—that use demographics and physical attributes—by 38%, 65%, 55%, and 54% for the wellness states—stress, happiness, positive attitude, and self-assessed health—considered in this paper. [ABSTRACT FROM AUTHOR]

The Internet provides students with a unique opportunity to connect and maintain social ties with peers from other schools, irrespective of how far they are from each other. However, little is known about the real structure of such online relationships. In this paper, we investigate the structure of interschool friendship on a popular social networking site. We use data from 36, 951 students from 590 schools of a large European city. We find that the probability of a friendship tie between students from neighboring schools is high and that it decreases with the distance between schools following the power law. We also find that students are more likely to be connected if the educational outcomes of their schools are similar. We show that this fact is not a consequence of residential segregation. While high- and low-performing schools are evenly distributed across the city, this is not the case for the digital space, where schools turn out to be segregated by educational outcomes. There is no significant correlation between the educational outcomes of a school and its geographical neighbors; however, there is a strong correlation between the educational outcomes of a school and its digital neighbors. These results challenge the common assumption that the Internet is a borderless space, and may have important implications for the understanding of educational inequality in the digital age. [ABSTRACT FROM AUTHOR]

Scientific research is often thought of as being conducted by individuals and small teams striving for disciplinary advances. Yet as a whole, this endeavor more closely resembles a complex and integrated system of people, papers, and ideas. Studies of co-authorship and citation networks have revealed important structural properties of researchers and articles, but currently the structure of scientific ideas themselves is not well understood. In this study, we posit that topic networks may be a useful framework for revealing the nature of conceptual relationships. Using this framework, we map the landscape of interconnected research topics covered in the multidisciplinary journal PNAS since 2000, constructing networks in which nodes represent topics of study and edges give the extent to which topics occur in the same papers. The network displays small-world architecture, characterized by regions of dense local connectivity with sparse connectivity between them. In this network, dense local connectivity additionally gives rise to distinct clusters of related topics. Yet notably, these clusters tend not to align with assigned article classifications, and instead contain topics from various disciplines. Using a temporal graph, we find that small-worldness has increased over time, suggesting growing efficiency and integration of ideas. Finally, we define two measures of interdisciplinarity, one of which is found to be positively associated with PNAS’s impact factor. Broadly, this work suggests that complex and dynamic patterns of knowledge emerge from scientific research, and that structures reflecting intellectual integration may be beneficial for obtaining scientific insight. [ABSTRACT FROM AUTHOR]

In this paper we investigate the changes in the functional connectivity intensity, and some related properties, in healthy people, across the life span and at resting state. For the explicit computation of the functional connectivity we exploit a recently proposed model, that bases not only on the correlations data provided by the acquisition equipment, but also on different parameters, such as the anatomical distances between nodes and their degrees. The leading purpose of the paper is to show that the proposed approach is able to recover the main aspects of resting state condition known from the available literature, as well as to suggest new insights, perspectives and speculations from a neurobiological point of view. Our study involves 133 subjects, both males and females of different ages, with no evidence of neurological diseases or systemic disorders. First, we show how the model applies to the sample, where the subjects are grouped into 28 different groups (14 of males and 14 of females), according to their age. This leads to the construction of two graphs (one for males and one for females), that can be realistically interpreted as representative of the neural network during the resting state. Second, following the idea that the brain network is better understood by focusing on specific nodes having a kind of centrality, we refine the two output graphs by introducing a new metric that favours the selection of nodes having higher degrees. As a third step, we extensively comment and discuss the obtained results. In particular, it is remarkable that, despite a great overlapping exists between the outcomes concerning males and females, some intriguing differences appear. This motivates a deeper local investigation, which represents the fourth part of the paper, carried out through a thorough statistical analysis. As a result, we are enabled to support that, for two special age groups, a few links contribute in differentiating the behaviour of males and females. In addition, we performed an average-based comparison between the proposed model and the traditional statistical correlation-based approach, then discussing and commenting the main outlined discrepancies. [ABSTRACT FROM AUTHOR]

Ideal configuration or layout of highways should resemble the actual demands for the roads represented by Origin-Destination (OD) information. It would be beneficial if existing highways can be evaluated for their configurational fitness against the current demands, and newly planned highways can carefully be designed in terms of their layouts and topologies that would reflect the demands. Analysis techniques used for complex networks in the matured field of network theory can be applied for the highway layout health monitoring against the current OD information. This paper proposes a methodology of measuring the fitness of existing highways by comparing their structural configuration against conceptual OD networks using well-established techniques in network theory for complex networks. In the first phase, this paper conducts an empirical analysis and finds that both structural highway network and OD network follow the “power law” distribution as they are weighted by capacity and traffic volume respectively. It is also found that the power law coefficient of the OD network dynamically changes throughout the day and week. In the second phase, a noble methodology of weighting and measuring the health, of structural highway networks against OD networks by means of comparing their power law coefficients is proposed. It is found that the proposed method is effective at detecting deviations from ideal structural configurations associated with actual demands. [ABSTRACT FROM AUTHOR]

This paper applies objective methods to explore the technological origins of the widely acclaimed CRISPR breakthrough in the technological domain of genome engineering. Previously developed patent search techniques are first used to recover a set of patents that well-represent the genome editing domain before CRISPR. Main paths are then determined from the citation network associated with this patent set allowing identification of the three major knowledge trajectories. The most significant of these trajectories for CRISPR involves the core of genome editing with less significant trajectories involving cloning and endonuclease specific developments. The major patents on the core trajectory are consistent with qualitative expert knowledge of the topical area. A second set of patents that we call the CRISPR roots are obtained by finding the patents directly cited by the recent CRISPR patents along with patents cited by that set of patents. We find that the CRISPR roots contain 8 key patents from the genome engineering main path associated with restriction endonucleases and the expected strong connection of CRISPR to prior genome editing technology such as Zn finger nucleases. Nonetheless, analysis of the full CRISPR roots shows that a very wide array of technological knowledge beyond genome engineering has contributed to achieving the CRISPR breakthrough. Such breadth in origins is not surprising since “spillover” is generally perceived as important and previous qualitative studies of CRISPR have shown not only technological breadth in origins but scientific breadth as well. In addition, we find that the estimated rate of functional performance improvement of the CRISPR roots set is about 9% per year compared to the genome engineering set (~4% per year). These estimates indicate below average rates of improvement and may indicate that CRISPR (and perhaps yet undiscovered) genome engineering developments could evolve in effectiveness over an upcoming long rather than short time period. [ABSTRACT FROM AUTHOR]

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors’ long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests. [ABSTRACT FROM AUTHOR]

Multi-stakeholder platforms (MSPs) have been playing an increasing role in interventions aiming to generate and scale innovations in agricultural systems. However, the contribution of MSPs in achieving innovations and scaling has been varied, and many factors have been reported to be important for their performance. This paper aims to provide evidence on the contribution of MSPs to innovation and scaling by focusing on three developing country cases in Burundi, Democratic Republic of Congo, and Rwanda. Through social network analysis and logistic models, the paper studies the changes in the characteristics of multi-stakeholder innovation networks targeted by MSPs and identifies factors that play significant roles in triggering these changes. The results demonstrate that MSPs do not necessarily expand and decentralize innovation networks but can lead to contraction and centralization in the initial years of implementation. They show that some of the intended next users of interventions with MSPs–local-level actors–left the innovation networks, whereas the lead organization controlling resource allocation in the MSPs substantially increased its centrality. They also indicate that not all the factors of change in innovation networks are country specific. Initial conditions of innovation networks and funding provided by the MSPs are common factors explaining changes in innovation networks across countries and across different network functions. The study argues that investigating multi-stakeholder innovation network characteristics targeted by the MSP using a network approach in early implementation can contribute to better performance in generating and scaling innovations, and that funding can be an effective implementation tool in developing country contexts. [ABSTRACT FROM AUTHOR]

Complex networks are a useful tool for the understanding of complex systems. One of the emerging properties of such systems is their tendency to form hierarchies: networks can be organized in levels, with nodes in each level exerting control on the ones beneath them. In this paper, we focus on the problem of estimating how hierarchical a directed network is. We propose a structural argument: a network has a strong top-down organization if we need to delete only few edges to reduce it to a perfect hierarchy—an arborescence. In an arborescence, all edges point away from the root and there are no horizontal connections, both characteristics we desire in our idealization of what a perfect hierarchy requires. We test our arborescence score in synthetic and real-world directed networks against the current state of the art in hierarchy detection: agony, flow hierarchy and global reaching centrality. These tests highlight that our arborescence score is intuitive and we can visualize it; it is able to better distinguish between networks with and without a hierarchical structure; it agrees the most with the literature about the hierarchy of well-studied complex systems; and it is not just a score, but it provides an overall scheme of the underlying hierarchy of any directed complex network. [ABSTRACT FROM AUTHOR]

In this paper, we use network approaches to analyze the relations between protein sequence features for the top hierarchical classes of CATH and SCOP. We use fundamental connectivity measures such as correlation (CR), normalized mutual information rate (nMIR), and transfer entropy (TE) to analyze the pairwise-relationships between the protein sequence features, and use centrality measures to analyze weighted networks constructed from the relationship matrices. In the centrality analysis, we find both commonalities and differences between the different protein 3D structural classes. Results show that all top hierarchical classes of CATH and SCOP present strong non-deterministic interactions for the composition and arrangement features of Cystine (C), Methionine (M), Tryptophan (W), and also for the arrangement features of Histidine (H). The different protein 3D structural classes present different preferences in terms of their centrality distributions and significant features. [ABSTRACT FROM AUTHOR]

In order to understand and represent the importance of nodes within networks better, most of the studies that investigate graphs compute the nodes' centrality within their network(s) of interest. In the literature, the most frequent measures used are degree, closeness and/or betweenness centrality, even if other measures might be valid candidates for representing the importance of nodes within networks. The main contribution of this paper is the development of a methodology that allows one to understand, compare and validate centrality indices when studying a particular network of interest. The proposed methodology integrates the following steps: choosing the centrality measures for the network of interest; developing a theoretical taxonomy of these measures; identifying, by means of Principal Component Analysis (PCA), latent dimensions of centrality within the network of interest; verifying the proposed taxonomy of centrality measures; and identifying the centrality measures that best represent the network of interest. Also, we applied the proposed methodology to an existing graph of interest, in our case a real friendship student network. We chose eighteen centrality measures that were developed in SNA and are available and computed in a specific library (CINNA), defined them thoroughly, and proposed a theoretical taxonomy of these eighteen measures. PCA showed the emergence of six latent dimensions of centrality within the student network and saturation of most of the centrality indices on the same categories as those proposed by the theoretical taxonomy. Additionally, the results suggest that indices other than the ones most frequently applied might be more relevant for research on friendship student networks. Finally, the integrated methodology that we propose can be applied to other centrality indices and/or other network types than student graphs. [ABSTRACT FROM AUTHOR]

The effectiveness of rapid rail transit system is analyzed using tools of complex network for the first time. We evaluated the effectiveness of the system in Beijing quantitatively from different perspectives, including descriptive statistics analysis, bridging property, centrality property, ability of connecting different part of the system and ability of disease spreading. The results showed that the public transport of Beijing does benefit from the rapid rail transit lines, and the benefit of different regions from RRTS is gradually decreased from the north to the south. The paper concluded with some policy suggestions regarding how to promote the system. This study offered significant insight that can help understand the public transportation better. The methodology can be easily applied to analyze other urban public systems, such as electricity grid, water system, to develop more livable cities. [ABSTRACT FROM AUTHOR]

The identification of potential super-spreader nodes within a network is a critical part of the study and analysis of real-world networks. Motivated by a new interpretation of the "shortest path" between two nodes, this paper explores the properties of the heatmap centrality by comparing the farness of a node with the average sum of farness of its adjacent nodes in order to identify influential nodes within the network. As many real-world networks are often claimed to be scale-free, numerical experiments based upon both simulated and real-world undirected and unweighted scale-free networks are used to illustrate the effectiveness of the proposed "shortest path" based measure with regards to its CPU run time and ranking of influential nodes. [ABSTRACT FROM AUTHOR]

The European Emission Trading System (EU ETS) is commonly regarded as the key pillar of the European climate policy and as the main unifying tool to create a unique carbon price all over Europe. The UK has always played a crucial role in the EU ETS, being one of the most active national registry and a crucial hub for the exchange of allowances in the market. Brexit, therefore, could deeply modify the number and directions of such exchanges as well as the centrality of the other countries in this system. To investigate these issues, the present paper exploits network analysis tools to compare the structure of the EU ETS market in its first two phases with and without the UK, investigating a few different scenarios that might emerge from a possible reallocation of the transactions that have involved UK partners. We find that without the UK the EU ETS network would become in general much more homogeneous, though results may change focusing on the type of accounts involved in the transactions. [ABSTRACT FROM AUTHOR]

We investigate the effectiveness of network attack strategies when the attacker has only imperfect information about the network. While most existing network attack strategies assume complete knowledge about the network, in reality it is difficult to obtain the complete structure of a large-scale complex network. This paper considers two scenarios in which the available network information is imperfect. In one scenario, the network contains link errors (i.e., missing and false links) due to measurement errors, and in the other scenario the target network is so large that only part of the network structure is available from network sampling. Through extensive simulations, we show that particularly in a network with highly skewed degree distribution, network attack strategies are robust against link errors. Even if the network contains 30% false links and missing links, the strategies are just as effective as when the complete network is available. We also show that the attack strategies are far less effective when the network is obtained from random sampling, whereas the detrimental effects of network sampling on network attack strategies are small when using biased sampling strategies such as breadth-first search, depth-first search, and sample edge counts. Moreover, the effectiveness of network attack strategies is examined in the context of network immunization, and the implications of the results are discussed. [ABSTRACT FROM AUTHOR]

There are quite a number of different metrics of network robustness. This paper addresses the rationality of four metrics of network robustness (the algebraic connectivity, the effective resistance, the average edge betweenness, and the efficiency) by investigating the robust growth of generalized meshes (GMs). First, a heuristic growth algorithm (the Proximity-Growth algorithm) is proposed. The resulting proximity-optimal GMs are intuitively robust and hence are adopted as the benchmark. Then, a generalized mesh (GM) is grown up by stepwise optimizing a given measure of network robustness. The following findings are presented: (1) The algebraic connectivity-optimal GMs deviate quickly from the proximity-optimal GMs, yielding a number of less robust GMs. This hints that the rationality of the algebraic connectivity as a measure of network robustness is still in doubt. (2) The effective resistace-optimal GMs and the average edge betweenness-optimal GMs are in line with the proximity-optimal GMs. This partly justifies the two quantities as metrics of network robustness. (3) The efficiency-optimal GMs deviate gradually from the proximity-optimal GMs, yielding some less robust GMs. This suggests the limited utility of the efficiency as a measure of network robustness. [ABSTRACT FROM AUTHOR]

Persuasion is at the core of norm creation, emergence of collective action, and solutions to ‘tragedy of the commons’ problems. In this paper, we show that the directionality of friendship ties affect the extent to which individuals can influence the behavior of each other. Moreover, we find that people are typically poor at perceiving the directionality of their friendship ties and that this can significantly limit their ability to engage in cooperative arrangements. This could lead to failures in establishing compatible norms, acting together, finding compromise solutions, and persuading others to act. We then suggest strategies to overcome this limitation by using two topological characteristics of the perceived friendship network. The findings of this paper have significant consequences for designing interventions that seek to harness social influence for collective action. [ABSTRACT FROM AUTHOR]

In complex networks, it is of great theoretical and practical significance to identify a set of critical spreaders which help to control the spreading process. Some classic methods are proposed to identify multiple spreaders. However, they sometimes have limitations for the networks with community structure because many chosen spreaders may be clustered in a community. In this paper, we suggest a novel method to identify multiple spreaders from communities in a balanced way. The network is first divided into a great many super nodes and then k spreaders are selected from these super nodes. Experimental results on real and synthetic networks with community structure show that our method outperforms the classic methods for degree centrality, k-core and ClusterRank in most cases. [ABSTRACT FROM AUTHOR]

In this paper, we explore the problem of establishing a network among the stocks of a market at high frequency level and give an application to program trading. Our work uses high frequency data from the National Stock Exchange, India, for the year 2014. To begin, we analyse the spectrum of the correlation matrix to establish the presence of linear relations amongst the stock returns. A comparison of correlations with pairwise mutual information shows the further existence of non-linear relations which are not captured by correlation. We also see that the non-linear relations are more pronounced at the high frequency level in comparison to the daily returns used in earlier work. We provide two applications of this approach. First, we construct minimal spanning trees for the stock network based on mutual information and study their topology. The year 2014 saw the conduct of general elections in India and the data allows us to explore their impact on aspects of the network, such as the scale-free property and sectorial clusters. Second, having established the presence of non-linear relations, we would like to be able to exploit them. Previous authors have suggested that peripheral stocks in the network would make good proxies for the Markowitz portfolio but with a much smaller number of stocks. We show that peripheral stocks selected using mutual information perform significantly better than ones selected using correlation. [ABSTRACT FROM AUTHOR]

Background: Alcohol use and abuse constitute a major public health problem and identifying their determinants is a priority. Social network analysis can indicate how characteristics of social networks are related to individual health behaviors. A growing number of studies have used social network analysis to examine how social network characteristics influence adult alcohol consumption, but this literature has never been systematically reviewed and summarized. The current paper systematically reviews empirical studies that used social network analysis to assess the influence of social network characteristics on drinking behaviors in adults. Methods: A literature search of PubMed/MEDLINE, EMBASE, PsycINFO and Web of Science databases and a review of the reference lists of retrieved articles was conducted in March 2019. Two reviewers independently screened 5,510 non-duplicate records, and further screened the full text of 150 articles to determine their eligibility for inclusion. Seventeen articles were judged eligible and included. Results: Most studies were conducted among young adults (mean age<30), in university settings or follow up visits with adolescent networks moving into adulthood. The objectives and methods of the included studies were heterogeneous. All included studies reported a statistically significant association between a social network characteristic and an alcohol consumption-related outcome. Social network members drinking behaviors were associated with participants’ drinking behaviors in multiple ways. Discussion: In young adults, among whom the majority of identified studies were conducted, with whom they socialize and how they socialize appears to be associated with alcohol consumption; this was observed across methodologies and settings. We still know very little about the relationship of social networks to drinking in older age groups, and in populations most impacted by alcohol. As social networks appear to play a role in the consumption of alcohol in young adulthood, interventions that utilize social networks to help reduce harmful alcohol consumption should be considered. [ABSTRACT FROM AUTHOR]

Background: Early diagnosis of Alzheimer’s disease (AD) and Mild Cognitive Impairment (MCI) is essential for timely treatment. Machine learning and multivariate pattern analysis (MVPA) for the diagnosis of brain disorders are explicitly attracting attention in the neuroimaging community. In this paper, we propose a voxel-wise discriminative framework applied to multi-measure resting-state fMRI (rs-fMRI) that integrates hybrid MVPA and extreme learning machine (ELM) for the automated discrimination of AD and MCI from the cognitive normal (CN) state. Materials and methods: We used two rs-fMRI cohorts: the public Alzheimer’s disease Neuroimaging Initiative database (ADNI2) and an in-house Alzheimer’s disease cohort from South Korea, both including individuals with AD, MCI, and normal controls. After extracting three-dimensional (3-D) patterns measuring regional coherence and functional connectivity during the resting state, we performed univariate statistical t-tests to generate a 3-D mask that retained only voxels showing significant changes. Given the initial univariate features, to enhance discriminative patterns, we implemented MVPA feature reduction using support vector machine-recursive feature elimination (SVM-RFE), and least absolute shrinkage and selection operator (LASSO), in combination with the univariate t-test. Classifications were performed by an ELM, and its efficiency was compared to linear and nonlinear (radial basis function) SVMs. Results: The maximal accuracies achieved by the method in the ADNI2 cohort were 98.86% (p<0.001) and 98.57% (p<0.001) for AD and MCI vs. CN, respectively. In the in-house cohort, the same accuracies were 98.70% (p<0.001) and 94.16% (p<0.001). Conclusion: From a clinical perspective, combining extreme learning machine and hybrid MVPA applied on concatenations of multiple rs-fMRI biomarkers can potentially assist the clinicians in AD and MCI diagnosis. [ABSTRACT FROM AUTHOR]

This study presents a quantitative analysis of global breast imaging research over the last eight decades. A dedicated Sino-Australian case study via a social network analysis (SNA) is included as China and Australia have a recent rapidly increasing number of research partnerships and strategic education/economic connections. Bibliographic data was extracted via Scopus and analysed for the social network parameters of degree centrality, closeness centrality, betweenness centrality and multiple cohesion measures in order to explore research collaboration networks at the organisational level. Within the last three decades there has been a tremendous increase in the publication rate within the scientific domain of breast imaging research, however, there is a significant lag in the development of this research area in China compared with Australia. Breast imaging research in China is considerably more insular, with less international collaboration and reduced variation between collaborators than Australia. The impact of national breast screening programs and novel cancer technologies upon collaboration networks is discussed alongside the ability of networks paradigm to reveal both frailties in research connections and to highlight networking strategies. [ABSTRACT FROM AUTHOR]

Essential proteins are indispensable for living organisms to maintain life activities and play important roles in the studies of pathology, synthetic biology, and drug design. Therefore, besides experiment methods, many computational methods are proposed to identify essential proteins. Based on the centrality-lethality rule, various centrality methods are employed to predict essential proteins in a Protein-protein Interaction Network (PIN). However, neglecting the temporal and spatial features of protein-protein interactions, the centrality scores calculated by centrality methods are not effective enough for measuring the essentiality of proteins in a PIN. Moreover, many methods, which overfit with the features of essential proteins for one species, may perform poor for other species. In this paper, we demonstrate that the centrality-lethality rule also exists in Protein Subcellular Localization Interaction Networks (PSLINs). To do this, a method based on Localization Specificity for Essential protein Detection (LSED), was proposed, which can be combined with any centrality method for calculating the improved centrality scores by taking into consideration PSLINs in which proteins play their roles. In this study, LSED was combined with eight centrality methods separately to calculate Localization-specific Centrality Scores (LCSs) for proteins based on the PSLINs of four species (Saccharomyces cerevisiae, Homo sapiens, Mus musculus and Drosophila melanogaster). Compared to the proteins with high centrality scores measured from the global PINs, more proteins with high LCSs measured from PSLINs are essential. It indicates that proteins with high LCSs measured from PSLINs are more likely to be essential and the performance of centrality methods can be improved by LSED. Furthermore, LSED provides a wide applicable prediction model to identify essential proteins for different species. [ABSTRACT FROM AUTHOR]

The current marketing landscape, apart from conventional approaches, consists of campaigns designed especially for launching information diffusion processes within online networks. Associated research is focused on information propagation models, campaign initialization strategies and factors affecting campaign dynamics. In terms of algorithms and performance evaluation, the final coverage represented by the fraction of activated nodes within a target network is usually used. It is not necessarily consistent with the real marketing campaigns using various characteristics and parameters related to coverage, costs, behavioral patterns and time factors for overall evaluation. This paper presents assumptions for a decision support system for multi-criteria campaign planning and evaluation with inputs from agent-based simulations. The results, which are delivered from a simulation model based on synthetic networks in a form of decision scenarios, are verified within a real network. Last, but not least, the study proposes a multi-objective campaign evaluation framework with several campaign evaluation metrics integrated. The results showed that the recommendations generated with the use of synthetic networks applied to real networks delivered results according to the decision makers’ expectation in terms of the used evaluation criteria. Apart from practical applications, the proposed multi-objective approach creates new evaluation possibilities for theoretical studies focused on information spreading processes within complex networks. [ABSTRACT FROM AUTHOR]

Influence maximization has attracted a lot of attention due to its numerous applications, including diffusion of social movements, the spread of news, viral marketing and outbreak of diseases. The objective is to discover a group of users that are able to maximize the spread of influence across a network. The greedy algorithm gives a solution to the Influence Maximization problem while having a good approximation ratio. Nevertheless it does not scale well for large scale datasets. In this paper, we propose Matrix Influence, MATI, an efficient algorithm that can be used under both the Linear Threshold and Independent Cascade diffusion models. MATI is based on the precalculation of the influence by taking advantage of the simple paths in the node’s neighborhood. An extensive empirical analysis has been performed on multiple real-world datasets showing that MATI has competitive performance when compared to other well-known algorithms with regards to running time and expected influence spread. [ABSTRACT FROM AUTHOR]

As the basic carrier of air flight operation, air route network (ARN) is of great significance to the smooth operation of flights. However, the waypoint is a core part of the route, so it is an important topic to identify influential waypoints in ARN. In this paper, a method to identify the influence of the node in ARN based on an improved entropy weight (IEW) method is proposed. Then, centrality measures including degree, closeness, betweenness and eigenvector as the multi-attribute of ARN in IEW application. IEW method is used to aggregate the multi-attribute to obtain the evaluation of the influence of each waypoint. To demonstrate the effectiveness of the IEW method, three real ARNs are selected to conduct several experiments with susceptible infected recovered (SIR) model. The results show the efficiency and practicability of the proposed method. [ABSTRACT FROM AUTHOR]

The robustness and resilience of complex networks have been widely studied and discussed in both research and industry because today, the diversity of system components and the complexity of the connection between units are increasingly influencing the reliability of complex systems. Previous studies have focused on node failure in networks, proposing several performance indicators. However, a single performance indicator cannot comprehensively measure all the performance aspects; thus, the selected performance indicators and recovery strategies lack consistency with respect to the targeted complex systems. This paper introduces a novel stress–strength-balanced weighted network model based on two network transmission hypotheses. Then, with respect to different concerns of the complex network, we propose two modified network performance measurement indicators and compare these indicators in terms of their trends in the attack process. In addition, we introduce several network recovery strategies and compare their efficiencies. Our findings are as follows: (1) The evaluation and judgment of the network performance depend on the performance measurement indicators we use. (2) Different recovery strategies exhibit distinct efficiencies in recovering different aspects of network performance, and no strategy exists that can improve all the network performance aspects simultaneously. (3) The timing of the recovery is proved to have a deep influence on the cost and efficiency of network recovery; thus, the optimal recovery strategy for a damaged network varies with the extent of the damage. From the results of the simulation of the attack-recovery process, we conclude that while defining and analyzing complex network models, we should adjust our network topology, weight assignment, and performance indicators in accordance with the focal characteristics of complex systems so that we can use the network model to build robust complex systems and efficient logistics and maintenance strategies. [ABSTRACT FROM AUTHOR]

Identifying influential nodes is an important topic in many diverse applications, such as accelerating information propagation, controlling rumors and diseases. Many methods have been put forward to identify influential nodes in complex networks, ranging from node centrality to diffusion-based processes. However, most of the previous studies do not take into account overlapping communities in networks. In this paper, we propose an effective method based on network representation learning. The method considers not only the overlapping communities in networks, but also the network structure. Experiments on real-world networks show that the proposed method outperforms many benchmark algorithms and can be used in large-scale networks. [ABSTRACT FROM AUTHOR]

Essential proteins are crucial to living cells. Identification of essential proteins from protein-protein interaction (PPI) networks can be applied to pathway analysis and function prediction, furthermore, it can contribute to disease diagnosis and drug design. There have been some experimental and computational methods designed to identify essential proteins, however, the prediction precision remains to be improved. In this paper, we propose a new method for identifying essential proteins based on Participation degree of a protein in protein Complexes and Subgraph Density, named as PCSD. In order to test the performance of PCSD, four PPI datasets (DIP, Krogan, MIPS and Gavin) are used to conduct experiments. The experiment results have demonstrated that PCSD achieves a better performance for predicting essential proteins compared with some competing methods including DC, SC, EC, IC, LAC, NC, WDC, PeC, UDoNC, and compared with the most recent method LBCC, PCSD can correctly predict more essential proteins from certain numbers of top ranked proteins on the DIP dataset, which indicates that PCSD is very effective in discovering essential proteins in most case. [ABSTRACT FROM AUTHOR]

Drawing on recent contributions inferring financial interconnectedness from market data, our paper provides new insights on the evolution of the US financial industry over a long period of time by using several tools coming from network science. Relying on a Time-Varying Parameter Vector AutoRegressive (TVP-VAR) approach on stock market returns to retrieve unobserved directed links among financial institutions, we reconstruct a fully dynamic network in the sense that connections are let to evolve through time. The financial system analysed consists of a large set of 155 financial institutions that are all the banks, broker-dealers, insurance and real estate companies listed in the Standard & Poors’ 500 index over the 1993–2014 period. Looking alternatively at the individual, then sector-, community- and system-wide levels, we show that network sciences’ tools are able to support well-known features of the financial markets such as the dramatic fall of connectivity following Lehman Brothers’ collapse. More importantly, by means of less traditional metrics, such as sectoral interface or measurements based on contagion processes, our results document the co-existence of both fragmentation and integration phases between firms independently from the sectors they belong to, and doing so, question the relevance of existing macroprudential surveillance frameworks which have been mostly developed on a sectoral basis. Overall, our results improve our understanding of the US financial landscape and may have important implications for risk monitoring as well as macroprudential policy design. [ABSTRACT FROM AUTHOR]

Due to the ubiquitous nature of disruptive extreme events, functionality of the critical infrastructure systems (CIS) is constantly at risk. In case of a disruption, in order to minimize the negative impact to the society, service networks operating on the CIS should be restored as quickly as possible. In this paper, we introduce a novel network science inspired measure to quantify the criticality of components within a disrupted service network and develop a restoration heuristic (Cent-Restore) that prioritizes restoration efforts based on this measure. As an illustrative case study, we consider a road network blocked by debris in the aftermath of a natural disaster. The debris obstructs the flow of relief aid and search-and-rescue teams between critical facilities and disaster sites, debilitating the emergency service network. In this context, the problem is defined as finding a schedule to clear the roads with the limited resources. First, we develop a mixed-integer programming model for the problem. Then we validate the efficiency and accuracy of the Cent-Restore heuristic on randomly generated instances by comparing it to the model. Furthermore, we use Cent-Restore to recommend real-time restoration plans for disrupted road networks of Boston and Manhattan and analyze the performance of the plans over time through resilience curves. We compare Cent-Restore to the current restoration guidelines proposed by FEMA and other strategies that prioritize the restoration efforts based on different measures. As a result we confirm the importance of including specific post-disruption attributes of the networks to create effective restoration strategies. Moreover, we explore the relationship between a service network’s resilience and its topological and operational characteristics under different disruption scenarios. The methods and insights provided in this work can be extended to other disrupted large-scale critical infrastructure systems in which the ultimate goal is to enable the functions of the overlaying service networks. [ABSTRACT FROM AUTHOR]

In a typical questionnaire testing situation, examinees are not allowed to choose which items they answer because of a technical issue in obtaining satisfactory statistical estimates of examinee ability and item difficulty. This paper introduces a new item response theory (IRT) model that incorporates information from a novel representation of questionnaire data using network analysis. Three scenarios in which examinees select a subset of items were simulated. In the first scenario, the assumptions required to apply the standard Rasch model are met, thus establishing a reference for parameter accuracy. The second and third scenarios include five increasing levels of violating those assumptions. The results show substantial improvements over the standard model in item parameter recovery. Furthermore, the accuracy was closer to the reference in almost every evaluated scenario. To the best of our knowledge, this is the first proposal to obtain satisfactory IRT statistical estimates in the last two scenarios. [ABSTRACT FROM AUTHOR]