Browse
Submit Data
Databases
API
Help

Dataset Information

19 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Betweenness centrality for temporal multiplexes.

ABSTRACT: Betweenness centrality quantifies the importance of a vertex for the information flow in a network. The standard betweenness centrality applies to static single-layer networks, but many real world networks are both dynamic and made of several layers. We propose a definition of betweenness centrality for temporal multiplexes. This definition accounts for the topological and temporal structure and for the duration of paths in the determination of the shortest paths. We propose an algorithm to compute the new metric using a mapping to a static graph. We apply the metric to a dataset of [Formula: see text]k European flights and compare the results with those obtained with static or single-layer metrics. The differences in the airports rankings highlight the importance of considering the temporal multiplex structure and an appropriate distance metric.

SUBMITTER: Zaoli S

PROVIDER: S-EPMC7921680 | biostudies-literature | 2021 Mar

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Betweenness centrality for temporal multiplexes.

Zaoli Silvia S Mazzarisi Piero P Lillo Fabrizio F

Scientific reports 20210301 1

Betweenness centrality quantifies the importance of a vertex for the information flow in a network. The standard betweenness centrality applies to static single-layer networks, but many real world networks are both dynamic and made of several layers. We propose a definition of betweenness centrality for temporal multiplexes. This definition accounts for the topological and temporal structure and for the duration of paths in the determination of the shortest paths. We propose an algorithm to comp ...[more]

PMID: 33649386

Similar Datasets

A spatial interaction incorporated betweenness centrality measure.

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

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

Variability of Betweenness Centrality and Its Effect on Identifying Essential Genes.

Project description:This paper begins to build a theoretical framework that would enable the pharmaceutical industry to use network complexity measures as a way to identify drug targets. The variability of a betweenness measure for a network node is examined through different methods of network perturbation. Our results indicate a robustness of betweenness centrality in the identification of target genes.

| S-EPMC6476710 | 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

Two betweenness centrality measures based on Randomized Shortest Paths.

Project description:This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP's have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice.

| S-EPMC4738330 | biostudies-other

Beyond degree and betweenness centrality: Alternative topological measures to predict viral targets.

Project description:The availability of large-scale screens of host-virus interaction interfaces enabled the topological analysis of viral protein targets of the host. In particular, host proteins that bind viral proteins are generally hubs and proteins with high betweenness centrality. Recently, other topological measures were introduced that a virus may tap to infect a host cell. Utilizing experimentally determined sets of human protein targets from Herpes, Hepatitis, HIV and Influenza, we pooled molecular interactions between proteins from different pathway databases. Apart from a protein's degree and betweenness centrality, we considered a protein's pathway participation, ability to topologically control a network and protein PageRank index. In particular, we found that proteins with increasing values of such measures tend to accumulate viral targets and distinguish viral targets from non-targets. Furthermore, all such topological measures strongly correlate with the occurrence of a given protein in different pathways. Building a random forest classifier that is based on such topological measures, we found that protein PageRank index had the highest impact on the classification of viral (non-)targets while proteins' ability to topologically control an interaction network played the least important role.

| S-EPMC5967884 | biostudies-literature

Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation.

Project description:Betweenness centrality is one of the key measures of the node importance in a network. However, it is computationally intractable to calculate the exact betweenness centrality of nodes in large-scale networks. To solve this problem, we present an efficient CBCA (Centroids based Betweenness Centrality Approximation) algorithm based on progressive sampling and shortest paths approximation. Our algorithm firstly approximates the shortest paths by generating the network centroids according to the adjacency information entropy of the nodes; then constructs an efficient error estimator using the Monte Carlo Empirical Rademacher averages to determine the sample size which can achieve a balance with accuracy; finally, we present a novel centroid updating strategy based on network density and clustering coefficient, which can effectively reduce the computation burden of updating shortest paths in dynamic networks. The experimental results show that our CBCA algorithm can efficiently output high-quality approximations of the betweenness centrality of a node in large-scale complex networks.

| S-EPMC10564764 | biostudies-literature

From the betweenness centrality in street networks to structural invariants in random planar graphs.

Project description:The betweenness centrality, a path-based global measure of flow, is a static predictor of congestion and load on networks. Here we demonstrate that its statistical distribution is invariant for planar networks, that are used to model many infrastructural and biological systems. Empirical analysis of street networks from 97 cities worldwide, along with simulations of random planar graph models, indicates the observed invariance to be a consequence of a bimodal regime consisting of an underlying tree structure for high betweenness nodes, and a low betweenness regime corresponding to loops providing local path alternatives. Furthermore, the high betweenness nodes display a non-trivial spatial clustering with increasing spatial correlation as a function of the edge-density. Our results suggest that the spatial distribution of betweenness is a more accurate discriminator than its statistics for comparing static congestion patterns and its evolution across cities as demonstrated by analyzing 200 years of street data for Paris.

| S-EPMC6021391 | biostudies-literature

Respiratory Disease Risk of Zoo-Housed Bonobos Is Associated with Sex and Betweenness Centrality in the Proximity Network.

Project description:Infectious diseases can be considered a threat to animal welfare and are commonly spread through both direct and indirect social interactions with conspecifics. This is especially true for species with complex social lives, like primates. While several studies have investigated the impact of sociality on disease risk in primates, only a handful have focused on respiratory disease, despite it being a major cause of morbidity and mortality in both wild and captive populations and thus an important threat to primate welfare. Therefore, we examined the role of social-network position on the occurrence of respiratory disease symptoms during one winter season in a relatively large group of 20 zoo-housed bonobos with managed fission-fusion dynamics. We found that within the proximity network, symptoms were more likely to occur in individuals with higher betweenness centrality, which are individuals that form bridges between different parts of the network. Symptoms were also more likely to occur in males than in females, independent of their social-network position. Taken together, these results highlight a combined role of close proximity and sex in increased risk of attracting respiratory disease, two factors that can be taken into account for further welfare management of the species.

| S-EPMC8698162 | biostudies-literature

EIGENVECTOR-BASED CENTRALITY MEASURES FOR TEMPORAL NETWORKS.

Project description:Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a principled generalization of network centrality measures that is valid for any eigenvector-based centrality. We consider a temporal network with N nodes as a sequence of T layers that describe the network during different time windows, and we couple centrality matrices for the layers into a supra-centrality matrix of size NT × NT whose dominant eigenvector gives the centrality of each node i at each time t. We refer to this eigenvector and its components as a joint centrality, as it reflects the importances of both the node i and the time layer t. We also introduce the concepts of marginal and conditional centralities, which facilitate the study of centrality trajectories over time. We find that the strength of coupling between layers is important for determining multiscale properties of centrality, such as localization phenomena and the time scale of centrality changes. In the strong-coupling regime, we derive expressions for time-averaged centralities, which are given by the zeroth-order terms of a singular perturbation expansion. We also study first-order terms to obtain first-order-mover scores, which concisely describe the magnitude of nodes' centrality changes over time. As examples, we apply our method to three empirical temporal networks: the United States Ph.D. exchange in mathematics, costarring relationships among top-billed actors during the Golden Age of Hollywood, and citations of decisions from the United States Supreme Court.

| S-EPMC5643020 | 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