Unit Disk Graph-Based Node Similarity Index for Complex Network Analysis
We seek to quantify the extent of similarity among nodes in a complex network with respect to two or more node-level metrics (like centrality metrics). In this pursuit, we propose the following unit disk graph-based approach: we first normalize the values for the node-level metrics (using the sum of...
Main Author: | Natarajan Meghanathan |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2019-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2019/6871874 |
Similar Items
-
Neighborhood-based bridge node centrality tuple for complex network analysis
by: Natarajan Meghanathan
Published: (2021-06-01) -
A comprehensive analysis of the correlation between maximal clique size and centrality metrics for complex network graphs
by: Natarajan Meghanathan
Published: (2021-09-01) -
Exploring the step function distribution of the threshold fraction of adopted neighbors versus minimum fraction of nodes as initial adopters to assess the cascade blocking intra-cluster density of complex real-world networks
by: Natarajan Meghanathan
Published: (2020-12-01) -
A two-hop neighbor preference-based random network graph model with high clustering coefficient for modeling real-world complex networks
by: Natarajan Meghanathan, et al.
Published: (2021-09-01) -
Node Similarity Measure for Complex Networks
by: MU Junfang, LIANG Jiye, ZHENG Wenping, LIU Shaoqian, WANG Jie
Published: (2020-05-01)