Unit Disk Graph-Based Node Similarity Index for Complex Network Analysis

Algorithm 1

Pseudo Code for the Binary Search Algorithm to Determine the Node Similarity Index (NSI).

Inputs

Real-world network graph,

Number of centrality metrics,

The normalized centrality values for each vertex in

// The centrality-based logical coordinates for a vertex is represented as

Auxiliary Variables

Left Index = 0, Right Index = , Middle Index,

Begin Binary Search Algorithm

while ( | Right Index - Left Index | > ) do

Middle Index = (Left Index + Right Index) / 2

Construct Logical Graph for the vertices using the Middle Index as the threshold distance

/ Two vertices and in are connected with an edge in if the Euclidean distance

Middle Index /

if ( is connected ) then

Right Index = Middle Index

else

Left Index = Middle Index

end if

end while

return NSI = ( 1 − Right Index ) /

End Binary Search Algorithm