Node Conductance: A Scalable Node Centrality Measure on Big Networks
Ontology highlight
ABSTRACT:
SUBMITTER: Lauw H
PROVIDER: S-EPMC7206264 | biostudies-literature | 2020 Apr
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Recent developments in network theory have allowed for the study of the structure and function of the human brain in terms of a network of interconnected components. Among the many nodes that form a network, some play a crucial role and are said to be central within the network structure. Central nodes may be identified via centrality metrics, with degree, betweenness, and eigenvector centrality being three of the most popular measures. Degree identifies the most connected nodes, whereas betweenness centrality identifies those located on the most traveled paths. Eigenvector centrality considers nodes connected to other high degree nodes as highly central. In the work presented here, we propose a new centrality metric called leverage centrality that considers the extent of connectivity of a node relative to the connectivity of its neighbors. The leverage centrality of a node in a network is determined by the extent to which its immediate neighbors rely on that node for information. Although similar in concept, there are essential differences between eigenvector and leverage centrality that are discussed in this manuscript. Degree, betweenness, eigenvector, and leverage centrality were compared using functional brain networks generated from healthy volunteers. Functional cartography was also used to identify neighborhood hubs (nodes with high degree within a network neighborhood). Provincial hubs provide structure within the local community, and connector hubs mediate connections between multiple communities. Leverage proved to yield information that was not captured by degree, betweenness, or eigenvector centrality and was more accurate at identifying neighborhood hubs. We propose that this metric may be able to identify critical nodes that are highly influential within the network.
| S-EPMC2922375 | biostudies-literature
Project description:Node centrality is one of the most frequently revisited network theoretical concepts, which got many calculation method alternatives, each of them being conceived on different empirical or theoretical network abstractions. The vast majority of centrality measures produced up to date were conceived on static network abstractions (the so-called "snapshot" networks), which arguably are less realistic than dynamic (temporal) network abstractions. The new, temporal node centrality measure that we offer with this article, is based on an uncommon abstraction, of a space-time network derived from service schedules (timetables). The proposed measure was designed to rank nodes of a space-time network based on their spread or transmission potential, and was subsequently implemented on the network of sea ferry transportation derived from the aggregated schedules for sea ferry liner shipping services in Europe, as they occurred in the month of August, 2015. The main feature of our measure, named "the Spread Potential", is the evaluation of the potential of a node in the network for transmitting disease, information (e.g. rumours or false news), as well as other phenomena, whichever support a space-time network abstraction from regular and scheduled services with some known carrying capacities. Such abstractions are, for instance, of the transportation networks (e.g. of airline or maritime shipping or the wider logistics (delivery) networks), networks of medical (hospital) services, educational (teaching) services, and virtually, of any other scheduled networked phenomenon. The article also offers the perspectives of the measure's applicability on the non-scheduled space-time network abstractions.
| S-EPMC10728106 | biostudies-literature
Project description:Betweenness centrality is an indicator of a node's centrality in a network. It is equal to the number of shortest paths from all vertices to all others that pass through that node. Most of real-world large networks display a hierarchical community structure, and their betweenness computation possesses rather high complexity. Here we propose a new hierarchical decomposition approach to speed up the betweenness computation of complex networks. The advantage of this new method is its effective utilization of the local structural information from the hierarchical community. The presented method can significantly speed up the betweenness calculation. This improvement is much more evident in those networks with numerous homogeneous communities. Furthermore, the proposed method features a parallel structure, which is very suitable for parallel computation. Moreover, only a small amount of additional computation is required by our method, when small changes in the network structure are restricted to some local communities. The effectiveness of the proposed method is validated via the examples of two real-world power grids and one artificial network, which demonstrates that the performance of the proposed method is superior to that of the traditional method.
| S-EPMC5397849 | biostudies-other
Project description:Gene set enrichment analysis (GSEA) is a powerful tool to associate a disease phenotype to a group of genes/proteins. GSEA attributes a specific weight to each gene/protein in the input list that depends on a metric of choice, which is usually represented by quantitative expression data. However, expression data are not always available. Here, GSEA based on betweenness centrality of a protein-protein interaction (PPI) network is described and applied to two cases, where an expression metric is missing. First, personalized PPI networks were generated from genes displaying alterations (assessed by array comparative genomic hybridization and whole exome sequencing) in four probands bearing a 16p13.11 microdeletion in common and several other point variants. Patients showed disease phenotypes linked to neurodevelopment. All networks were assembled around a cluster of first interactors of altered genes with high betweenness centrality. All four clusters included genes known to be involved in neurodevelopmental disorders with different centrality. Moreover, the GSEA results pointed out to the evidence of "cell cycle" among enriched pathways. Second, a large interaction network obtained by merging proteomics studies on three neurodegenerative disorders was analyzed from the topological point of view. We observed that most central proteins are often linked to Parkinson's disease. The selection of these proteins improved the specificity of GSEA, with "Metabolism of amino acids and derivatives" and "Cellular response to stress or external stimuli" as top-ranked enriched pathways. In conclusion, betweenness centrality revealed to be a suitable metric for GSEA. Thus, centrality-based GSEA represents an opportunity for precision medicine and network medicine.
| S-EPMC7943873 | biostudies-literature
Project description:The weight of links in a network is often related to the similarity of the nodes. Here, we introduce a simple tunable measure for analysing the similarity of nodes across different link weights. In particular, we use the measure to analyze homophily in a group of 659 freshman students at a large university. Our analysis is based on data obtained using smartphones equipped with custom data collection software, complemented by questionnaire-based data. The network of social contacts is represented as a weighted multilayer network constructed from different channels of telecommunication as well as data on face-to-face contacts. We find that even strongly connected individuals are not more similar with respect to basic personality traits than randomly chosen pairs of individuals. In contrast, several socio-demographics variables have a significant degree of similarity. We further observe that similarity might be present in one layer of the multilayer network and simultaneously be absent in the other layers. For a variable such as gender, our measure reveals a transition from similarity between nodes connected with links of relatively low weight to dis-similarity for the nodes connected by the strongest links. We finally analyze the overlap between layers in the network for different levels of acquaintanceships.
| S-EPMC4907436 | biostudies-literature
Project description:Centrality of a node measures its relative importance within a network. There are a number of applications of centrality, including inferring the influence or success of an individual in a social network, and the resulting social network dynamics. While we can compute the centrality of any node in a given network snapshot, a number of applications are also interested in knowing the potential importance of an individual in the future. However, current centrality is not necessarily an effective predictor of future centrality. While there are different measures of centrality, we focus on degree centrality in this paper. We develop a method that reconciles preferential attachment and triadic closure to capture a node's prominence profile. We show that the proposed node prominence profile method is an effective predictor of degree centrality. Notably, our analysis reveals that individuals in the early stage of evolution display a distinctive and robust signature in degree centrality trend, adequately predicted by their prominence profile. We evaluate our work across four real-world social networks. Our findings have important implications for the applications that require prediction of a node's future degree centrality, as well as the study of social network dynamics.
| S-EPMC4246206 | biostudies-literature
Project description:Betweenness centrality (BC) is widely used to identify critical nodes in a network by exploring the ability of all nodes to act as intermediaries for information exchange. However, one of its assumptions, i.e., the contributions of all shortest paths are equal, is inconsistent with variations in spatial interactions along these paths and has been questioned when applied to spatial networks. Hence, this paper proposes a spatial interaction incorporated betweenness centrality (SIBC) for spatial networks. SIBC weights the shortest path between each node pair according to the intensity of spatial interaction between them, emphasizing the combination of a network structure and spatial interactions. To test the rationality and validity of SIBC in identifying critical nodes and edges, two specific forms of SIBC are applied to the Shenzhen street network and China's intercity network. The results demonstrate that SIBC is more significant than BC when we also focus on the network functionality rather than only on the network structure. Moreover, the good performance of SIBC in robustness analysis illustrates its application value in improving network efficiency. This study highlights the meaning of introducing spatial configuration into empirical models of complex networks.
| S-EPMC9122268 | biostudies-literature
Project description:In a recent work we introduced a measure of importance for groups of vertices in a complex network. This centrality for groups is always between 0 and 1 and induces the eigenvector centrality over vertices. Furthermore, its value over any group is the fraction of all network flows intercepted by this group. Here we provide the rigorous mathematical constructions underpinning these results via a semi-commutative extension of a number theoretic sieve. We then established further relations between the eigenvector centrality and the centrality proposed here, showing that the latter is a proper extension of the former to groups of nodes. We finish by comparing the centrality proposed here with the notion of group-centrality introduced by Everett and Borgatti on two real-world networks: the Wolfe’s dataset and the protein-protein interaction network of the yeast Saccharomyces cerevisiae. In this latter case, we demonstrate that the centrality is able to distinguish protein complexes
| S-EPMC6214294 | biostudies-other
Project description:The determination of node centrality is a fundamental topic in social network studies. As an addition to established metrics, which identify central nodes based on their brokerage power, the number and weight of their connections, and the ability to quickly reach all other nodes, we introduce five new measures of Distinctiveness Centrality. These new metrics attribute a higher score to nodes keeping a connection with the network periphery. They penalize links to highly-connected nodes and serve the identification of social actors with more distinctive network ties. We discuss some possible applications and properties of these newly introduced metrics, such as their upper and lower bounds. Distinctiveness centrality provides a viewpoint of centrality alternative to that of established metrics.
| S-EPMC7244137 | biostudies-literature
Project description:Cooperation played a significant role in the self-organization and evolution of living organisms. Both network topology and the initial position of cooperators heavily affect the cooperation of social dilemma games. We developed a novel simulation program package, called 'NetworGame', which is able to simulate any type of social dilemma games on any model, or real world networks with any assignment of initial cooperation or defection strategies to network nodes. The ability of initially defecting single nodes to break overall cooperation was called as 'game centrality'. The efficiency of this measure was verified on well-known social networks, and was extended to 'protein games', i.e. the simulation of cooperation between proteins, or their amino acids. Hubs and in particular, party hubs of yeast protein-protein interaction networks had a large influence to convert the cooperation of other nodes to defection. Simulations on methionyl-tRNA synthetase protein structure network indicated an increased influence of nodes belonging to intra-protein signaling pathways on breaking cooperation. The efficiency of single, initially defecting nodes to convert the cooperation of other nodes to defection in social dilemma games may be an important measure to predict the importance of nodes in the integration and regulation of complex systems. Game centrality may help to design more efficient interventions to cellular networks (in forms of drugs), to ecosystems and social networks.
| S-EPMC3696096 | biostudies-literature