2 research outputs found

    Improving information centrality of a node in complex networks by adding edges

    Full text link
    The problem of increasing the centrality of a network node arises in many practical applications. In this paper, we study the optimization problem of maximizing the information centrality IvI_v of a given node vv in a network with nn nodes and mm edges, by creating kk new edges incident to vv. Since IvI_v is the reciprocal of the sum of resistance distance Rv\mathcal{R}_v between vv and all nodes, we alternatively consider the problem of minimizing Rv\mathcal{R}_v by adding kk new edges linked to vv. We show that the objective function is monotone and supermodular. We provide a simple greedy algorithm with an approximation factor (1βˆ’1e)\left(1-\frac{1}{e}\right) and O(n3)O(n^3) running time. To speed up the computation, we also present an algorithm to compute (1βˆ’1eβˆ’Ο΅)\left(1-\frac{1}{e}-\epsilon\right)-approximate resistance distance Rv\mathcal{R}_v after iteratively adding kk edges, the running time of which is O~(mkΟ΅βˆ’2)\widetilde{O} (mk\epsilon^{-2}) for any Ο΅>0\epsilon>0, where the O~(β‹…)\widetilde{O} (\cdot) notation suppresses the poly(log⁑n){\rm poly} (\log n) factors. We experimentally demonstrate the effectiveness and efficiency of our proposed algorithms.Comment: 7 pages, 2 figures, ijcai-201
    corecore