TY - JOUR
T1 - Beyond bond links in complex networks:Local bridges, global bridges and silk links
AU - Huang, Chung Yuan
AU - Chin, Wei Chien Benny
AU - Fu, Yu Hsiang
AU - Tsai, Yu Shiuan
N1 - Publisher Copyright:
© 2019 The Authors
PY - 2019/12/15
Y1 - 2019/12/15
N2 - Many network researchers use intuitive or basic definitions when discussing the importance of strong and weak links and their roles. Others use an approach best described as “if not strong, then weak” to determine the strengths and weaknesses of individual links, thus deemphasizing hierarchical network structures that allow links to express different strength levels. Here we describe our proposal for a hierarchical edge type analysis (HETA) algorithm for determining link types at multiple network hierarchy levels based on the common neighbor concept plus statistical factors such as bond links, kth-layer local bridges, global bridges, and silk links—all generated during long-term network development and evolution processes. Two sets of networks were used to validate our proposed algorithm, one consisting of 16 networks employed in multiple past studies, and one consisting of two types of one-dimensional small-world networks expressing different random rewiring or shortcut addition probabilities. Two applications with potential for developmental contributions are demonstrated: a network fingerprint analysis framework, and a hierarchical network community partition method.
AB - Many network researchers use intuitive or basic definitions when discussing the importance of strong and weak links and their roles. Others use an approach best described as “if not strong, then weak” to determine the strengths and weaknesses of individual links, thus deemphasizing hierarchical network structures that allow links to express different strength levels. Here we describe our proposal for a hierarchical edge type analysis (HETA) algorithm for determining link types at multiple network hierarchy levels based on the common neighbor concept plus statistical factors such as bond links, kth-layer local bridges, global bridges, and silk links—all generated during long-term network development and evolution processes. Two sets of networks were used to validate our proposed algorithm, one consisting of 16 networks employed in multiple past studies, and one consisting of two types of one-dimensional small-world networks expressing different random rewiring or shortcut addition probabilities. Two applications with potential for developmental contributions are demonstrated: a network fingerprint analysis framework, and a hierarchical network community partition method.
KW - Common neighbor concept
KW - Edge type analysis
KW - Fingerprint analysis
KW - Hierarchical community partition
KW - Hierarchy of links
KW - Network topology
UR - https://www.scopus.com/pages/publications/85065584982
U2 - 10.1016/j.physa.2019.04.263
DO - 10.1016/j.physa.2019.04.263
M3 - 文章
AN - SCOPUS:85065584982
SN - 0378-4371
VL - 536
JO - Physica A: Statistical Mechanics and its Applications
JF - Physica A: Statistical Mechanics and its Applications
M1 - 121027
ER -