An Adaptive Semi-local Algorithm for Node Ranking in Large Complex Networks

2018 ◽  
pp. 505-514 ◽  
Author(s):  
Fanghua Ye ◽  
Chuan Chen ◽  
Jie Zhang ◽  
Jiajing Wu ◽  
Zibin Zheng
Keyword(s):  
Complex Networks ◽  
Local Algorithm ◽  
Node Ranking ◽  
Large Complex

QRE: Quick Robustness Estimation for large complex networks

2018 ◽  
Vol 83 ◽  
pp. 413-424 ◽  
Author(s):  
Sebastian Wandelt ◽  
Xiaoqian Sun ◽  
Massimiliano Zanin ◽  
Shlomo Havlin
Keyword(s):  
Complex Networks ◽  
Large Complex

Covering Large Complex Networks by Cliques—A Sparse Matrix Approach

2021 ◽  
pp. 117-127
Author(s):  
W. M. Abdullah ◽  
S. Hossain ◽  
M. A. Khan
Keyword(s):  
Complex Networks ◽  
Sparse Matrix ◽  
Matrix Approach ◽  
Large Complex

The partial pinning control strategy for large complex networks

Automatica ◽  
2018 ◽  
Vol 89 ◽  
pp. 111-116 ◽  
Author(s):  
Pietro DeLellis ◽  
Franco Garofalo ◽  
Francesco Lo Iudice
Keyword(s):  
Complex Networks ◽  
Control Strategy ◽  
Pinning Control ◽  
Large Complex

scholarly journals Visualizing Global Properties of Large Complex Networks

PLoS ONE ◽  
2008 ◽  
Vol 3 (7) ◽  
pp. e2541 ◽  
Author(s):  
Weijiang Li ◽  
Hiroyuki Kurata
Keyword(s):  
Complex Networks ◽  
Global Properties ◽  
Large Complex

A New Method for Extracting the Hierarchical Organization of Networks

2017 ◽  
Vol 16 (05) ◽  
pp. 1359-1385 ◽  
Author(s):  
Weihua Zhan ◽  
Jihong Guan ◽  
Zhongzhi Zhang
Keyword(s):  
Complex Networks ◽  
Networked Systems ◽  
Hierarchical Organization ◽  
New Method ◽  
Network Data ◽  
Large Complex

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