Home

Network Biology, 2012, 2(4): 121-126
[XML] [EndNote Tagged] [BibTex] [ Full PDF (93K)] [Comment Article]

Article

Several mathematical methods for identifying crucial nodes in networks

WenJun Zhang
School of Life Sciences, Sun Yat-sen University, Guangzhou 510275, China; International Academy of Ecology and Environmental Sciences, Hong Kong

Received 9 June 2012;Accepted 15 September 2012;Published online 1 December 2012
IAEES

Abstract
Crucial nodes in a network refer to those nodes that their existence is so important in preserving topological structure of the network and they independently determine the network structure. In this study I introduced and proposed several mathematical methods for identifying crucial nodes in networks. They fall into three categories, node perturbation, network analysis, and network dynamics. Node perturbation methods include adjacency matrix index, degree or flow change index, node perturbation index, etc. Network dynamics methods include network evolution modeling, etc. Network analysis methods include node degree, criticality index, branch flourishing index, node importance index, etc. Advantages and advantages of these methods were discussed. Finally, I suggested that some of these methods may also be used to identify crucial links (connections) in networks. In this case, the change of a link refers to presence/absence of a link, or change of flow in the link, etc.

Keywords networks;crucial nodes;identification;node perturbation;network dynamics;network analysis;crucial links (connections);mathematical methods.



International Academy of Ecology and Environmental Sciences. E-mail: office@iaees.org
Copyright © 2009-2024 International Academy of Ecology and Environmental Sciences. All rights reserved.
Web administrator: office@iaees.org, website@iaees.org; Last modified: 2024/3/29


Translate page to: