Open AccessInterlacing layered complex networks
Author(s) -
Di Shen,
Jianhua Li,
Qiang Zhang,
Rui Zhu
Publication year - 2014
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.63.190201
Subject(s) - interlacing , betweenness centrality , subnet , centrality , node (physics) , computer science , degree (music) , complex network , topology (electrical circuits) , theoretical computer science , algorithm , mathematics , computer network , combinatorics , artificial intelligence , physics , quantum mechanics , world wide web , acoustics
In order to study the structural characteristic and node centrality of a structure composed of two related heterogeneous networks, in this paper, interlacing layered complex networks are defined as networks which are composed of two subnets having the partially same nodes and similar links. Also the definitions of the node interlacing coefficient, path interlacing coefficient and networks interlacing coefficient are given, so the intimacy level of two subnets can be measured definitely. Based on the definitions above, a node centrality algorithm of degree and betweenness is studied and redefined, while a new node centrality measuring index is given, which can be used to measure the supporting degree of a node in one subnet to the others' connectivity and negotiability. Finally, experimental results show that the proposed method is effective.