{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T01:17:42Z","timestamp":1764897462815,"version":"3.46.0"},"reference-count":0,"publisher":"Canadian Center of Science and Education","issue":"2","license":[{"start":{"date-parts":[[2017,4,25]],"date-time":"2017-04-25T00:00:00Z","timestamp":1493078400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CIS"],"abstract":"<jats:p>Results of correlation study (using Pearson's correlation coefficient, PCC) between decay centrality (DEC) vs. degree centrality (DEG) and closeness centrality (CLC) for a suite of 48 real-world networks indicate an interesting trend: PCC(DEC, DEG) decreases with increase in the decay parameter \u03b4 (0 &lt; \u03b4 &lt; 1) and PCC(DEC, CLC) decreases with decrease in \u03b4. We make use of this trend of monotonic decrease in the PCC values (from both sides of the \u03b4-search space) and propose a binary search algorithm that (given a threshold value r for the PCC) could be used to identify a value of \u03b4 (if one exists, we say there exists a positive \u03b4-spacer) for a real-world network such that PCC(DEC, DEG) \u2265 r as well as PCC(DEC, CLC) \u2265 r. We show the use of the binary search algorithm to find the maximum Threshold PCC value rmax (such that \u03b4-spacermax is positive) for a real-world network. We observe a very strong correlation between rmax and PCC(DEG, CLC) as well as observe real-world networks with a larger variation in node degree to more likely have a lower rmax value and vice-versa.<\/jats:p>","DOI":"10.5539\/cis.v10n2p52","type":"journal-article","created":{"date-parts":[[2017,4,25]],"date-time":"2017-04-25T02:07:31Z","timestamp":1493086051000},"page":"52","source":"Crossref","is-referenced-by-count":1,"title":["A Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality"],"prefix":"10.5539","volume":"10","author":[{"given":"Natarajan","family":"Meghanathan","sequence":"first","affiliation":[]}],"member":"3486","published-online":{"date-parts":[[2017,4,25]]},"container-title":["Computer and Information Science"],"original-title":[],"link":[{"URL":"http:\/\/www.ccsenet.org\/journal\/index.php\/cis\/article\/viewFile\/67268\/36811","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.ccsenet.org\/journal\/index.php\/CIS\/article\/download\/67268\/36811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T01:13:27Z","timestamp":1764897207000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.ccsenet.org\/journal\/index.php\/cis\/article\/view\/67268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,25]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,3,2]]}},"URL":"https:\/\/doi.org\/10.5539\/cis.v10n2p52","relation":{},"ISSN":["1913-8997","1913-8989"],"issn-type":[{"type":"electronic","value":"1913-8997"},{"type":"print","value":"1913-8989"}],"subject":[],"published":{"date-parts":[[2017,4,25]]}}}