Distinguishing Arc Types to Understand Complex Network Strength Structures and Hierarchical Connectivity Patterns
Many real-world networks consisting of nodes representing (in)tangible asymmetric information or energy flows must be modeled as directed graphs (digraphs). Several methods for classifying non-directional edges in terms of strong or weak ties have been developed for well-known non-directional networ...
Main Authors: | Chung-Yuan Huang, Wei Chien Benny Chin |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9057711/ |
Similar Items
-
Hermite-Hadamard Type Inequalities via Exponentially (p, h)-Convex Functions
by: N. Mehreen, et al.
Published: (2020-01-01) -
A Certain Class of <italic>t</italic>-Intuitionistic Fuzzy Subgroups
by: Muhammad Gulzar, et al.
Published: (2020-01-01) -
On a Family of Quantum Synchronizable Codes Based on the <inline-formula> <tex-math notation="LaTeX">$(\lambda(u + v)|u - v)$ </tex-math></inline-formula> Construction
by: Chao Du, et al.
Published: (2020-01-01) -
A Multi-Finger GHz Frequency Doubler Based on Amorphous Indium Gallium Zinc Oxide Thin Film Transistors
by: Utpal Kalita, et al.
Published: (2023-01-01) -
Antimagicness of <inline-formula> <tex-math notation="LaTeX">$mC_n$ </tex-math></inline-formula>-Path and Its Disjoint Union
by: Yi Hu, et al.
Published: (2019-01-01)