scholarly journals Betweenness centrality in large complex networks

2004 ◽  
Vol 38 (2) ◽  
pp. 163-168 ◽  
Author(s):  
M. Barth�lemy
2018 ◽  
Vol 83 ◽  
pp. 413-424 ◽  
Author(s):  
Sebastian Wandelt ◽  
Xiaoqian Sun ◽  
Massimiliano Zanin ◽  
Shlomo Havlin

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Lifu Wang ◽  
Guotao Zhao ◽  
Zhi Kong ◽  
Yunkang Zhao

In a complex network, each edge has different functions on controllability of the whole network. A network may be out of control due to failure or attack of some specific edges. Bridges are a kind of key edges whose removal will disconnect a network and increase connected components. Here, we investigate the effects of removing bridges on controllability of network. Various strategies, including random deletion of edges, deletion based on betweenness centrality, and deletion based on degree of source or target nodes, are used to compare with the effect of removing bridges. It is found that the removing bridges strategy is more efficient on reducing controllability than the other strategies of removing edges for ER networks and scale-free networks. In addition, we also found the controllability robustness under edge attack is related to the average degree of complex networks. Therefore, we propose two optimization strategies based on bridges to improve the controllability robustness of complex networks against attacks. The effectiveness of the proposed strategies is demonstrated by simulation results of some model networks. These results are helpful for people to understand and control spreading processes of epidemic across different paths.


2021 ◽  
pp. 117-127
Author(s):  
W. M. Abdullah ◽  
S. Hossain ◽  
M. A. Khan

Automatica ◽  
2018 ◽  
Vol 89 ◽  
pp. 111-116 ◽  
Author(s):  
Pietro DeLellis ◽  
Franco Garofalo ◽  
Francesco Lo Iudice

PLoS ONE ◽  
2008 ◽  
Vol 3 (7) ◽  
pp. e2541 ◽  
Author(s):  
Weijiang Li ◽  
Hiroyuki Kurata

2017 ◽  
Vol 16 (05) ◽  
pp. 1359-1385 ◽  
Author(s):  
Weihua Zhan ◽  
Jihong Guan ◽  
Zhongzhi Zhang

Extracting the hierarchical organization of networks is currently a pressing task for understanding complex networked systems. The hierarchy of a network is essentially defined by the heterogeneity of link densities of communities at different scales. Here, we define a top-level partition (TLP) as a bipartition of the network (or a sub-network) such that no top-level community (TLC) runs across the two parts. It has been found that a TLP generally has a higher modularity than a non-top-level (TLP) partition when their TLCs have similar sizes and when the link densities of neighboring levels are well separated from each other. A spectral TLP procedure is proposed here to search for TLPs of a network (or sub-network). To extract the hierarchical organization of large complex networks, an algorithm called TLPA has been developed based on the TLP. Experiments have shown that the method developed in this research extract hierarchy accurately from network data.


Sign in / Sign up

Export Citation Format

Share Document