Open access
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms


Estimating the relative importance of vertices and edges is a fundamental issue in the analysis of complex networks, and has found vast applications in various aspects, such as social networks, power grids, and biological networks. Most previous work focuses on metrics of vertex importance and methods for identifying powerful vertices, while related work for edges is much lesser, especially for weighted networks, due to the computational challenge. In this paper, we propose to use the well-known Kirchhoff index as the measure of edge centrality in weighted networks, called θ-Kirchhoff edge centrality. The Kirchhoff index of a network is defined as the sum of effective resistances over all vertex pairs. The centrality of an edge e is reflected in the increase of Kirchhoff index of the network when the edge e is partially deactivated, characterized by a parameter θ. We define two equivalent measures for θ-Kirchhoff edge centrality. Both are global metrics and have a better discriminating power than commonly used measures, based on local or partial structural information of networks, e.g. edge betweenness and spanning edge centrality.
Despite the strong advantages of Kirchhoff index as a centrality measure and its wide applications, computing the exact value of Kirchhoff edge centrality for each edge in a graph is computationally demanding. To solve this problem, for each of the θ-Kirchhoff edge centrality metrics, we present an efficient algorithm to compute its -approximation for all the m edges in nearly linear time in m. The proposed θ-Kirchhoff edge centrality is the first global metric of edge importance that can be provably approximated in nearly-linear time. Moreover, according to the θ-Kirchhoff edge centrality, we present a θ-Kirchhoff vertex centrality measure, as well as a fast algorithm that can compute e-approximate Kirchhoff vertex centrality for all the n vertices in nearly linear time in m.

Formats available

You can view the full content in the following formats:

Information & Authors


Published In

cover image Proceedings
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages: 2377 - 2396
Editor: Artur Czumaj, University of Warwick, United Kingdom
ISBN (Online): 978-1-61197-503-1


Published online: 2 January 2018




Both authors are with Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai 200433. This work was supported by the National Natural Science Foundation of China under Grant No. 11275049.

Metrics & Citations



If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options


View PDF

Get Access







Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account