# Edge Similarity Index for Complex Network Analysis

• Natarajan Meghanathan Jackson State University
Keywords: Edge Similarity, Centrality Metrics, Threshold Distance, Binary Search Algorithm

### Abstract

We propose a novel network-level metric called Edge Similarity Index (ESI) to quantify the extent of similarity between any two edges of a complex network with respect to the values for a node-level metric (like centrality metric) of its end vertices. To assess the ESI measure for a complex real-world network with respect to a node-level metric, we propose to first construct a logical network whose vertices are the actual edges of the network (with coordinates corresponding to the normalized node-level metric values of the actual end vertices) and there exists a (logical) edge between two logical vertices if the Euclidean distance between their corresponding coordinates is within a threshold distance. We propose a binary search algorithm to determine the minimum value for this threshold distance () that would result in a connected logical unit-disk graph; the ESI value for the complex network is then computed as . The ESI values range from 0.0 to 1.0; the larger the ESI value with respect to a node-level metric, we claim that more similar are any two edges in the network with respect to the node-level metric values for their end vertices.

Published
2020-01-03
How to Cite
Meghanathan, N. (2020). Edge Similarity Index for Complex Network Analysis. International Journal of Combinatorial Optimization Problems and Informatics, 11(3), 76-96. Retrieved from https://ijcopi.org/ojs/article/view/129
Issue
Section
Articles
{"ft_lang_label":"__label__en","ft_lang_prob":0.8700609,"math_prob":0.8438861,"size":1216,"snap":"2020-45-2020-50","text_gpt3_token_len":239,"char_repetition_ratio":0.14356436,"word_repetition_ratio":0.041237112,"special_character_ratio":0.18832237,"punctuation_ratio":0.046296295,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9874053,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-20T03:38:06Z\",\"WARC-Record-ID\":\"<urn:uuid:e18b64dc-2ae9-4462-8a1f-84c29916725f>\",\"Content-Length\":\"21004\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5b2a490e-0fa8-451e-93bf-bb8ee043d948>\",\"WARC-Concurrent-To\":\"<urn:uuid:ee4ac89e-6eaa-4d49-a4c6-355b5d6444f2>\",\"WARC-IP-Address\":\"88.198.192.91\",\"WARC-Target-URI\":\"https://ijcopi.org/ojs/article/view/129\",\"WARC-Payload-Digest\":\"sha1:4ZNB27ALB3XQ3W4NA5JOYRIUTFBIJOFW\",\"WARC-Block-Digest\":\"sha1:NC3KYR3M2362NLC3AGZN3UGAGQDALQTS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107869785.9_warc_CC-MAIN-20201020021700-20201020051700-00657.warc.gz\"}"}