An egonet based approach to effective weighted network comparison

Ego-distances

Figure 1 summarizes the workflow of the operations that define the ego-distance \(D(G’,G”)\). We are given the two undirected weighted graphs \(G’\), \(G”\), in general of different sizes \(N_1\), \(N_2\) and densities \(\rho _1\),…

Continue Reading