Edge Betweenness Research Articles

Large-scale prediction of key dynamic interacting proteins in multiple cancers

Tracking cancer dynamic protein-protein interactions (PPIs) and deciphering their pathogenesis remain a challenge. We presented a dynamic PPIs' hypothesis: permanent and transient interactions might achieve dynamic switchings from normal cells to malignancy, which could cause maintenance functions to be interrupted and transient functions to be sustained. Based on the hypothesis, we first predicted >1400 key cancer genes (KCG) by applying PPI-express we proposed to 18 cancer gene expression datasets. We then further screened out key dynamic interactions (KDI) of cancer based on KCG and transient and permanent interactions under both conditions. Two prominent functional characteristics, “Cell cycle-related” and “Immune-related”, were presented for KCG, suggesting that these might be their general characteristics. We found that, compared to permanent to transient KDI pairs (P2T) in the network, transient to permanent (T2P) have significantly higher edge betweenness (EB), and P2T pairs tending to locate intra-functional modules may play roles in maintaining normal biological functions, while T2P KDI pairs tending to locate inter-modules may play roles in biological signal transduction. It was consistent with our hypothesis. Also, we analyzed network characteristics of KDI pairs and their functions. Our findings of KDI may serve to understand and explain a few hallmarks of cancer.

Community structure concept for catchment classification: A modularity density-based edge betweenness (MDEB) method

Catchment classification is useful for a variety of purposes in hydrologic, environmental, and ecosystem studies. In the context of classification, the concept of community structure, within the realm of complex networks, is particularly attractive and gaining attention in catchment classification studies. Among the many community structure methods, the edge betweenness (EB) method, which applies a hierarchical clustering concept, is one of the most widely used. The EB method, however, is susceptible to the issue of scale (or size) of the network, essentially due to the modularity function that is used to measure the strength of the community structure. To overcome this limitation, the present study proposes an improvement to the EB method. The proposed method, termed as the Modularity Density-based Edge Betweenness (MDEB) method, uses a modularity density function (or D value) by maximization, to obtain the best split of the network. The effectiveness of the MDEB method is evaluated through its application for catchment classification using streamflow data from two large networks: 218 stations from Australia and 639 stations from the United States (US). For each network, three different scenarios in network sizes are studied: (1) the entire network; (2) smaller network sizes based on 100 random realizations, with each realization having 100 and 300 stations for Australia and the US, respectively; and (3) smaller network sizes based on nine different drainage division regions in Australia and 18 different hydrologic units in the US. The classification outcomes from the MDEB method for these three scenarios are compared with those from the EB method. The results indicate that the MDEB method generally performs better than the EB method, for both Australia and the US. The superiority of the MDEB method is evaluated in terms of the number of communities identified and the number of stations that change communities when different network sizes are considered. The catchment communities are also interpreted in terms of the distance-correlation relationship. The results from the present study offer further evidence as to the usefulness and effectiveness of the community structure concept for catchment classification, especially the proposed MDEB method.

Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness

Multicast routing consists of concurrently sending the same information from a source to a subset of all possible destinations in a computer network thus becomes an important technology communication. To solve the problem, a current approach for efficiently supporting a multicast session in a network consists of establishing a multicast tree that covers the source and all terminal nodes. This problem can be reduced to a minimal Steiner tree problem (MST) which aims to look for a tree that covers a set of nodes with a minimum total cost, the problem is NP-hard. In this paper, we investigate metaheuristics approaches for the Delay-Constrained Least-Cost (DCLC) problem, we propose a novel algorithm based on Tabu Search procedure with the Edge Betweenness (EB). The EB heuristic used first to improve KMB heuristic, able to measure the edge value to being included in a given path. The obtained solution improved using the tabu search method. The performance of the proposed algorithm is evaluated by experiments on a number of benchmark instances from the Steiner library. Experimental results show that the proposed metaheuristic gives competitive results in terms of cost and delay compared to the optimal results in Steiner library and other existing algorithms in the literature.

Exploring significant edges of public transport network under targeted attacks

Edges of public transport network (PTN) play important roles in transporting passengers of cities, especially in metropolises. Understanding the significant edges of PTN can provide insights for managers to increase the efficiency of networks. In this work, we construct a new measure called community bridge (CB), which is based on the number of nodes in communities. We propose an edge removal process to test network efficiency (NE), average transfer times (ATT) and correlation coefficient (CC). For comparison, edge measures of degree product (DP), edge betweenness (EB), edge overlap (EO), closeness centrality index (CCI) are introduced for the process. The results show that there are only 12.6% edges are CBs in the network. Removing edges according to CBs can decrease NE more effectively compared with other indicators. However, it cannot increase the ATTs effectively. It is found that removing edges according to CCI is the most effective way to increase ATT under the outranked 15% edges removed. In addition, the results indicate the CC has very different changes according to the introduced removal strategies.