A New Approach for Discovering and Quantifying Hierarchical Structure of Complex Networks

Author(s):  
Suyong Eum ◽  
Shin'ichi Arakawa ◽  
Masayuki Murata
2003 ◽  
Vol 2 (1) ◽  
pp. 3-15 ◽  
Author(s):  
Quang Vinh Nguyen ◽  
Mao Lin Huang

This paper describes a new approach, space-optimized tree, for the visualization and navigation of tree-structured relational data. This technique can be used especially for the display of very large hierarchies in a two-dimensional space. We discuss the advantages and limitations of current techniques of tree visualization. Our strategy is to optimize the drawing of trees in a geometrical plane and maximize the utilization of display space by allowing more nodes and links to be displayed at a limited screen resolution. Space-optimized tree is a connection+ enclosure visualization approach that recursively positions children of a subtree into polygon areas and still uses a node–link diagram to present the entire hierarchical structure. To be able to handle the navigation of large hierarchies, we use a new hybrid viewing technique that combines two viewing methods, the modified semantic zooming and a focus+ context technique. While the semantic zooming technique can enlarge a particular viewing area by filtering out the rest of tree structure from the visualization, the focus+context technique allows the user to interactively focus, view and browse the entire visual structure with a reasonable high-density display.


Author(s):  
Qingcheng Hu ◽  
Yang Gao ◽  
Pengfei Ma ◽  
Yanshen Yin ◽  
Yong Zhang ◽  
...  

PLoS ONE ◽  
2012 ◽  
Vol 7 (9) ◽  
pp. e44459 ◽  
Author(s):  
Yang-Yu Liu ◽  
Jean-Jacques Slotine ◽  
Albert-László Barabási

2009 ◽  
Vol 19 (02) ◽  
pp. 727-735 ◽  
Author(s):  
S. BOCCALETTI ◽  
R. CRIADO ◽  
J. PELLO ◽  
M. ROMANCE ◽  
M. VELA-PÉREZ

An efficient and computationally advantageous definition of vulnerability of a complex network is introduced, through which one is able to overcome a series of practical difficulties encountered by the measurements used so far to quantify a network's security and stability under the effects of failures, attacks or disfunctions. By means of this approach, we prove a series of theorems that allow to gather information on the ranking of the nodes of a network with respect to their strategic importance in order to preserve the functioning and performance of the network as a whole.


2020 ◽  
Vol 145 ◽  
pp. 113132
Author(s):  
Wen-Ting Wang ◽  
Yu-Lin He ◽  
Joshua Zhexue Huang ◽  
Li-Heng Ma

2007 ◽  
Vol 40 (19) ◽  
pp. 5013-5023 ◽  
Author(s):  
Fei Chen ◽  
Zengqiang Chen ◽  
Zhongxin Liu ◽  
Linying Xiang ◽  
Zhuzhi Yuan

Sign in / Sign up

Export Citation Format

Share Document