Browse
Submit Data
Databases
API
Help

Dataset Information

22 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A centrality measure for cycles and subgraphs II.

ABSTRACT: 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

SUBMITTER: Giscard P

PROVIDER: S-EPMC6214294 | biostudies-other | 2018

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

A new measure of centrality for brain networks.

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

Perturbation centrality and turbine: a novel centrality measure obtained using a versatile network dynamics tool.

Project description:Analysis of network dynamics became a focal point to understand and predict changes of complex systems. Here we introduce Turbine, a generic framework enabling fast simulation of any algorithmically definable dynamics on very large networks. Using a perturbation transmission model inspired by communicating vessels, we define a novel centrality measure: perturbation centrality. Hubs and inter-modular nodes proved to be highly efficient in perturbation propagation. High perturbation centrality nodes of the Met-tRNA synthetase protein structure network were identified as amino acids involved in intra-protein communication by earlier studies. Changes in perturbation centralities of yeast interactome nodes upon various stresses well recapitulated the functional changes of stressed yeast cells. The novelty and usefulness of perturbation centrality was validated in several other model, biological and social networks. The Turbine software and the perturbation centrality measure may provide a large variety of novel options to assess signaling, drug action, environmental and social interventions.

| S-EPMC3804472 | biostudies-literature

Nodes having a major influence to break cooperation define a novel centrality measure: game centrality.

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

Hierarchical Decomposition for Betweenness Centrality Measure of Complex Networks.

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

A Physarum Centrality Measure of the Human Brain Network.

Project description:The most important goals of brain network analyses are to (a) detect pivotal regions and connections that contribute to disproportionate communication flow, (b) integrate global information, and (c) increase the brain network efficiency. Most centrality measures assume that information propagates in networks with the shortest connection paths, but this assumption is not true for most real networks given that information in the brain propagates through all possible paths. This study presents a methodological pipeline for identifying influential nodes and edges in human brain networks based on the self-regulating biological concept adopted from the Physarum model, thereby allowing the identification of optimal paths that are independent of the stated assumption. Network hubs and bridges were investigated in structural brain networks using the Physarum model. The optimal paths and fluid flow were used to formulate the Physarum centrality measure. Most network hubs and bridges are overlapped to some extent, but those based on Physarum centrality contain local and global information in the superior frontal, anterior cingulate, middle temporal gyrus, and precuneus regions. This approach also reduced individual variation. Our results suggest that the Physarum centrality presents a trade-off between the degree and betweenness centrality measures.

| S-EPMC6459855 | biostudies-literature

Node Conductance: A Scalable Node Centrality Measure on Big Networks

Project description:Node centralities such as Degree and Betweenness help detecting influential nodes from local or global view. Existing global centrality measures suffer from the high computational complexity and unrealistic assumptions, limiting their applications on real-world applications. In this paper, we propose a new centrality measure, Node Conductance, to effectively detect spanning structural hole nodes and predict the formation of new edges. Node Conductance is the sum of the probability that node i is revisited at r-th step, where r is an integer between 1 and infinity. Moreover, with the help of node embedding techniques, Node Conductance is able to be approximately calculated on big networks effectively and efficiently. Thorough experiments present the differences between existing centralities and Node Conductance, its outstanding ability of detecting influential nodes on both static and dynamic network, and its superior efficiency compared with other global centralities. Electronic supplementary material The online version of this chapter (10.1007/978-3-030-47436-2_40) contains supplementary material, which is available to authorized users.

| S-EPMC7206264 | biostudies-literature

A measure of centrality in cyclic diffusion processes: Walk-betweenness.

Project description:Unlike many traditional measures of centrality based on paths that do not allow any repeated nodes or lines, we propose a new measure of centrality based on walks, walk-betweenness, that allows any number of repeated nodes or lines. To illustrate the value of walk-betweenness, we examine the transmission of syphilis in Chicago area and the diffusion of microfinance in 43 rural Indian villages. Walk-betweenness allows us to identify hidden bridging communities in Chicago that were essential in the transmission dynamics. We also find that village leaders with high walk-betweenness are more likely to accelerate the rate of microfinance take-up among their followers, outperforming other traditional centrality measures in regression analyses.

| S-EPMC7842912 | biostudies-literature

Combining multi-mutant and modular thermodynamic cycles to measure energetic coupling networks in enzyme catalysis.

Project description:We measured and cross-validated the energetics of networks in Bacillus stearothermophilus Tryptophanyl-tRNA synthetase (TrpRS) using both multi-mutant and modular thermodynamic cycles. Multi-dimensional combinatorial mutagenesis showed that four side chains from this "molecular switch" move coordinately with the active-site Mg2+ ion as the active site preorganizes to stabilize the transition state for amino acid activation. A modular thermodynamic cycle consisting of full-length TrpRS, its Urzyme, and the Urzyme plus each of the two domains deleted in the Urzyme gives similar energetics. These dynamic linkages, although unlikely to stabilize the transition-state directly, consign the active-site preorganization to domain motion, assuring coupled vectorial behavior.

| S-EPMC5272822 | biostudies-literature

Chromatin immunoprecipitation to measure RNA polymerase II occupancy in fission yeast

Project description:The relative amount of RNA polymerase II (Pol II) associated with a given ORF provides an estimate for transcriptional efficiency. We therefore established a systematic approach to measure Pol II occupancy using chromatin immunoprecipitation followed by analysis on microarrays

2007-03-22 | E-TABM-219 | biostudies-arrayexpress

Cycle Based Network Centrality.

Project description:Paths and cycles are the two pivotal elements in a network. Here, we demonstrate that paths, particularly the shortest ones, are incomplete in information network. However, based on such paths, many network centrality measures are designed. While extensive explorations on paths have been made, modest studies focus on the cycles on measuring network centrality. We study the relationship between the shortest cycle and the shortest path from extensive real-world networks. The results illustrate the incompleteness of the shortest paths on measuring network centrality. Noticing that the shortest cycle is much more robust than the shortest path, we propose two novel cycle-based network centrality measures to address the incompleteness of paths: the shortest cycle closeness centrality (SCC) and the all cycle betweenness centrality (ACC). Notwithstanding we focus on the network centrality problem, our findings on cycles can be applied to explain the incompleteness of paths in applications and could improve the applicability into more scenarios where the paths are employed in network science.

| S-EPMC6079107 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data