Title: An efficient analysis on the network coverage via dominating centrality sets
Authors: Frederick Kin Hing Phoa - Academia Sinica (Taiwan) [presenting]
Abstract: Despite analyzing via any traditional measures on the network centrality, misleading suggestions might result when there exists more than one center in a network, which commonly happened nowadays. Sequential selection on the network centers usually failed to reveal the truly influential set of center nodes due to the curse of double counting. We introduced a new measure on the network coverage of the influential set of center nodes via a new graph-theoretic tool called the dominating centrality set (DCS). It simultaneously identified the center nodes and analyzed their coverage to the whole networks. Exact formulas on cycle counts from nodes were derived to provide computationally efficient calculations on the DCS. We demonstrated this method to the analysis of Amazon product network and the DBLP network, and hinted the potential use of this method towards the analysis of Web of Science database.